/usr/bin/java -Xmx16000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-lit/fkp2013-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 15:12:50,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 15:12:50,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 15:12:50,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 15:12:50,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 15:12:50,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 15:12:50,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 15:12:50,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 15:12:50,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 15:12:50,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 15:12:50,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 15:12:50,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 15:12:50,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 15:12:50,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 15:12:50,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 15:12:50,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 15:12:50,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 15:12:50,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 15:12:50,696 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 15:12:50,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 15:12:50,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 15:12:50,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 15:12:50,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 15:12:50,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 15:12:50,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 15:12:50,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 15:12:50,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 15:12:50,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 15:12:50,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 15:12:50,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 15:12:50,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 15:12:50,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 15:12:50,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 15:12:50,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 15:12:50,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 15:12:50,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 15:12:50,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 15:12:50,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 15:12:50,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 15:12:50,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 15:12:50,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 15:12:50,747 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-11 15:12:50,783 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 15:12:50,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 15:12:50,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 15:12:50,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 15:12:50,786 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 15:12:50,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 15:12:50,786 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 15:12:50,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 15:12:50,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 15:12:50,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 15:12:50,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 15:12:50,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 15:12:50,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 15:12:50,788 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 15:12:50,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 15:12:50,789 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 15:12:50,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 15:12:50,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 15:12:50,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 15:12:50,790 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 15:12:50,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 15:12:50,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 15:12:50,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 15:12:50,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 15:12:50,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 15:12:50,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 15:12:50,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 15:12:50,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 15:12:50,792 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 15:12:50,792 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 15:12:51,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 15:12:51,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 15:12:51,110 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 15:12:51,111 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 15:12:51,112 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 15:12:51,112 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/fkp2013-1.i [2020-10-11 15:12:51,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e586c537/18155b424e3440d28049b8419352aa1e/FLAG067d88441 [2020-10-11 15:12:51,694 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 15:12:51,695 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fkp2013-1.i [2020-10-11 15:12:51,709 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e586c537/18155b424e3440d28049b8419352aa1e/FLAG067d88441 [2020-10-11 15:12:52,003 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e586c537/18155b424e3440d28049b8419352aa1e [2020-10-11 15:12:52,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 15:12:52,013 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 15:12:52,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 15:12:52,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 15:12:52,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 15:12:52,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:52,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f6582d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52, skipping insertion in model container [2020-10-11 15:12:52,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:52,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 15:12:52,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 15:12:52,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:12:52,545 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 15:12:52,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:12:52,663 INFO L208 MainTranslator]: Completed translation [2020-10-11 15:12:52,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52 WrapperNode [2020-10-11 15:12:52,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 15:12:52,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 15:12:52,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 15:12:52,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 15:12:52,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:52,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:52,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 15:12:52,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 15:12:52,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 15:12:52,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 15:12:52,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:52,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:52,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:52,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:52,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:52,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:52,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... [2020-10-11 15:12:52,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 15:12:52,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 15:12:52,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 15:12:52,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 15:12:52,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 15:12:52,841 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2020-10-11 15:12:52,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2020-10-11 15:12:52,842 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-10-11 15:12:52,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-10-11 15:12:52,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 15:12:52,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 15:12:52,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 15:12:52,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 15:12:52,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 15:12:52,844 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 15:12:53,213 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 15:12:53,213 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-10-11 15:12:53,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:12:53 BoogieIcfgContainer [2020-10-11 15:12:53,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 15:12:53,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 15:12:53,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 15:12:53,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 15:12:53,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:12:52" (1/3) ... [2020-10-11 15:12:53,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ecb8e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:12:53, skipping insertion in model container [2020-10-11 15:12:53,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:52" (2/3) ... [2020-10-11 15:12:53,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ecb8e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:12:53, skipping insertion in model container [2020-10-11 15:12:53,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:12:53" (3/3) ... [2020-10-11 15:12:53,223 INFO L111 eAbstractionObserver]: Analyzing ICFG fkp2013-1.i [2020-10-11 15:12:53,235 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 15:12:53,235 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 15:12:53,243 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-11 15:12:53,244 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 15:12:53,275 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,275 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,275 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,276 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,276 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,276 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,277 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,277 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,277 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,278 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,279 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,280 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,281 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,284 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,285 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,285 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,286 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,286 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,292 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,293 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:53,306 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-11 15:12:53,323 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:12:53,323 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:12:53,323 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:12:53,323 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:12:53,323 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:12:53,324 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:12:53,324 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:12:53,324 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:12:53,336 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:12:53,339 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions, 112 flow [2020-10-11 15:12:53,341 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 51 transitions, 112 flow [2020-10-11 15:12:53,343 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 112 flow [2020-10-11 15:12:53,380 INFO L129 PetriNetUnfolder]: 3/61 cut-off events. [2020-10-11 15:12:53,381 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 15:12:53,389 INFO L80 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2020-10-11 15:12:53,392 INFO L117 LiptonReduction]: Number of co-enabled transitions 692 [2020-10-11 15:12:54,504 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-10-11 15:12:54,565 INFO L132 LiptonReduction]: Checked pairs total: 670 [2020-10-11 15:12:54,565 INFO L134 LiptonReduction]: Total number of compositions: 47 [2020-10-11 15:12:54,573 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 12 transitions, 34 flow [2020-10-11 15:12:54,588 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-10-11 15:12:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-10-11 15:12:54,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-11 15:12:54,600 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:54,601 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-11 15:12:54,602 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:12:54,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:54,607 INFO L82 PathProgramCache]: Analyzing trace with hash 208056, now seen corresponding path program 1 times [2020-10-11 15:12:54,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:54,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135167604] [2020-10-11 15:12:54,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:54,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135167604] [2020-10-11 15:12:54,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:54,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:12:54,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664702416] [2020-10-11 15:12:54,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:12:54,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:54,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:12:54,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:12:54,826 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-10-11 15:12:54,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:54,856 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2020-10-11 15:12:54,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:12:54,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-11 15:12:54,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:54,868 INFO L225 Difference]: With dead ends: 35 [2020-10-11 15:12:54,869 INFO L226 Difference]: Without dead ends: 31 [2020-10-11 15:12:54,870 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:12:54,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-11 15:12:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-10-11 15:12:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-11 15:12:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-10-11 15:12:54,904 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2020-10-11 15:12:54,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:54,904 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-10-11 15:12:54,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:12:54,905 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-10-11 15:12:54,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-11 15:12:54,905 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:54,906 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:54,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 15:12:54,906 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:12:54,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:54,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1139052385, now seen corresponding path program 1 times [2020-10-11 15:12:54,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:54,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145557237] [2020-10-11 15:12:54,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:54,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145557237] [2020-10-11 15:12:54,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:54,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 15:12:54,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096348363] [2020-10-11 15:12:54,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:12:54,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:54,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:12:54,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:12:54,993 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2020-10-11 15:12:55,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:55,006 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-10-11 15:12:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-11 15:12:55,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-10-11 15:12:55,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:55,008 INFO L225 Difference]: With dead ends: 26 [2020-10-11 15:12:55,008 INFO L226 Difference]: Without dead ends: 24 [2020-10-11 15:12:55,009 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:12:55,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-11 15:12:55,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-11 15:12:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-11 15:12:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-10-11 15:12:55,014 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2020-10-11 15:12:55,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:55,014 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-10-11 15:12:55,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:12:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-10-11 15:12:55,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-11 15:12:55,015 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:55,015 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:55,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 15:12:55,016 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:12:55,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:55,016 INFO L82 PathProgramCache]: Analyzing trace with hash -950894116, now seen corresponding path program 1 times [2020-10-11 15:12:55,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:55,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70934786] [2020-10-11 15:12:55,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:12:55,053 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:12:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:12:55,066 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:12:55,089 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 15:12:55,089 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 15:12:55,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 15:12:55,091 WARN L371 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-11 15:12:55,091 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-10-11 15:12:55,101 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,101 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,101 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,101 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,102 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,102 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,102 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,102 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,102 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,103 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,103 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,103 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,103 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,103 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,103 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,104 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,104 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,104 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,110 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,110 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,111 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,111 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,111 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,113 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,114 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,114 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,114 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,114 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,123 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,123 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,124 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,124 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,124 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:55,126 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-11 15:12:55,127 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:12:55,127 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:12:55,127 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:12:55,127 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:12:55,127 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:12:55,127 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:12:55,128 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:12:55,128 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:12:55,132 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:12:55,132 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions, 162 flow [2020-10-11 15:12:55,133 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 69 transitions, 162 flow [2020-10-11 15:12:55,133 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions, 162 flow [2020-10-11 15:12:55,171 INFO L129 PetriNetUnfolder]: 4/83 cut-off events. [2020-10-11 15:12:55,172 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-11 15:12:55,174 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 141 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2020-10-11 15:12:55,177 INFO L117 LiptonReduction]: Number of co-enabled transitions 1108 [2020-10-11 15:12:56,275 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-10-11 15:12:56,338 INFO L132 LiptonReduction]: Checked pairs total: 1240 [2020-10-11 15:12:56,339 INFO L134 LiptonReduction]: Total number of compositions: 62 [2020-10-11 15:12:56,339 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 21 transitions, 66 flow [2020-10-11 15:12:56,363 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2020-10-11 15:12:56,363 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2020-10-11 15:12:56,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-11 15:12:56,366 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:56,366 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-11 15:12:56,366 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:56,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:56,371 INFO L82 PathProgramCache]: Analyzing trace with hash 354555, now seen corresponding path program 1 times [2020-10-11 15:12:56,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:56,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151369551] [2020-10-11 15:12:56,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:56,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151369551] [2020-10-11 15:12:56,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:56,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:12:56,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590075532] [2020-10-11 15:12:56,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:12:56,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:56,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:12:56,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:12:56,412 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2020-10-11 15:12:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:56,437 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2020-10-11 15:12:56,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:12:56,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-11 15:12:56,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:56,443 INFO L225 Difference]: With dead ends: 185 [2020-10-11 15:12:56,443 INFO L226 Difference]: Without dead ends: 171 [2020-10-11 15:12:56,444 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:12:56,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-11 15:12:56,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-10-11 15:12:56,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-10-11 15:12:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 418 transitions. [2020-10-11 15:12:56,471 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 418 transitions. Word has length 3 [2020-10-11 15:12:56,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:56,471 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 418 transitions. [2020-10-11 15:12:56,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:12:56,471 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 418 transitions. [2020-10-11 15:12:56,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 15:12:56,472 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:56,472 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:56,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 15:12:56,472 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:56,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:56,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1106209149, now seen corresponding path program 1 times [2020-10-11 15:12:56,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:56,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257378120] [2020-10-11 15:12:56,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:56,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257378120] [2020-10-11 15:12:56,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:56,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:12:56,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720059236] [2020-10-11 15:12:56,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:12:56,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:56,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:12:56,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:12:56,553 INFO L87 Difference]: Start difference. First operand 171 states and 418 transitions. Second operand 5 states. [2020-10-11 15:12:56,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:56,606 INFO L93 Difference]: Finished difference Result 205 states and 460 transitions. [2020-10-11 15:12:56,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:12:56,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-11 15:12:56,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:56,610 INFO L225 Difference]: With dead ends: 205 [2020-10-11 15:12:56,610 INFO L226 Difference]: Without dead ends: 201 [2020-10-11 15:12:56,610 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:12:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-11 15:12:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2020-10-11 15:12:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-11 15:12:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2020-10-11 15:12:56,643 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2020-10-11 15:12:56,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:56,644 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2020-10-11 15:12:56,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:12:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2020-10-11 15:12:56,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 15:12:56,645 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:56,645 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:56,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 15:12:56,646 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:56,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:56,646 INFO L82 PathProgramCache]: Analyzing trace with hash 583411714, now seen corresponding path program 1 times [2020-10-11 15:12:56,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:56,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520279721] [2020-10-11 15:12:56,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:12:56,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520279721] [2020-10-11 15:12:56,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:56,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:12:56,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095664886] [2020-10-11 15:12:56,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:12:56,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:56,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:12:56,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:12:56,712 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2020-10-11 15:12:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:56,766 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2020-10-11 15:12:56,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:12:56,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-11 15:12:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:56,770 INFO L225 Difference]: With dead ends: 189 [2020-10-11 15:12:56,771 INFO L226 Difference]: Without dead ends: 185 [2020-10-11 15:12:56,771 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:12:56,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-11 15:12:56,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2020-10-11 15:12:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-11 15:12:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2020-10-11 15:12:56,785 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2020-10-11 15:12:56,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:56,787 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2020-10-11 15:12:56,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:12:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2020-10-11 15:12:56,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-11 15:12:56,789 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:56,789 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:56,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 15:12:56,789 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:56,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:56,790 INFO L82 PathProgramCache]: Analyzing trace with hash 903154619, now seen corresponding path program 1 times [2020-10-11 15:12:56,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:56,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29589875] [2020-10-11 15:12:56,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:12:56,805 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:12:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:12:56,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:12:56,824 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 15:12:56,824 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 15:12:56,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 15:12:56,825 WARN L371 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-11 15:12:56,826 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-10-11 15:12:56,860 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,860 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,860 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,860 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,861 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,861 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,861 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,861 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,861 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,862 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,862 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,862 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,862 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,862 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,863 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,863 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,863 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,863 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,863 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,863 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,864 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,864 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,864 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,864 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,864 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,864 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,865 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,865 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,865 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,866 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,866 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,866 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,867 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,867 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,868 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,868 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,868 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,868 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,869 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,869 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,870 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,870 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,871 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,871 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,871 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,871 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,872 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,872 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,872 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,872 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,873 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,874 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,874 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,874 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,875 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,875 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,876 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,876 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,876 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,876 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,877 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,880 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,880 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,883 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:56,884 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 15:12:56,884 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:12:56,884 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:12:56,885 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:12:56,885 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:12:56,885 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:12:56,885 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:12:56,885 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:12:56,885 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:12:56,887 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:12:56,888 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 87 transitions, 216 flow [2020-10-11 15:12:56,888 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 87 transitions, 216 flow [2020-10-11 15:12:56,888 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions, 216 flow [2020-10-11 15:12:56,907 INFO L129 PetriNetUnfolder]: 5/105 cut-off events. [2020-10-11 15:12:56,907 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-11 15:12:56,908 INFO L80 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2020-10-11 15:12:56,911 INFO L117 LiptonReduction]: Number of co-enabled transitions 1608 [2020-10-11 15:12:58,157 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-10-11 15:12:58,323 INFO L132 LiptonReduction]: Checked pairs total: 2157 [2020-10-11 15:12:58,323 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-11 15:12:58,323 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 27 transitions, 96 flow [2020-10-11 15:12:58,350 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2020-10-11 15:12:58,351 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2020-10-11 15:12:58,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-11 15:12:58,351 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:58,351 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-11 15:12:58,352 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:58,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:58,352 INFO L82 PathProgramCache]: Analyzing trace with hash 535749, now seen corresponding path program 1 times [2020-10-11 15:12:58,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:58,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284934409] [2020-10-11 15:12:58,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:58,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284934409] [2020-10-11 15:12:58,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:58,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:12:58,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229128668] [2020-10-11 15:12:58,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:12:58,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:58,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:12:58,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:12:58,373 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2020-10-11 15:12:58,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:58,419 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2020-10-11 15:12:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:12:58,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-11 15:12:58,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:58,430 INFO L225 Difference]: With dead ends: 600 [2020-10-11 15:12:58,430 INFO L226 Difference]: Without dead ends: 559 [2020-10-11 15:12:58,431 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:12:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-10-11 15:12:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2020-10-11 15:12:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2020-10-11 15:12:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1737 transitions. [2020-10-11 15:12:58,476 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1737 transitions. Word has length 3 [2020-10-11 15:12:58,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:58,477 INFO L481 AbstractCegarLoop]: Abstraction has 559 states and 1737 transitions. [2020-10-11 15:12:58,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:12:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1737 transitions. [2020-10-11 15:12:58,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 15:12:58,478 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:58,478 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:58,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 15:12:58,478 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:58,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:58,479 INFO L82 PathProgramCache]: Analyzing trace with hash -404806880, now seen corresponding path program 1 times [2020-10-11 15:12:58,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:58,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115672745] [2020-10-11 15:12:58,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:58,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:58,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115672745] [2020-10-11 15:12:58,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:58,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:12:58,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710575022] [2020-10-11 15:12:58,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:12:58,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:58,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:12:58,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:12:58,520 INFO L87 Difference]: Start difference. First operand 559 states and 1737 transitions. Second operand 5 states. [2020-10-11 15:12:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:58,584 INFO L93 Difference]: Finished difference Result 817 states and 2317 transitions. [2020-10-11 15:12:58,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:12:58,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-11 15:12:58,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:58,591 INFO L225 Difference]: With dead ends: 817 [2020-10-11 15:12:58,591 INFO L226 Difference]: Without dead ends: 812 [2020-10-11 15:12:58,591 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:12:58,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-10-11 15:12:58,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 585. [2020-10-11 15:12:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2020-10-11 15:12:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1832 transitions. [2020-10-11 15:12:58,622 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1832 transitions. Word has length 9 [2020-10-11 15:12:58,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:58,622 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 1832 transitions. [2020-10-11 15:12:58,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:12:58,623 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1832 transitions. [2020-10-11 15:12:58,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 15:12:58,624 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:58,624 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:58,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 15:12:58,624 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:58,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:58,625 INFO L82 PathProgramCache]: Analyzing trace with hash -669323978, now seen corresponding path program 1 times [2020-10-11 15:12:58,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:58,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971671884] [2020-10-11 15:12:58,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:12:58,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971671884] [2020-10-11 15:12:58,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:58,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:12:58,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971464193] [2020-10-11 15:12:58,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:12:58,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:58,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:12:58,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:12:58,661 INFO L87 Difference]: Start difference. First operand 585 states and 1832 transitions. Second operand 5 states. [2020-10-11 15:12:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:58,727 INFO L93 Difference]: Finished difference Result 843 states and 2406 transitions. [2020-10-11 15:12:58,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:12:58,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-11 15:12:58,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:58,734 INFO L225 Difference]: With dead ends: 843 [2020-10-11 15:12:58,735 INFO L226 Difference]: Without dead ends: 836 [2020-10-11 15:12:58,735 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:12:58,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2020-10-11 15:12:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 611. [2020-10-11 15:12:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2020-10-11 15:12:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1906 transitions. [2020-10-11 15:12:58,762 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1906 transitions. Word has length 13 [2020-10-11 15:12:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:58,763 INFO L481 AbstractCegarLoop]: Abstraction has 611 states and 1906 transitions. [2020-10-11 15:12:58,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:12:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1906 transitions. [2020-10-11 15:12:58,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:12:58,764 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:58,764 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:58,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 15:12:58,765 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:58,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:58,765 INFO L82 PathProgramCache]: Analyzing trace with hash -56737855, now seen corresponding path program 1 times [2020-10-11 15:12:58,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:58,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138750941] [2020-10-11 15:12:58,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:58,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:58,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138750941] [2020-10-11 15:12:58,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76239237] [2020-10-11 15:12:58,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:12:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:58,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:12:58,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:12:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:12:58,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:12:58,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:12:58,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784691805] [2020-10-11 15:12:58,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:12:58,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:58,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:12:58,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:12:58,942 INFO L87 Difference]: Start difference. First operand 611 states and 1906 transitions. Second operand 9 states. [2020-10-11 15:12:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:59,155 INFO L93 Difference]: Finished difference Result 1059 states and 2818 transitions. [2020-10-11 15:12:59,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:12:59,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-11 15:12:59,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:59,163 INFO L225 Difference]: With dead ends: 1059 [2020-10-11 15:12:59,163 INFO L226 Difference]: Without dead ends: 1052 [2020-10-11 15:12:59,163 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:12:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2020-10-11 15:12:59,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 591. [2020-10-11 15:12:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-10-11 15:12:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1840 transitions. [2020-10-11 15:12:59,191 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1840 transitions. Word has length 15 [2020-10-11 15:12:59,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:59,192 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 1840 transitions. [2020-10-11 15:12:59,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:12:59,192 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1840 transitions. [2020-10-11 15:12:59,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:12:59,193 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:59,193 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:59,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-10-11 15:12:59,409 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:59,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:59,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1024744543, now seen corresponding path program 2 times [2020-10-11 15:12:59,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:59,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311573053] [2020-10-11 15:12:59,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:12:59,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311573053] [2020-10-11 15:12:59,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:59,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:12:59,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605474567] [2020-10-11 15:12:59,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:12:59,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:59,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:12:59,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:12:59,457 INFO L87 Difference]: Start difference. First operand 591 states and 1840 transitions. Second operand 7 states. [2020-10-11 15:12:59,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:59,608 INFO L93 Difference]: Finished difference Result 1053 states and 2807 transitions. [2020-10-11 15:12:59,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:12:59,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-11 15:12:59,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:59,616 INFO L225 Difference]: With dead ends: 1053 [2020-10-11 15:12:59,616 INFO L226 Difference]: Without dead ends: 1045 [2020-10-11 15:12:59,616 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:12:59,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2020-10-11 15:12:59,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2020-10-11 15:12:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2020-10-11 15:12:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2020-10-11 15:12:59,661 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2020-10-11 15:12:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:59,662 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2020-10-11 15:12:59,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:12:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2020-10-11 15:12:59,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-11 15:12:59,663 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:59,663 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:59,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 15:12:59,664 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:59,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:59,664 INFO L82 PathProgramCache]: Analyzing trace with hash 68174732, now seen corresponding path program 1 times [2020-10-11 15:12:59,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:59,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460454396] [2020-10-11 15:12:59,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:12:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:12:59,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460454396] [2020-10-11 15:12:59,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:12:59,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:12:59,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460373648] [2020-10-11 15:12:59,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:12:59,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:12:59,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:12:59,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:12:59,736 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2020-10-11 15:12:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:12:59,799 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2020-10-11 15:12:59,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:12:59,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-11 15:12:59,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:12:59,805 INFO L225 Difference]: With dead ends: 736 [2020-10-11 15:12:59,805 INFO L226 Difference]: Without dead ends: 728 [2020-10-11 15:12:59,806 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:12:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-10-11 15:12:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2020-10-11 15:12:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2020-10-11 15:12:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2020-10-11 15:12:59,828 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2020-10-11 15:12:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:12:59,828 INFO L481 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2020-10-11 15:12:59,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:12:59,828 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2020-10-11 15:12:59,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:12:59,829 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:12:59,830 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:12:59,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 15:12:59,830 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:12:59,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:12:59,830 INFO L82 PathProgramCache]: Analyzing trace with hash 2109628021, now seen corresponding path program 1 times [2020-10-11 15:12:59,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:12:59,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080141531] [2020-10-11 15:12:59,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:12:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:12:59,841 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:12:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:12:59,850 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:12:59,857 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 15:12:59,857 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 15:12:59,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 15:12:59,858 WARN L371 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-11 15:12:59,858 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-10-11 15:12:59,870 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,870 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,870 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,870 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,871 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,871 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,871 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,871 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,871 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,872 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,872 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,872 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,872 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,872 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,872 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,873 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,873 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,873 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,873 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,873 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,873 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,873 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,874 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,874 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,874 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,874 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,874 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,874 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,874 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,875 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,875 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,875 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,875 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,875 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,875 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,875 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,876 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,876 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,876 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,876 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,877 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,879 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,879 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,880 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,880 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,880 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,880 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,883 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,883 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,883 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,883 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,883 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,884 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,884 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,884 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,885 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,885 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,886 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,886 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,886 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,887 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,887 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,887 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,887 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,888 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,889 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,889 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,889 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,889 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,889 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,891 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,891 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:12:59,899 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-11 15:12:59,899 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:12:59,899 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:12:59,899 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:12:59,899 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:12:59,899 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:12:59,900 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:12:59,900 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:12:59,900 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:12:59,901 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:12:59,902 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 105 transitions, 274 flow [2020-10-11 15:12:59,902 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 105 transitions, 274 flow [2020-10-11 15:12:59,902 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions, 274 flow [2020-10-11 15:12:59,922 INFO L129 PetriNetUnfolder]: 6/127 cut-off events. [2020-10-11 15:12:59,922 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-11 15:12:59,924 INFO L80 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 211 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2020-10-11 15:12:59,928 INFO L117 LiptonReduction]: Number of co-enabled transitions 2192 [2020-10-11 15:13:01,523 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2020-10-11 15:13:01,581 INFO L132 LiptonReduction]: Checked pairs total: 2978 [2020-10-11 15:13:01,582 INFO L134 LiptonReduction]: Total number of compositions: 97 [2020-10-11 15:13:01,582 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 33 transitions, 130 flow [2020-10-11 15:13:01,692 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2020-10-11 15:13:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2020-10-11 15:13:01,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-11 15:13:01,693 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:01,693 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-11 15:13:01,694 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:13:01,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:01,694 INFO L82 PathProgramCache]: Analyzing trace with hash 753552, now seen corresponding path program 1 times [2020-10-11 15:13:01,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:01,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608336675] [2020-10-11 15:13:01,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:01,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608336675] [2020-10-11 15:13:01,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:01,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:13:01,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494183272] [2020-10-11 15:13:01,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:13:01,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:01,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:13:01,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:13:01,715 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2020-10-11 15:13:01,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:01,752 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2020-10-11 15:13:01,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:13:01,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-11 15:13:01,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:01,770 INFO L225 Difference]: With dead ends: 1889 [2020-10-11 15:13:01,770 INFO L226 Difference]: Without dead ends: 1767 [2020-10-11 15:13:01,771 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:13:01,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2020-10-11 15:13:01,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2020-10-11 15:13:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2020-10-11 15:13:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 6690 transitions. [2020-10-11 15:13:01,854 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 6690 transitions. Word has length 3 [2020-10-11 15:13:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:01,854 INFO L481 AbstractCegarLoop]: Abstraction has 1767 states and 6690 transitions. [2020-10-11 15:13:01,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:13:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 6690 transitions. [2020-10-11 15:13:01,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 15:13:01,855 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:01,855 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:01,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 15:13:01,855 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:13:01,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:01,856 INFO L82 PathProgramCache]: Analyzing trace with hash -260829075, now seen corresponding path program 1 times [2020-10-11 15:13:01,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:01,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778210719] [2020-10-11 15:13:01,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:01,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778210719] [2020-10-11 15:13:01,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:01,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:13:01,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430524626] [2020-10-11 15:13:01,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:13:01,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:01,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:13:01,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:13:01,883 INFO L87 Difference]: Start difference. First operand 1767 states and 6690 transitions. Second operand 5 states. [2020-10-11 15:13:01,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:01,962 INFO L93 Difference]: Finished difference Result 2905 states and 10138 transitions. [2020-10-11 15:13:01,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:01,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-11 15:13:01,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:01,987 INFO L225 Difference]: With dead ends: 2905 [2020-10-11 15:13:01,987 INFO L226 Difference]: Without dead ends: 2899 [2020-10-11 15:13:01,987 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:02,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-10-11 15:13:02,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1966. [2020-10-11 15:13:02,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2020-10-11 15:13:02,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 7503 transitions. [2020-10-11 15:13:02,095 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 7503 transitions. Word has length 9 [2020-10-11 15:13:02,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:02,096 INFO L481 AbstractCegarLoop]: Abstraction has 1966 states and 7503 transitions. [2020-10-11 15:13:02,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:02,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 7503 transitions. [2020-10-11 15:13:02,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 15:13:02,096 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:02,097 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:02,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 15:13:02,097 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:13:02,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:02,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1408743431, now seen corresponding path program 1 times [2020-10-11 15:13:02,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:02,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995744298] [2020-10-11 15:13:02,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:02,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995744298] [2020-10-11 15:13:02,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:02,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:13:02,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507741946] [2020-10-11 15:13:02,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:13:02,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:02,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:13:02,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:13:02,129 INFO L87 Difference]: Start difference. First operand 1966 states and 7503 transitions. Second operand 5 states. [2020-10-11 15:13:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:02,211 INFO L93 Difference]: Finished difference Result 3204 states and 11312 transitions. [2020-10-11 15:13:02,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:02,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-11 15:13:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:02,247 INFO L225 Difference]: With dead ends: 3204 [2020-10-11 15:13:02,248 INFO L226 Difference]: Without dead ends: 3194 [2020-10-11 15:13:02,248 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2020-10-11 15:13:02,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2200. [2020-10-11 15:13:02,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2020-10-11 15:13:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 8453 transitions. [2020-10-11 15:13:02,409 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 8453 transitions. Word has length 13 [2020-10-11 15:13:02,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:02,410 INFO L481 AbstractCegarLoop]: Abstraction has 2200 states and 8453 transitions. [2020-10-11 15:13:02,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 8453 transitions. [2020-10-11 15:13:02,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:13:02,411 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:02,411 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:02,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 15:13:02,411 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:13:02,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:02,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1555768808, now seen corresponding path program 1 times [2020-10-11 15:13:02,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:02,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233987955] [2020-10-11 15:13:02,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:02,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233987955] [2020-10-11 15:13:02,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287430948] [2020-10-11 15:13:02,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:02,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:13:02,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:02,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:02,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:02,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:13:02,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380822587] [2020-10-11 15:13:02,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:02,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:02,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:02,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:02,538 INFO L87 Difference]: Start difference. First operand 2200 states and 8453 transitions. Second operand 9 states. [2020-10-11 15:13:02,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:02,763 INFO L93 Difference]: Finished difference Result 4556 states and 14911 transitions. [2020-10-11 15:13:02,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:02,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-11 15:13:02,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:02,786 INFO L225 Difference]: With dead ends: 4556 [2020-10-11 15:13:02,786 INFO L226 Difference]: Without dead ends: 4546 [2020-10-11 15:13:02,787 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:13:02,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2020-10-11 15:13:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 2157. [2020-10-11 15:13:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2020-10-11 15:13:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 8278 transitions. [2020-10-11 15:13:02,900 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 8278 transitions. Word has length 15 [2020-10-11 15:13:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:02,900 INFO L481 AbstractCegarLoop]: Abstraction has 2157 states and 8278 transitions. [2020-10-11 15:13:02,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 8278 transitions. [2020-10-11 15:13:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:13:02,901 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:02,901 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:03,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-10-11 15:13:03,118 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:13:03,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:03,118 INFO L82 PathProgramCache]: Analyzing trace with hash -887756896, now seen corresponding path program 2 times [2020-10-11 15:13:03,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:03,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191228556] [2020-10-11 15:13:03,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:03,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191228556] [2020-10-11 15:13:03,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:03,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:13:03,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497225772] [2020-10-11 15:13:03,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:13:03,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:03,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:13:03,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:03,161 INFO L87 Difference]: Start difference. First operand 2157 states and 8278 transitions. Second operand 7 states. [2020-10-11 15:13:03,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:03,362 INFO L93 Difference]: Finished difference Result 4612 states and 15111 transitions. [2020-10-11 15:13:03,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:03,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-11 15:13:03,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:03,379 INFO L225 Difference]: With dead ends: 4612 [2020-10-11 15:13:03,379 INFO L226 Difference]: Without dead ends: 4601 [2020-10-11 15:13:03,381 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:13:03,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2020-10-11 15:13:03,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 2035. [2020-10-11 15:13:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2020-10-11 15:13:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 7845 transitions. [2020-10-11 15:13:03,499 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 7845 transitions. Word has length 15 [2020-10-11 15:13:03,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:03,500 INFO L481 AbstractCegarLoop]: Abstraction has 2035 states and 7845 transitions. [2020-10-11 15:13:03,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:13:03,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 7845 transitions. [2020-10-11 15:13:03,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-11 15:13:03,502 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:03,502 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:03,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-11 15:13:03,503 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:13:03,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:03,504 INFO L82 PathProgramCache]: Analyzing trace with hash 695111130, now seen corresponding path program 1 times [2020-10-11 15:13:03,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:03,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585435665] [2020-10-11 15:13:03,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:03,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585435665] [2020-10-11 15:13:03,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:03,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:13:03,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999588361] [2020-10-11 15:13:03,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:13:03,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:03,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:13:03,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:13:03,592 INFO L87 Difference]: Start difference. First operand 2035 states and 7845 transitions. Second operand 5 states. [2020-10-11 15:13:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:03,666 INFO L93 Difference]: Finished difference Result 3265 states and 11681 transitions. [2020-10-11 15:13:03,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:03,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-11 15:13:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:03,678 INFO L225 Difference]: With dead ends: 3265 [2020-10-11 15:13:03,679 INFO L226 Difference]: Without dead ends: 3250 [2020-10-11 15:13:03,679 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2020-10-11 15:13:03,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2281. [2020-10-11 15:13:03,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2020-10-11 15:13:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 8755 transitions. [2020-10-11 15:13:03,778 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 8755 transitions. Word has length 17 [2020-10-11 15:13:03,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:03,778 INFO L481 AbstractCegarLoop]: Abstraction has 2281 states and 8755 transitions. [2020-10-11 15:13:03,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 8755 transitions. [2020-10-11 15:13:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:13:03,780 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:03,780 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:03,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-11 15:13:03,781 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:13:03,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:03,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1754455113, now seen corresponding path program 1 times [2020-10-11 15:13:03,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:03,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585211684] [2020-10-11 15:13:03,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:03,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585211684] [2020-10-11 15:13:03,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717879669] [2020-10-11 15:13:03,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:03,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:13:03,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:04,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:04,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:13:04,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367166094] [2020-10-11 15:13:04,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:04,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:04,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:04,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:04,012 INFO L87 Difference]: Start difference. First operand 2281 states and 8755 transitions. Second operand 9 states. [2020-10-11 15:13:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:04,233 INFO L93 Difference]: Finished difference Result 4825 states and 15986 transitions. [2020-10-11 15:13:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:04,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-11 15:13:04,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:04,252 INFO L225 Difference]: With dead ends: 4825 [2020-10-11 15:13:04,252 INFO L226 Difference]: Without dead ends: 4813 [2020-10-11 15:13:04,253 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:13:04,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2020-10-11 15:13:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 2305. [2020-10-11 15:13:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2020-10-11 15:13:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 8815 transitions. [2020-10-11 15:13:04,374 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 8815 transitions. Word has length 19 [2020-10-11 15:13:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:04,375 INFO L481 AbstractCegarLoop]: Abstraction has 2305 states and 8815 transitions. [2020-10-11 15:13:04,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 8815 transitions. [2020-10-11 15:13:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:13:04,379 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:04,379 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:04,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:04,594 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:13:04,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:04,594 INFO L82 PathProgramCache]: Analyzing trace with hash -131464925, now seen corresponding path program 1 times [2020-10-11 15:13:04,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:04,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213180995] [2020-10-11 15:13:04,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:04,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213180995] [2020-10-11 15:13:04,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275017198] [2020-10-11 15:13:04,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:04,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:13:04,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:04,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:04,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:13:04,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396986904] [2020-10-11 15:13:04,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:04,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:04,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:04,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:04,742 INFO L87 Difference]: Start difference. First operand 2305 states and 8815 transitions. Second operand 9 states. [2020-10-11 15:13:04,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:04,981 INFO L93 Difference]: Finished difference Result 4942 states and 16410 transitions. [2020-10-11 15:13:04,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:04,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-11 15:13:04,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:04,999 INFO L225 Difference]: With dead ends: 4942 [2020-10-11 15:13:04,999 INFO L226 Difference]: Without dead ends: 4925 [2020-10-11 15:13:05,000 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:13:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2020-10-11 15:13:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 2299. [2020-10-11 15:13:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2020-10-11 15:13:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 8782 transitions. [2020-10-11 15:13:05,108 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 8782 transitions. Word has length 19 [2020-10-11 15:13:05,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:05,108 INFO L481 AbstractCegarLoop]: Abstraction has 2299 states and 8782 transitions. [2020-10-11 15:13:05,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:05,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 8782 transitions. [2020-10-11 15:13:05,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:13:05,109 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:05,110 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:05,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:05,322 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:13:05,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:05,323 INFO L82 PathProgramCache]: Analyzing trace with hash -2013120191, now seen corresponding path program 2 times [2020-10-11 15:13:05,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:05,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585321396] [2020-10-11 15:13:05,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:05,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585321396] [2020-10-11 15:13:05,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:05,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:13:05,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596883595] [2020-10-11 15:13:05,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:13:05,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:05,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:13:05,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:05,371 INFO L87 Difference]: Start difference. First operand 2299 states and 8782 transitions. Second operand 7 states. [2020-10-11 15:13:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:05,573 INFO L93 Difference]: Finished difference Result 4934 states and 16393 transitions. [2020-10-11 15:13:05,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:05,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:13:05,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:05,660 INFO L225 Difference]: With dead ends: 4934 [2020-10-11 15:13:05,661 INFO L226 Difference]: Without dead ends: 4917 [2020-10-11 15:13:05,661 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:13:05,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2020-10-11 15:13:05,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 2216. [2020-10-11 15:13:05,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2020-10-11 15:13:05,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 8477 transitions. [2020-10-11 15:13:05,762 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 8477 transitions. Word has length 19 [2020-10-11 15:13:05,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:05,762 INFO L481 AbstractCegarLoop]: Abstraction has 2216 states and 8477 transitions. [2020-10-11 15:13:05,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:13:05,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 8477 transitions. [2020-10-11 15:13:05,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:13:05,764 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:05,765 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:05,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-11 15:13:05,765 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:13:05,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:05,766 INFO L82 PathProgramCache]: Analyzing trace with hash -2013113743, now seen corresponding path program 2 times [2020-10-11 15:13:05,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:05,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109869421] [2020-10-11 15:13:05,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:05,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109869421] [2020-10-11 15:13:05,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:05,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:13:05,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783366974] [2020-10-11 15:13:05,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:13:05,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:05,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:13:05,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:05,820 INFO L87 Difference]: Start difference. First operand 2216 states and 8477 transitions. Second operand 7 states. [2020-10-11 15:13:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:06,029 INFO L93 Difference]: Finished difference Result 4774 states and 15828 transitions. [2020-10-11 15:13:06,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:06,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:13:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:06,043 INFO L225 Difference]: With dead ends: 4774 [2020-10-11 15:13:06,043 INFO L226 Difference]: Without dead ends: 4757 [2020-10-11 15:13:06,043 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:13:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2020-10-11 15:13:06,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 2150. [2020-10-11 15:13:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2020-10-11 15:13:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 8243 transitions. [2020-10-11 15:13:06,126 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 8243 transitions. Word has length 19 [2020-10-11 15:13:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:06,127 INFO L481 AbstractCegarLoop]: Abstraction has 2150 states and 8243 transitions. [2020-10-11 15:13:06,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:13:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 8243 transitions. [2020-10-11 15:13:06,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:06,128 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:06,129 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:06,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-11 15:13:06,129 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:13:06,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:06,129 INFO L82 PathProgramCache]: Analyzing trace with hash -9146414, now seen corresponding path program 1 times [2020-10-11 15:13:06,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:06,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216987165] [2020-10-11 15:13:06,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:06,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:06,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216987165] [2020-10-11 15:13:06,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777715945] [2020-10-11 15:13:06,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:06,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:06,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:06,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:06,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:06,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422720300] [2020-10-11 15:13:06,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:06,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:06,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:06,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:06,294 INFO L87 Difference]: Start difference. First operand 2150 states and 8243 transitions. Second operand 11 states. [2020-10-11 15:13:06,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:06,820 INFO L93 Difference]: Finished difference Result 6025 states and 18746 transitions. [2020-10-11 15:13:06,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:06,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:13:06,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:06,834 INFO L225 Difference]: With dead ends: 6025 [2020-10-11 15:13:06,835 INFO L226 Difference]: Without dead ends: 6017 [2020-10-11 15:13:06,836 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:06,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-10-11 15:13:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 2117. [2020-10-11 15:13:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2020-10-11 15:13:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 8106 transitions. [2020-10-11 15:13:06,941 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 8106 transitions. Word has length 21 [2020-10-11 15:13:06,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:06,942 INFO L481 AbstractCegarLoop]: Abstraction has 2117 states and 8106 transitions. [2020-10-11 15:13:06,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:06,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 8106 transitions. [2020-10-11 15:13:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:06,944 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:06,944 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:07,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-10-11 15:13:07,158 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:13:07,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:07,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1890795232, now seen corresponding path program 2 times [2020-10-11 15:13:07,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:07,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921057080] [2020-10-11 15:13:07,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:07,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921057080] [2020-10-11 15:13:07,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759747892] [2020-10-11 15:13:07,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:07,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:13:07,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:07,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:07,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:07,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:07,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:07,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468499263] [2020-10-11 15:13:07,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:07,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:07,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:07,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:07,417 INFO L87 Difference]: Start difference. First operand 2117 states and 8106 transitions. Second operand 11 states. [2020-10-11 15:13:07,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:07,983 INFO L93 Difference]: Finished difference Result 5914 states and 18384 transitions. [2020-10-11 15:13:07,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:07,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:13:07,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:07,996 INFO L225 Difference]: With dead ends: 5914 [2020-10-11 15:13:07,997 INFO L226 Difference]: Without dead ends: 5903 [2020-10-11 15:13:07,997 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:08,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2020-10-11 15:13:08,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 2085. [2020-10-11 15:13:08,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2020-10-11 15:13:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 7975 transitions. [2020-10-11 15:13:08,089 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 7975 transitions. Word has length 21 [2020-10-11 15:13:08,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:08,089 INFO L481 AbstractCegarLoop]: Abstraction has 2085 states and 7975 transitions. [2020-10-11 15:13:08,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:08,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 7975 transitions. [2020-10-11 15:13:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:08,091 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:08,092 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:08,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:08,304 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:13:08,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:08,306 INFO L82 PathProgramCache]: Analyzing trace with hash 180724060, now seen corresponding path program 3 times [2020-10-11 15:13:08,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:08,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911885673] [2020-10-11 15:13:08,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:08,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911885673] [2020-10-11 15:13:08,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501589982] [2020-10-11 15:13:08,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:08,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-11 15:13:08,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:08,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:08,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:08,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:08,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:08,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60937151] [2020-10-11 15:13:08,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:08,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:08,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:08,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:08,498 INFO L87 Difference]: Start difference. First operand 2085 states and 7975 transitions. Second operand 11 states. [2020-10-11 15:13:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:09,000 INFO L93 Difference]: Finished difference Result 5907 states and 18375 transitions. [2020-10-11 15:13:09,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:09,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:13:09,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:09,009 INFO L225 Difference]: With dead ends: 5907 [2020-10-11 15:13:09,009 INFO L226 Difference]: Without dead ends: 5899 [2020-10-11 15:13:09,010 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:09,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2020-10-11 15:13:09,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 2008. [2020-10-11 15:13:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2008 states. [2020-10-11 15:13:09,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 7698 transitions. [2020-10-11 15:13:09,098 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 7698 transitions. Word has length 21 [2020-10-11 15:13:09,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:09,098 INFO L481 AbstractCegarLoop]: Abstraction has 2008 states and 7698 transitions. [2020-10-11 15:13:09,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:09,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 7698 transitions. [2020-10-11 15:13:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:09,100 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:09,100 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:09,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-10-11 15:13:09,314 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:13:09,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:09,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1783759286, now seen corresponding path program 4 times [2020-10-11 15:13:09,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:09,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53365038] [2020-10-11 15:13:09,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:09,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53365038] [2020-10-11 15:13:09,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23563959] [2020-10-11 15:13:09,366 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:09,515 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:13:09,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:09,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:09,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-11 15:13:09,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:09,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:09,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116010131] [2020-10-11 15:13:09,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:09,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:09,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:09,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:09,541 INFO L87 Difference]: Start difference. First operand 2008 states and 7698 transitions. Second operand 11 states. [2020-10-11 15:13:10,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:10,073 INFO L93 Difference]: Finished difference Result 5835 states and 18155 transitions. [2020-10-11 15:13:10,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:10,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:13:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:10,083 INFO L225 Difference]: With dead ends: 5835 [2020-10-11 15:13:10,083 INFO L226 Difference]: Without dead ends: 5824 [2020-10-11 15:13:10,084 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:10,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2020-10-11 15:13:10,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 1976. [2020-10-11 15:13:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2020-10-11 15:13:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 7567 transitions. [2020-10-11 15:13:10,164 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 7567 transitions. Word has length 21 [2020-10-11 15:13:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:10,164 INFO L481 AbstractCegarLoop]: Abstraction has 1976 states and 7567 transitions. [2020-10-11 15:13:10,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:10,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 7567 transitions. [2020-10-11 15:13:10,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:10,167 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:10,167 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:10,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-10-11 15:13:10,382 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:13:10,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:10,383 INFO L82 PathProgramCache]: Analyzing trace with hash -964809789, now seen corresponding path program 1 times [2020-10-11 15:13:10,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:10,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861402915] [2020-10-11 15:13:10,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:13:10,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861402915] [2020-10-11 15:13:10,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:10,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:13:10,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407377668] [2020-10-11 15:13:10,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:13:10,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:10,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:13:10,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:13:10,415 INFO L87 Difference]: Start difference. First operand 1976 states and 7567 transitions. Second operand 5 states. [2020-10-11 15:13:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:10,484 INFO L93 Difference]: Finished difference Result 3016 states and 10840 transitions. [2020-10-11 15:13:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:10,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-11 15:13:10,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:10,492 INFO L225 Difference]: With dead ends: 3016 [2020-10-11 15:13:10,492 INFO L226 Difference]: Without dead ends: 3000 [2020-10-11 15:13:10,493 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:10,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2020-10-11 15:13:10,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 2183. [2020-10-11 15:13:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2183 states. [2020-10-11 15:13:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 8210 transitions. [2020-10-11 15:13:10,556 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 8210 transitions. Word has length 21 [2020-10-11 15:13:10,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:10,556 INFO L481 AbstractCegarLoop]: Abstraction has 2183 states and 8210 transitions. [2020-10-11 15:13:10,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:10,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 8210 transitions. [2020-10-11 15:13:10,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:10,558 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:10,558 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:10,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-11 15:13:10,559 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:13:10,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:10,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1873231848, now seen corresponding path program 5 times [2020-10-11 15:13:10,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:10,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828590821] [2020-10-11 15:13:10,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:10,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:10,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828590821] [2020-10-11 15:13:10,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:10,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:13:10,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101340004] [2020-10-11 15:13:10,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:10,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:10,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:10,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:10,622 INFO L87 Difference]: Start difference. First operand 2183 states and 8210 transitions. Second operand 9 states. [2020-10-11 15:13:11,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:11,079 INFO L93 Difference]: Finished difference Result 6150 states and 19247 transitions. [2020-10-11 15:13:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:11,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-11 15:13:11,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:11,092 INFO L225 Difference]: With dead ends: 6150 [2020-10-11 15:13:11,092 INFO L226 Difference]: Without dead ends: 6139 [2020-10-11 15:13:11,092 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:13:11,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6139 states. [2020-10-11 15:13:11,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6139 to 2096. [2020-10-11 15:13:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2096 states. [2020-10-11 15:13:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 7876 transitions. [2020-10-11 15:13:11,195 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 7876 transitions. Word has length 21 [2020-10-11 15:13:11,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:11,195 INFO L481 AbstractCegarLoop]: Abstraction has 2096 states and 7876 transitions. [2020-10-11 15:13:11,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:11,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 7876 transitions. [2020-10-11 15:13:11,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:11,197 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:11,197 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:11,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-11 15:13:11,198 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:13:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:11,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1867041768, now seen corresponding path program 6 times [2020-10-11 15:13:11,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:11,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332880049] [2020-10-11 15:13:11,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:11,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332880049] [2020-10-11 15:13:11,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:11,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:13:11,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924703250] [2020-10-11 15:13:11,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:11,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:11,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:11,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:11,252 INFO L87 Difference]: Start difference. First operand 2096 states and 7876 transitions. Second operand 9 states. [2020-10-11 15:13:11,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:11,831 INFO L93 Difference]: Finished difference Result 6017 states and 18791 transitions. [2020-10-11 15:13:11,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:11,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-11 15:13:11,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:11,841 INFO L225 Difference]: With dead ends: 6017 [2020-10-11 15:13:11,841 INFO L226 Difference]: Without dead ends: 6002 [2020-10-11 15:13:11,841 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:13:11,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-10-11 15:13:11,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2020-10-11 15:13:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2020-10-11 15:13:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2020-10-11 15:13:11,924 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2020-10-11 15:13:11,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:11,925 INFO L481 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2020-10-11 15:13:11,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:11,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2020-10-11 15:13:11,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 15:13:11,927 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:11,927 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:11,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-11 15:13:11,927 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-11 15:13:11,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:11,927 INFO L82 PathProgramCache]: Analyzing trace with hash 150840888, now seen corresponding path program 1 times [2020-10-11 15:13:11,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:11,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601005357] [2020-10-11 15:13:11,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:13:11,936 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:13:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:13:11,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:13:11,949 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 15:13:11,950 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 15:13:11,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-11 15:13:11,950 WARN L371 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-11 15:13:11,951 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-10-11 15:13:11,964 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,964 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,964 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,964 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,964 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,965 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,965 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,965 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,965 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,965 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,965 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,965 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,966 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,966 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,966 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,966 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,966 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,966 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,967 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,967 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,967 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,967 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,967 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,967 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,967 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,967 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,968 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,968 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,968 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,968 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,968 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,968 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,968 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,969 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,969 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,969 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,969 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,969 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,969 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,969 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,970 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,970 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,970 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,970 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,970 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,970 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,970 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,971 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,971 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,972 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,972 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,972 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,972 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,972 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,973 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,973 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,974 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,974 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,975 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,975 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,976 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,976 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,977 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,977 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,978 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,978 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,979 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,979 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,979 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,979 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,979 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,980 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,984 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,984 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,984 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,984 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,985 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,988 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,989 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,989 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,989 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,989 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,992 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,993 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,993 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,993 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,993 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,995 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,995 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,995 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,995 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,995 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,997 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,997 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:11,999 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,001 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,001 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,003 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,003 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,004 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,005 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,005 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:13:12,007 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-11 15:13:12,007 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:13:12,007 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:13:12,007 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:13:12,007 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:13:12,007 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:13:12,007 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:13:12,008 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:13:12,008 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:13:12,009 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:13:12,009 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 123 transitions, 336 flow [2020-10-11 15:13:12,010 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 123 transitions, 336 flow [2020-10-11 15:13:12,010 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions, 336 flow [2020-10-11 15:13:12,030 INFO L129 PetriNetUnfolder]: 7/149 cut-off events. [2020-10-11 15:13:12,030 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-11 15:13:12,032 INFO L80 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2020-10-11 15:13:12,037 INFO L117 LiptonReduction]: Number of co-enabled transitions 2860 [2020-10-11 15:13:13,702 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-10-11 15:13:13,764 INFO L132 LiptonReduction]: Checked pairs total: 4168 [2020-10-11 15:13:13,764 INFO L134 LiptonReduction]: Total number of compositions: 121 [2020-10-11 15:13:13,765 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 39 transitions, 168 flow [2020-10-11 15:13:14,123 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2020-10-11 15:13:14,124 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2020-10-11 15:13:14,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-11 15:13:14,124 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:14,124 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-11 15:13:14,124 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:14,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:14,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1011964, now seen corresponding path program 1 times [2020-10-11 15:13:14,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:14,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767970754] [2020-10-11 15:13:14,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:14,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:14,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767970754] [2020-10-11 15:13:14,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:14,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:13:14,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577763558] [2020-10-11 15:13:14,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:13:14,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:14,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:13:14,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:13:14,137 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2020-10-11 15:13:14,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:14,206 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2020-10-11 15:13:14,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:13:14,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-11 15:13:14,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:14,225 INFO L225 Difference]: With dead ends: 5844 [2020-10-11 15:13:14,225 INFO L226 Difference]: Without dead ends: 5479 [2020-10-11 15:13:14,226 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:13:14,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-10-11 15:13:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-10-11 15:13:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-10-11 15:13:14,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 24493 transitions. [2020-10-11 15:13:14,403 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 24493 transitions. Word has length 3 [2020-10-11 15:13:14,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:14,403 INFO L481 AbstractCegarLoop]: Abstraction has 5479 states and 24493 transitions. [2020-10-11 15:13:14,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:13:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 24493 transitions. [2020-10-11 15:13:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 15:13:14,404 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:14,404 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:14,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-11 15:13:14,404 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:14,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:14,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1084774388, now seen corresponding path program 1 times [2020-10-11 15:13:14,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:14,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010509579] [2020-10-11 15:13:14,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:14,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010509579] [2020-10-11 15:13:14,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:14,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:13:14,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983521330] [2020-10-11 15:13:14,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:13:14,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:14,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:13:14,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:13:14,429 INFO L87 Difference]: Start difference. First operand 5479 states and 24493 transitions. Second operand 5 states. [2020-10-11 15:13:14,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:14,545 INFO L93 Difference]: Finished difference Result 9673 states and 40333 transitions. [2020-10-11 15:13:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:14,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-11 15:13:14,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:14,568 INFO L225 Difference]: With dead ends: 9673 [2020-10-11 15:13:14,569 INFO L226 Difference]: Without dead ends: 9666 [2020-10-11 15:13:14,569 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9666 states. [2020-10-11 15:13:14,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9666 to 6331. [2020-10-11 15:13:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6331 states. [2020-10-11 15:13:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6331 states to 6331 states and 28544 transitions. [2020-10-11 15:13:14,775 INFO L78 Accepts]: Start accepts. Automaton has 6331 states and 28544 transitions. Word has length 9 [2020-10-11 15:13:14,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:14,775 INFO L481 AbstractCegarLoop]: Abstraction has 6331 states and 28544 transitions. [2020-10-11 15:13:14,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 6331 states and 28544 transitions. [2020-10-11 15:13:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 15:13:14,776 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:14,776 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:14,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-11 15:13:14,776 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:14,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:14,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2112403116, now seen corresponding path program 1 times [2020-10-11 15:13:14,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:14,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737912829] [2020-10-11 15:13:14,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:14,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:14,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737912829] [2020-10-11 15:13:14,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:14,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:13:14,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028293864] [2020-10-11 15:13:14,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:13:14,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:14,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:13:14,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:13:14,800 INFO L87 Difference]: Start difference. First operand 6331 states and 28544 transitions. Second operand 5 states. [2020-10-11 15:13:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:14,953 INFO L93 Difference]: Finished difference Result 11081 states and 46826 transitions. [2020-10-11 15:13:14,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:14,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-11 15:13:14,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:14,998 INFO L225 Difference]: With dead ends: 11081 [2020-10-11 15:13:14,998 INFO L226 Difference]: Without dead ends: 11068 [2020-10-11 15:13:14,999 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11068 states. [2020-10-11 15:13:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11068 to 7391. [2020-10-11 15:13:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7391 states. [2020-10-11 15:13:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 33694 transitions. [2020-10-11 15:13:15,518 INFO L78 Accepts]: Start accepts. Automaton has 7391 states and 33694 transitions. Word has length 13 [2020-10-11 15:13:15,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:15,518 INFO L481 AbstractCegarLoop]: Abstraction has 7391 states and 33694 transitions. [2020-10-11 15:13:15,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 7391 states and 33694 transitions. [2020-10-11 15:13:15,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:13:15,518 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:15,519 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:15,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-11 15:13:15,519 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:15,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:15,519 INFO L82 PathProgramCache]: Analyzing trace with hash -28983895, now seen corresponding path program 1 times [2020-10-11 15:13:15,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:15,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616374332] [2020-10-11 15:13:15,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:15,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616374332] [2020-10-11 15:13:15,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117564013] [2020-10-11 15:13:15,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:15,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:13:15,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:15,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:15,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:13:15,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320929437] [2020-10-11 15:13:15,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:15,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:15,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:15,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:15,644 INFO L87 Difference]: Start difference. First operand 7391 states and 33694 transitions. Second operand 9 states. [2020-10-11 15:13:15,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:15,920 INFO L93 Difference]: Finished difference Result 16749 states and 66010 transitions. [2020-10-11 15:13:15,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:15,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-11 15:13:15,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:15,957 INFO L225 Difference]: With dead ends: 16749 [2020-10-11 15:13:15,958 INFO L226 Difference]: Without dead ends: 16736 [2020-10-11 15:13:15,958 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:13:16,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16736 states. [2020-10-11 15:13:16,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16736 to 7303. [2020-10-11 15:13:16,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7303 states. [2020-10-11 15:13:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 33260 transitions. [2020-10-11 15:13:16,233 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 33260 transitions. Word has length 15 [2020-10-11 15:13:16,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:16,234 INFO L481 AbstractCegarLoop]: Abstraction has 7303 states and 33260 transitions. [2020-10-11 15:13:16,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 33260 transitions. [2020-10-11 15:13:16,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:13:16,234 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:16,234 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:16,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:16,436 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:16,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:16,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1500121559, now seen corresponding path program 2 times [2020-10-11 15:13:16,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:16,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153648698] [2020-10-11 15:13:16,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:16,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:16,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153648698] [2020-10-11 15:13:16,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:16,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:13:16,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045909949] [2020-10-11 15:13:16,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:13:16,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:16,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:13:16,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:16,473 INFO L87 Difference]: Start difference. First operand 7303 states and 33260 transitions. Second operand 7 states. [2020-10-11 15:13:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:16,725 INFO L93 Difference]: Finished difference Result 17085 states and 67393 transitions. [2020-10-11 15:13:16,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:16,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-11 15:13:16,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:16,760 INFO L225 Difference]: With dead ends: 17085 [2020-10-11 15:13:16,760 INFO L226 Difference]: Without dead ends: 17071 [2020-10-11 15:13:16,760 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:13:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17071 states. [2020-10-11 15:13:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17071 to 7048. [2020-10-11 15:13:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7048 states. [2020-10-11 15:13:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 32136 transitions. [2020-10-11 15:13:17,220 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 32136 transitions. Word has length 15 [2020-10-11 15:13:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:17,220 INFO L481 AbstractCegarLoop]: Abstraction has 7048 states and 32136 transitions. [2020-10-11 15:13:17,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:13:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 32136 transitions. [2020-10-11 15:13:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-11 15:13:17,221 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:17,221 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:17,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-11 15:13:17,222 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:17,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:17,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1891696605, now seen corresponding path program 1 times [2020-10-11 15:13:17,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:17,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428114287] [2020-10-11 15:13:17,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:17,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428114287] [2020-10-11 15:13:17,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:17,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:13:17,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225933860] [2020-10-11 15:13:17,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:13:17,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:17,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:13:17,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:13:17,258 INFO L87 Difference]: Start difference. First operand 7048 states and 32136 transitions. Second operand 5 states. [2020-10-11 15:13:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:17,405 INFO L93 Difference]: Finished difference Result 12234 states and 52488 transitions. [2020-10-11 15:13:17,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:17,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-11 15:13:17,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:17,446 INFO L225 Difference]: With dead ends: 12234 [2020-10-11 15:13:17,446 INFO L226 Difference]: Without dead ends: 12212 [2020-10-11 15:13:17,447 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:17,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2020-10-11 15:13:17,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 8342. [2020-10-11 15:13:17,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8342 states. [2020-10-11 15:13:17,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8342 states to 8342 states and 38278 transitions. [2020-10-11 15:13:17,690 INFO L78 Accepts]: Start accepts. Automaton has 8342 states and 38278 transitions. Word has length 17 [2020-10-11 15:13:17,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:17,690 INFO L481 AbstractCegarLoop]: Abstraction has 8342 states and 38278 transitions. [2020-10-11 15:13:17,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:17,691 INFO L276 IsEmpty]: Start isEmpty. Operand 8342 states and 38278 transitions. [2020-10-11 15:13:17,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:13:17,691 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:17,692 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:17,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-11 15:13:17,692 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:17,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:17,692 INFO L82 PathProgramCache]: Analyzing trace with hash -74039136, now seen corresponding path program 1 times [2020-10-11 15:13:17,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:17,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926742313] [2020-10-11 15:13:17,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:17,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:13:17,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926742313] [2020-10-11 15:13:17,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929075466] [2020-10-11 15:13:17,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:17,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:13:17,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:13:17,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:17,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:13:17,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644930130] [2020-10-11 15:13:17,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:17,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:17,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:17,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:17,906 INFO L87 Difference]: Start difference. First operand 8342 states and 38278 transitions. Second operand 9 states. [2020-10-11 15:13:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:18,319 INFO L93 Difference]: Finished difference Result 19016 states and 76191 transitions. [2020-10-11 15:13:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:18,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-11 15:13:18,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:18,394 INFO L225 Difference]: With dead ends: 19016 [2020-10-11 15:13:18,394 INFO L226 Difference]: Without dead ends: 18998 [2020-10-11 15:13:18,395 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:13:18,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18998 states. [2020-10-11 15:13:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18998 to 8452. [2020-10-11 15:13:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8452 states. [2020-10-11 15:13:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8452 states to 8452 states and 38704 transitions. [2020-10-11 15:13:18,866 INFO L78 Accepts]: Start accepts. Automaton has 8452 states and 38704 transitions. Word has length 19 [2020-10-11 15:13:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:18,866 INFO L481 AbstractCegarLoop]: Abstraction has 8452 states and 38704 transitions. [2020-10-11 15:13:18,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 8452 states and 38704 transitions. [2020-10-11 15:13:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:13:18,867 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:18,867 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:19,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-10-11 15:13:19,083 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:19,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:19,083 INFO L82 PathProgramCache]: Analyzing trace with hash -274460668, now seen corresponding path program 1 times [2020-10-11 15:13:19,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:19,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098706101] [2020-10-11 15:13:19,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:19,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098706101] [2020-10-11 15:13:19,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378166080] [2020-10-11 15:13:19,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:19,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:13:19,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:19,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:19,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:19,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:13:19,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416313493] [2020-10-11 15:13:19,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:19,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:19,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:19,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:20,000 INFO L87 Difference]: Start difference. First operand 8452 states and 38704 transitions. Second operand 9 states. [2020-10-11 15:13:20,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:20,344 INFO L93 Difference]: Finished difference Result 19670 states and 79028 transitions. [2020-10-11 15:13:20,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:20,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-11 15:13:20,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:20,416 INFO L225 Difference]: With dead ends: 19670 [2020-10-11 15:13:20,417 INFO L226 Difference]: Without dead ends: 19645 [2020-10-11 15:13:20,417 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:13:20,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19645 states. [2020-10-11 15:13:20,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19645 to 8480. [2020-10-11 15:13:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8480 states. [2020-10-11 15:13:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 38825 transitions. [2020-10-11 15:13:20,785 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 38825 transitions. Word has length 19 [2020-10-11 15:13:20,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:20,785 INFO L481 AbstractCegarLoop]: Abstraction has 8480 states and 38825 transitions. [2020-10-11 15:13:20,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:20,785 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 38825 transitions. [2020-10-11 15:13:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:13:20,786 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:20,786 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:20,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-10-11 15:13:20,987 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:20,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:20,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1149256224, now seen corresponding path program 2 times [2020-10-11 15:13:20,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:20,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783370733] [2020-10-11 15:13:20,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:21,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:21,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783370733] [2020-10-11 15:13:21,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:21,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:13:21,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984220327] [2020-10-11 15:13:21,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:13:21,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:21,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:13:21,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:21,033 INFO L87 Difference]: Start difference. First operand 8480 states and 38825 transitions. Second operand 7 states. [2020-10-11 15:13:21,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:21,356 INFO L93 Difference]: Finished difference Result 19852 states and 79846 transitions. [2020-10-11 15:13:21,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:21,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:13:21,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:21,416 INFO L225 Difference]: With dead ends: 19852 [2020-10-11 15:13:21,416 INFO L226 Difference]: Without dead ends: 19827 [2020-10-11 15:13:21,418 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:13:21,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19827 states. [2020-10-11 15:13:21,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19827 to 8379. [2020-10-11 15:13:21,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8379 states. [2020-10-11 15:13:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8379 states to 8379 states and 38406 transitions. [2020-10-11 15:13:21,931 INFO L78 Accepts]: Start accepts. Automaton has 8379 states and 38406 transitions. Word has length 19 [2020-10-11 15:13:21,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:21,931 INFO L481 AbstractCegarLoop]: Abstraction has 8379 states and 38406 transitions. [2020-10-11 15:13:21,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:13:21,932 INFO L276 IsEmpty]: Start isEmpty. Operand 8379 states and 38406 transitions. [2020-10-11 15:13:21,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:13:21,933 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:21,934 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:21,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-11 15:13:21,934 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:21,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:21,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1149271290, now seen corresponding path program 2 times [2020-10-11 15:13:21,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:21,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317224034] [2020-10-11 15:13:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:21,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317224034] [2020-10-11 15:13:21,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:21,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:13:21,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237670447] [2020-10-11 15:13:21,992 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:13:21,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:21,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:13:21,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:21,993 INFO L87 Difference]: Start difference. First operand 8379 states and 38406 transitions. Second operand 7 states. [2020-10-11 15:13:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:22,443 INFO L93 Difference]: Finished difference Result 19555 states and 78564 transitions. [2020-10-11 15:13:22,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:22,443 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:13:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:22,508 INFO L225 Difference]: With dead ends: 19555 [2020-10-11 15:13:22,508 INFO L226 Difference]: Without dead ends: 19530 [2020-10-11 15:13:22,509 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:13:22,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2020-10-11 15:13:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 8317. [2020-10-11 15:13:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8317 states. [2020-10-11 15:13:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8317 states to 8317 states and 38184 transitions. [2020-10-11 15:13:22,872 INFO L78 Accepts]: Start accepts. Automaton has 8317 states and 38184 transitions. Word has length 19 [2020-10-11 15:13:22,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:22,872 INFO L481 AbstractCegarLoop]: Abstraction has 8317 states and 38184 transitions. [2020-10-11 15:13:22,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:13:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 8317 states and 38184 transitions. [2020-10-11 15:13:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:22,874 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:22,874 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:22,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-11 15:13:22,874 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1557322431, now seen corresponding path program 1 times [2020-10-11 15:13:22,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:22,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686841234] [2020-10-11 15:13:22,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:22,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686841234] [2020-10-11 15:13:22,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698442617] [2020-10-11 15:13:22,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:22,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:22,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:13:23,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:23,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:23,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262515898] [2020-10-11 15:13:23,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:23,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:23,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:23,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:23,021 INFO L87 Difference]: Start difference. First operand 8317 states and 38184 transitions. Second operand 11 states. [2020-10-11 15:13:23,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:23,683 INFO L93 Difference]: Finished difference Result 26969 states and 101544 transitions. [2020-10-11 15:13:23,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:23,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:13:23,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:23,742 INFO L225 Difference]: With dead ends: 26969 [2020-10-11 15:13:23,743 INFO L226 Difference]: Without dead ends: 26957 [2020-10-11 15:13:23,743 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:23,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26957 states. [2020-10-11 15:13:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26957 to 8204. [2020-10-11 15:13:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2020-10-11 15:13:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 37628 transitions. [2020-10-11 15:13:24,115 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 37628 transitions. Word has length 21 [2020-10-11 15:13:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:24,115 INFO L481 AbstractCegarLoop]: Abstraction has 8204 states and 37628 transitions. [2020-10-11 15:13:24,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:24,115 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 37628 transitions. [2020-10-11 15:13:24,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:24,116 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:24,116 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:24,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:24,317 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:24,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:24,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1862834243, now seen corresponding path program 2 times [2020-10-11 15:13:24,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:24,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002985771] [2020-10-11 15:13:24,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:13:24,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002985771] [2020-10-11 15:13:24,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496968423] [2020-10-11 15:13:24,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:24,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:13:24,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:24,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:24,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:13:24,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:24,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:24,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625903655] [2020-10-11 15:13:24,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:24,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:24,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:24,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:24,485 INFO L87 Difference]: Start difference. First operand 8204 states and 37628 transitions. Second operand 11 states. [2020-10-11 15:13:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:25,307 INFO L93 Difference]: Finished difference Result 26661 states and 100277 transitions. [2020-10-11 15:13:25,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:25,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:13:25,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:25,408 INFO L225 Difference]: With dead ends: 26661 [2020-10-11 15:13:25,408 INFO L226 Difference]: Without dead ends: 26645 [2020-10-11 15:13:25,409 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:25,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26645 states. [2020-10-11 15:13:26,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26645 to 8091. [2020-10-11 15:13:26,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8091 states. [2020-10-11 15:13:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8091 states to 8091 states and 37076 transitions. [2020-10-11 15:13:26,065 INFO L78 Accepts]: Start accepts. Automaton has 8091 states and 37076 transitions. Word has length 21 [2020-10-11 15:13:26,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:26,066 INFO L481 AbstractCegarLoop]: Abstraction has 8091 states and 37076 transitions. [2020-10-11 15:13:26,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:26,066 INFO L276 IsEmpty]: Start isEmpty. Operand 8091 states and 37076 transitions. [2020-10-11 15:13:26,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:26,068 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:26,068 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:26,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2020-10-11 15:13:26,281 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:26,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:26,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1769991039, now seen corresponding path program 3 times [2020-10-11 15:13:26,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:26,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715625406] [2020-10-11 15:13:26,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:26,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715625406] [2020-10-11 15:13:26,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731283613] [2020-10-11 15:13:26,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:26,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-11 15:13:26,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:26,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:26,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:26,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:26,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:26,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:26,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052250050] [2020-10-11 15:13:26,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:26,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:26,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:26,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:26,446 INFO L87 Difference]: Start difference. First operand 8091 states and 37076 transitions. Second operand 11 states. [2020-10-11 15:13:27,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:27,097 INFO L93 Difference]: Finished difference Result 26686 states and 100402 transitions. [2020-10-11 15:13:27,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:27,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:13:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:27,158 INFO L225 Difference]: With dead ends: 26686 [2020-10-11 15:13:27,158 INFO L226 Difference]: Without dead ends: 26674 [2020-10-11 15:13:27,159 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26674 states. [2020-10-11 15:13:27,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26674 to 7861. [2020-10-11 15:13:27,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7861 states. [2020-10-11 15:13:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 36066 transitions. [2020-10-11 15:13:27,727 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 36066 transitions. Word has length 21 [2020-10-11 15:13:27,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:27,728 INFO L481 AbstractCegarLoop]: Abstraction has 7861 states and 36066 transitions. [2020-10-11 15:13:27,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 36066 transitions. [2020-10-11 15:13:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:27,729 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:27,729 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:27,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:27,936 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:27,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:27,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1763681919, now seen corresponding path program 4 times [2020-10-11 15:13:27,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:27,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006543900] [2020-10-11 15:13:27,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:27,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:27,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006543900] [2020-10-11 15:13:27,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331324226] [2020-10-11 15:13:27,990 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:28,064 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:13:28,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:28,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:28,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:13:28,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:28,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:28,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458393937] [2020-10-11 15:13:28,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:28,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:28,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:28,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:28,099 INFO L87 Difference]: Start difference. First operand 7861 states and 36066 transitions. Second operand 11 states. [2020-10-11 15:13:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:28,722 INFO L93 Difference]: Finished difference Result 26489 states and 99650 transitions. [2020-10-11 15:13:28,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:28,723 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:13:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:28,778 INFO L225 Difference]: With dead ends: 26489 [2020-10-11 15:13:28,778 INFO L226 Difference]: Without dead ends: 26473 [2020-10-11 15:13:28,779 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:28,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26473 states. [2020-10-11 15:13:29,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26473 to 7748. [2020-10-11 15:13:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7748 states. [2020-10-11 15:13:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7748 states to 7748 states and 35514 transitions. [2020-10-11 15:13:29,150 INFO L78 Accepts]: Start accepts. Automaton has 7748 states and 35514 transitions. Word has length 21 [2020-10-11 15:13:29,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:29,150 INFO L481 AbstractCegarLoop]: Abstraction has 7748 states and 35514 transitions. [2020-10-11 15:13:29,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:29,150 INFO L276 IsEmpty]: Start isEmpty. Operand 7748 states and 35514 transitions. [2020-10-11 15:13:29,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:29,152 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:29,152 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:29,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2020-10-11 15:13:29,352 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:29,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:29,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1774143127, now seen corresponding path program 1 times [2020-10-11 15:13:29,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:29,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39115554] [2020-10-11 15:13:29,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:13:29,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39115554] [2020-10-11 15:13:29,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:29,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:13:29,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081702266] [2020-10-11 15:13:29,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:13:29,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:29,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:13:29,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:13:29,378 INFO L87 Difference]: Start difference. First operand 7748 states and 35514 transitions. Second operand 5 states. [2020-10-11 15:13:29,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:29,509 INFO L93 Difference]: Finished difference Result 13251 states and 57501 transitions. [2020-10-11 15:13:29,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:29,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-11 15:13:29,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:29,540 INFO L225 Difference]: With dead ends: 13251 [2020-10-11 15:13:29,540 INFO L226 Difference]: Without dead ends: 13220 [2020-10-11 15:13:29,541 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:29,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13220 states. [2020-10-11 15:13:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13220 to 9255. [2020-10-11 15:13:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9255 states. [2020-10-11 15:13:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9255 states to 9255 states and 42368 transitions. [2020-10-11 15:13:29,822 INFO L78 Accepts]: Start accepts. Automaton has 9255 states and 42368 transitions. Word has length 21 [2020-10-11 15:13:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:29,822 INFO L481 AbstractCegarLoop]: Abstraction has 9255 states and 42368 transitions. [2020-10-11 15:13:29,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand 9255 states and 42368 transitions. [2020-10-11 15:13:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:29,823 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:29,823 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:29,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-10-11 15:13:29,824 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:29,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:29,824 INFO L82 PathProgramCache]: Analyzing trace with hash -628636285, now seen corresponding path program 5 times [2020-10-11 15:13:29,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:29,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541661999] [2020-10-11 15:13:29,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:29,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541661999] [2020-10-11 15:13:29,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:29,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:13:29,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999448609] [2020-10-11 15:13:29,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:29,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:29,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:29,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:29,887 INFO L87 Difference]: Start difference. First operand 9255 states and 42368 transitions. Second operand 9 states. [2020-10-11 15:13:30,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:30,493 INFO L93 Difference]: Finished difference Result 29788 states and 113841 transitions. [2020-10-11 15:13:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:30,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-11 15:13:30,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:30,568 INFO L225 Difference]: With dead ends: 29788 [2020-10-11 15:13:30,568 INFO L226 Difference]: Without dead ends: 29770 [2020-10-11 15:13:30,568 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:13:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29770 states. [2020-10-11 15:13:31,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29770 to 8964. [2020-10-11 15:13:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2020-10-11 15:13:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 41031 transitions. [2020-10-11 15:13:31,179 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 41031 transitions. Word has length 21 [2020-10-11 15:13:31,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:31,179 INFO L481 AbstractCegarLoop]: Abstraction has 8964 states and 41031 transitions. [2020-10-11 15:13:31,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:31,179 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 41031 transitions. [2020-10-11 15:13:31,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:13:31,180 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:31,180 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:31,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-10-11 15:13:31,181 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:31,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:31,181 INFO L82 PathProgramCache]: Analyzing trace with hash -643099645, now seen corresponding path program 6 times [2020-10-11 15:13:31,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:31,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484577595] [2020-10-11 15:13:31,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:13:31,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484577595] [2020-10-11 15:13:31,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:31,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:13:31,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876320736] [2020-10-11 15:13:31,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:31,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:31,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:31,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:31,233 INFO L87 Difference]: Start difference. First operand 8964 states and 41031 transitions. Second operand 9 states. [2020-10-11 15:13:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:31,905 INFO L93 Difference]: Finished difference Result 29379 states and 112099 transitions. [2020-10-11 15:13:31,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:31,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-11 15:13:31,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:31,973 INFO L225 Difference]: With dead ends: 29379 [2020-10-11 15:13:31,974 INFO L226 Difference]: Without dead ends: 29356 [2020-10-11 15:13:31,974 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:13:32,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29356 states. [2020-10-11 15:13:32,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29356 to 8573. [2020-10-11 15:13:32,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8573 states. [2020-10-11 15:13:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8573 states to 8573 states and 39353 transitions. [2020-10-11 15:13:32,412 INFO L78 Accepts]: Start accepts. Automaton has 8573 states and 39353 transitions. Word has length 21 [2020-10-11 15:13:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:32,413 INFO L481 AbstractCegarLoop]: Abstraction has 8573 states and 39353 transitions. [2020-10-11 15:13:32,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:32,413 INFO L276 IsEmpty]: Start isEmpty. Operand 8573 states and 39353 transitions. [2020-10-11 15:13:32,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:13:32,414 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:32,414 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:32,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-10-11 15:13:32,414 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:32,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:32,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1599602836, now seen corresponding path program 1 times [2020-10-11 15:13:32,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:32,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483283093] [2020-10-11 15:13:32,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:13:32,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483283093] [2020-10-11 15:13:32,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336086102] [2020-10-11 15:13:32,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:32,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:13:32,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:13:32,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:32,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:13:32,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302941425] [2020-10-11 15:13:32,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:32,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:32,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:32,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:32,544 INFO L87 Difference]: Start difference. First operand 8573 states and 39353 transitions. Second operand 9 states. [2020-10-11 15:13:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:32,853 INFO L93 Difference]: Finished difference Result 19727 states and 80274 transitions. [2020-10-11 15:13:32,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:32,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-11 15:13:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:32,893 INFO L225 Difference]: With dead ends: 19727 [2020-10-11 15:13:32,893 INFO L226 Difference]: Without dead ends: 19703 [2020-10-11 15:13:32,894 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:13:33,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19703 states. [2020-10-11 15:13:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19703 to 8847. [2020-10-11 15:13:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2020-10-11 15:13:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40495 transitions. [2020-10-11 15:13:33,209 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40495 transitions. Word has length 23 [2020-10-11 15:13:33,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:33,210 INFO L481 AbstractCegarLoop]: Abstraction has 8847 states and 40495 transitions. [2020-10-11 15:13:33,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40495 transitions. [2020-10-11 15:13:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:13:33,211 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:33,211 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:33,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-10-11 15:13:33,419 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:33,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:33,420 INFO L82 PathProgramCache]: Analyzing trace with hash 72758744, now seen corresponding path program 1 times [2020-10-11 15:13:33,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:33,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363001873] [2020-10-11 15:13:33,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:33,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363001873] [2020-10-11 15:13:33,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148126546] [2020-10-11 15:13:33,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:33,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:13:33,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:33,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:33,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:13:33,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649650964] [2020-10-11 15:13:33,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:33,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:33,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:33,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:33,569 INFO L87 Difference]: Start difference. First operand 8847 states and 40495 transitions. Second operand 9 states. [2020-10-11 15:13:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:33,941 INFO L93 Difference]: Finished difference Result 20694 states and 84261 transitions. [2020-10-11 15:13:33,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:33,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-11 15:13:33,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:33,988 INFO L225 Difference]: With dead ends: 20694 [2020-10-11 15:13:33,989 INFO L226 Difference]: Without dead ends: 20666 [2020-10-11 15:13:33,989 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:13:34,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20666 states. [2020-10-11 15:13:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20666 to 9115. [2020-10-11 15:13:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9115 states. [2020-10-11 15:13:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9115 states to 9115 states and 41679 transitions. [2020-10-11 15:13:34,306 INFO L78 Accepts]: Start accepts. Automaton has 9115 states and 41679 transitions. Word has length 23 [2020-10-11 15:13:34,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:34,306 INFO L481 AbstractCegarLoop]: Abstraction has 9115 states and 41679 transitions. [2020-10-11 15:13:34,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:34,306 INFO L276 IsEmpty]: Start isEmpty. Operand 9115 states and 41679 transitions. [2020-10-11 15:13:34,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:13:34,308 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:34,308 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:34,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:34,509 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:34,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:34,510 INFO L82 PathProgramCache]: Analyzing trace with hash -328675496, now seen corresponding path program 1 times [2020-10-11 15:13:34,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:34,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116386835] [2020-10-11 15:13:34,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:34,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116386835] [2020-10-11 15:13:34,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497370444] [2020-10-11 15:13:34,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:34,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:13:34,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:34,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:34,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:13:34,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454615793] [2020-10-11 15:13:34,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:34,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:34,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:34,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:34,639 INFO L87 Difference]: Start difference. First operand 9115 states and 41679 transitions. Second operand 9 states. [2020-10-11 15:13:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:34,934 INFO L93 Difference]: Finished difference Result 21396 states and 87360 transitions. [2020-10-11 15:13:34,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:34,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-11 15:13:34,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:34,979 INFO L225 Difference]: With dead ends: 21396 [2020-10-11 15:13:34,979 INFO L226 Difference]: Without dead ends: 21359 [2020-10-11 15:13:34,979 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:13:35,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21359 states. [2020-10-11 15:13:35,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21359 to 9320. [2020-10-11 15:13:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9320 states. [2020-10-11 15:13:35,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9320 states to 9320 states and 42648 transitions. [2020-10-11 15:13:35,311 INFO L78 Accepts]: Start accepts. Automaton has 9320 states and 42648 transitions. Word has length 23 [2020-10-11 15:13:35,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:35,311 INFO L481 AbstractCegarLoop]: Abstraction has 9320 states and 42648 transitions. [2020-10-11 15:13:35,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:13:35,311 INFO L276 IsEmpty]: Start isEmpty. Operand 9320 states and 42648 transitions. [2020-10-11 15:13:35,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:13:35,313 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:35,313 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:35,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2020-10-11 15:13:35,514 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:35,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:35,514 INFO L82 PathProgramCache]: Analyzing trace with hash -150456492, now seen corresponding path program 2 times [2020-10-11 15:13:35,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:35,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139408026] [2020-10-11 15:13:35,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:13:35,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139408026] [2020-10-11 15:13:35,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:35,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:13:35,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097915217] [2020-10-11 15:13:35,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:13:35,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:35,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:13:35,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:35,548 INFO L87 Difference]: Start difference. First operand 9320 states and 42648 transitions. Second operand 7 states. [2020-10-11 15:13:35,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:35,829 INFO L93 Difference]: Finished difference Result 21489 states and 87752 transitions. [2020-10-11 15:13:35,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:35,830 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-11 15:13:35,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:35,880 INFO L225 Difference]: With dead ends: 21489 [2020-10-11 15:13:35,880 INFO L226 Difference]: Without dead ends: 21452 [2020-10-11 15:13:35,880 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:13:35,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21452 states. [2020-10-11 15:13:36,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21452 to 9401. [2020-10-11 15:13:36,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9401 states. [2020-10-11 15:13:36,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9401 states to 9401 states and 43010 transitions. [2020-10-11 15:13:36,221 INFO L78 Accepts]: Start accepts. Automaton has 9401 states and 43010 transitions. Word has length 23 [2020-10-11 15:13:36,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:36,221 INFO L481 AbstractCegarLoop]: Abstraction has 9401 states and 43010 transitions. [2020-10-11 15:13:36,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:13:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 9401 states and 43010 transitions. [2020-10-11 15:13:36,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:13:36,223 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:36,223 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:36,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-10-11 15:13:36,224 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:36,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:36,224 INFO L82 PathProgramCache]: Analyzing trace with hash -150471558, now seen corresponding path program 2 times [2020-10-11 15:13:36,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:36,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294634500] [2020-10-11 15:13:36,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:36,265 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:13:36,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294634500] [2020-10-11 15:13:36,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:36,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:13:36,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509527368] [2020-10-11 15:13:36,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:13:36,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:36,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:13:36,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:36,267 INFO L87 Difference]: Start difference. First operand 9401 states and 43010 transitions. Second operand 7 states. [2020-10-11 15:13:36,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:36,640 INFO L93 Difference]: Finished difference Result 21218 states and 86469 transitions. [2020-10-11 15:13:36,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:36,641 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-11 15:13:36,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:36,707 INFO L225 Difference]: With dead ends: 21218 [2020-10-11 15:13:36,707 INFO L226 Difference]: Without dead ends: 21181 [2020-10-11 15:13:36,708 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:13:36,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21181 states. [2020-10-11 15:13:37,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21181 to 9396. [2020-10-11 15:13:37,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9396 states. [2020-10-11 15:13:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9396 states to 9396 states and 42985 transitions. [2020-10-11 15:13:37,352 INFO L78 Accepts]: Start accepts. Automaton has 9396 states and 42985 transitions. Word has length 23 [2020-10-11 15:13:37,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:37,352 INFO L481 AbstractCegarLoop]: Abstraction has 9396 states and 42985 transitions. [2020-10-11 15:13:37,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:13:37,352 INFO L276 IsEmpty]: Start isEmpty. Operand 9396 states and 42985 transitions. [2020-10-11 15:13:37,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:13:37,354 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:37,354 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:37,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-10-11 15:13:37,355 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:37,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:37,355 INFO L82 PathProgramCache]: Analyzing trace with hash -150449920, now seen corresponding path program 2 times [2020-10-11 15:13:37,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:37,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029934335] [2020-10-11 15:13:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:37,396 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:13:37,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029934335] [2020-10-11 15:13:37,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:37,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:13:37,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925855656] [2020-10-11 15:13:37,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:13:37,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:37,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:13:37,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:37,397 INFO L87 Difference]: Start difference. First operand 9396 states and 42985 transitions. Second operand 7 states. [2020-10-11 15:13:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:37,682 INFO L93 Difference]: Finished difference Result 21047 states and 85702 transitions. [2020-10-11 15:13:37,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:13:37,683 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-11 15:13:37,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:37,729 INFO L225 Difference]: With dead ends: 21047 [2020-10-11 15:13:37,729 INFO L226 Difference]: Without dead ends: 21010 [2020-10-11 15:13:37,729 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:13:37,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21010 states. [2020-10-11 15:13:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21010 to 9426. [2020-10-11 15:13:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9426 states. [2020-10-11 15:13:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9426 states to 9426 states and 43057 transitions. [2020-10-11 15:13:38,056 INFO L78 Accepts]: Start accepts. Automaton has 9426 states and 43057 transitions. Word has length 23 [2020-10-11 15:13:38,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:38,056 INFO L481 AbstractCegarLoop]: Abstraction has 9426 states and 43057 transitions. [2020-10-11 15:13:38,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:13:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 9426 states and 43057 transitions. [2020-10-11 15:13:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:38,059 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:38,059 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:38,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-10-11 15:13:38,060 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:38,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:38,060 INFO L82 PathProgramCache]: Analyzing trace with hash -156736363, now seen corresponding path program 1 times [2020-10-11 15:13:38,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:38,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72339440] [2020-10-11 15:13:38,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:38,105 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:13:38,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72339440] [2020-10-11 15:13:38,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825076011] [2020-10-11 15:13:38,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:38,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:38,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:38,224 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:13:38,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:38,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:38,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127252651] [2020-10-11 15:13:38,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:38,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:38,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:38,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:38,225 INFO L87 Difference]: Start difference. First operand 9426 states and 43057 transitions. Second operand 11 states. [2020-10-11 15:13:38,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:38,946 INFO L93 Difference]: Finished difference Result 30145 states and 115754 transitions. [2020-10-11 15:13:38,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:38,947 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:38,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:39,012 INFO L225 Difference]: With dead ends: 30145 [2020-10-11 15:13:39,012 INFO L226 Difference]: Without dead ends: 30125 [2020-10-11 15:13:39,013 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:39,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30125 states. [2020-10-11 15:13:39,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30125 to 9338. [2020-10-11 15:13:39,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9338 states. [2020-10-11 15:13:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9338 states to 9338 states and 42582 transitions. [2020-10-11 15:13:39,439 INFO L78 Accepts]: Start accepts. Automaton has 9338 states and 42582 transitions. Word has length 25 [2020-10-11 15:13:39,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:39,439 INFO L481 AbstractCegarLoop]: Abstraction has 9338 states and 42582 transitions. [2020-10-11 15:13:39,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 9338 states and 42582 transitions. [2020-10-11 15:13:39,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:39,443 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:39,443 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:39,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2020-10-11 15:13:39,644 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:39,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:39,645 INFO L82 PathProgramCache]: Analyzing trace with hash -558170603, now seen corresponding path program 1 times [2020-10-11 15:13:39,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:39,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653874483] [2020-10-11 15:13:39,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:39,690 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:39,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653874483] [2020-10-11 15:13:39,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027996106] [2020-10-11 15:13:39,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:39,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:39,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:39,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:39,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:39,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833925018] [2020-10-11 15:13:39,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:39,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:39,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:39,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:39,781 INFO L87 Difference]: Start difference. First operand 9338 states and 42582 transitions. Second operand 11 states. [2020-10-11 15:13:40,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:40,474 INFO L93 Difference]: Finished difference Result 29696 states and 113916 transitions. [2020-10-11 15:13:40,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:40,474 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:40,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:40,537 INFO L225 Difference]: With dead ends: 29696 [2020-10-11 15:13:40,537 INFO L226 Difference]: Without dead ends: 29676 [2020-10-11 15:13:40,538 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:40,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29676 states. [2020-10-11 15:13:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29676 to 9291. [2020-10-11 15:13:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9291 states. [2020-10-11 15:13:41,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9291 states to 9291 states and 42295 transitions. [2020-10-11 15:13:41,100 INFO L78 Accepts]: Start accepts. Automaton has 9291 states and 42295 transitions. Word has length 25 [2020-10-11 15:13:41,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:41,101 INFO L481 AbstractCegarLoop]: Abstraction has 9291 states and 42295 transitions. [2020-10-11 15:13:41,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:41,101 INFO L276 IsEmpty]: Start isEmpty. Operand 9291 states and 42295 transitions. [2020-10-11 15:13:41,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:41,103 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:41,103 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:41,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2020-10-11 15:13:41,304 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:41,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:41,305 INFO L82 PathProgramCache]: Analyzing trace with hash -379966665, now seen corresponding path program 2 times [2020-10-11 15:13:41,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:41,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074216262] [2020-10-11 15:13:41,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:41,350 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:13:41,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074216262] [2020-10-11 15:13:41,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715012481] [2020-10-11 15:13:41,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:41,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:13:41,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:41,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:41,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:41,442 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:13:41,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:41,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:41,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480616705] [2020-10-11 15:13:41,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:41,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:41,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:41,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:41,444 INFO L87 Difference]: Start difference. First operand 9291 states and 42295 transitions. Second operand 11 states. [2020-10-11 15:13:42,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:42,099 INFO L93 Difference]: Finished difference Result 29267 states and 112142 transitions. [2020-10-11 15:13:42,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:42,099 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:42,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:42,163 INFO L225 Difference]: With dead ends: 29267 [2020-10-11 15:13:42,163 INFO L226 Difference]: Without dead ends: 29245 [2020-10-11 15:13:42,164 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:42,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2020-10-11 15:13:42,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 9288. [2020-10-11 15:13:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9288 states. [2020-10-11 15:13:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9288 states to 9288 states and 42242 transitions. [2020-10-11 15:13:42,570 INFO L78 Accepts]: Start accepts. Automaton has 9288 states and 42242 transitions. Word has length 25 [2020-10-11 15:13:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:42,570 INFO L481 AbstractCegarLoop]: Abstraction has 9288 states and 42242 transitions. [2020-10-11 15:13:42,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:42,570 INFO L276 IsEmpty]: Start isEmpty. Operand 9288 states and 42242 transitions. [2020-10-11 15:13:42,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:42,573 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:42,573 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:42,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2020-10-11 15:13:42,774 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:42,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:42,775 INFO L82 PathProgramCache]: Analyzing trace with hash -379945027, now seen corresponding path program 2 times [2020-10-11 15:13:42,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:42,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306219145] [2020-10-11 15:13:42,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:13:42,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306219145] [2020-10-11 15:13:42,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418204262] [2020-10-11 15:13:42,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:42,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:13:42,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:42,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:42,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:13:42,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:42,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:42,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782344100] [2020-10-11 15:13:42,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:42,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:42,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:42,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:42,914 INFO L87 Difference]: Start difference. First operand 9288 states and 42242 transitions. Second operand 11 states. [2020-10-11 15:13:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:43,595 INFO L93 Difference]: Finished difference Result 28920 states and 110796 transitions. [2020-10-11 15:13:43,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:43,595 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:43,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:43,660 INFO L225 Difference]: With dead ends: 28920 [2020-10-11 15:13:43,660 INFO L226 Difference]: Without dead ends: 28898 [2020-10-11 15:13:43,660 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:43,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28898 states. [2020-10-11 15:13:44,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28898 to 9176. [2020-10-11 15:13:44,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2020-10-11 15:13:44,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 41695 transitions. [2020-10-11 15:13:44,061 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 41695 transitions. Word has length 25 [2020-10-11 15:13:44,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:44,062 INFO L481 AbstractCegarLoop]: Abstraction has 9176 states and 41695 transitions. [2020-10-11 15:13:44,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:44,062 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 41695 transitions. [2020-10-11 15:13:44,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:44,065 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:44,065 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:44,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:44,266 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:44,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:44,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1211690581, now seen corresponding path program 3 times [2020-10-11 15:13:44,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:44,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225224819] [2020-10-11 15:13:44,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:44,312 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:44,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225224819] [2020-10-11 15:13:44,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744116814] [2020-10-11 15:13:44,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:44,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-11 15:13:44,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:44,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:44,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:44,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:44,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:44,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055929400] [2020-10-11 15:13:44,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:44,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:44,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:44,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:44,408 INFO L87 Difference]: Start difference. First operand 9176 states and 41695 transitions. Second operand 11 states. [2020-10-11 15:13:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:45,054 INFO L93 Difference]: Finished difference Result 29038 states and 111216 transitions. [2020-10-11 15:13:45,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:45,054 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:45,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:45,117 INFO L225 Difference]: With dead ends: 29038 [2020-10-11 15:13:45,117 INFO L226 Difference]: Without dead ends: 29018 [2020-10-11 15:13:45,117 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:45,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29018 states. [2020-10-11 15:13:45,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29018 to 9000. [2020-10-11 15:13:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9000 states. [2020-10-11 15:13:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9000 states to 9000 states and 40897 transitions. [2020-10-11 15:13:45,704 INFO L78 Accepts]: Start accepts. Automaton has 9000 states and 40897 transitions. Word has length 25 [2020-10-11 15:13:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:45,704 INFO L481 AbstractCegarLoop]: Abstraction has 9000 states and 40897 transitions. [2020-10-11 15:13:45,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:45,704 INFO L276 IsEmpty]: Start isEmpty. Operand 9000 states and 40897 transitions. [2020-10-11 15:13:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:45,707 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:45,707 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:45,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2020-10-11 15:13:45,908 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:45,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:45,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1201691221, now seen corresponding path program 4 times [2020-10-11 15:13:45,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:45,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301755593] [2020-10-11 15:13:45,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:45,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301755593] [2020-10-11 15:13:45,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174397209] [2020-10-11 15:13:45,957 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:46,025 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:13:46,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:46,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:46,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:46,044 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:46,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:46,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:46,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567732905] [2020-10-11 15:13:46,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:46,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:46,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:46,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:46,045 INFO L87 Difference]: Start difference. First operand 9000 states and 40897 transitions. Second operand 11 states. [2020-10-11 15:13:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:46,760 INFO L93 Difference]: Finished difference Result 29283 states and 112236 transitions. [2020-10-11 15:13:46,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:46,760 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:46,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:46,823 INFO L225 Difference]: With dead ends: 29283 [2020-10-11 15:13:46,823 INFO L226 Difference]: Without dead ends: 29261 [2020-10-11 15:13:46,823 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:46,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29261 states. [2020-10-11 15:13:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29261 to 8997. [2020-10-11 15:13:47,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8997 states. [2020-10-11 15:13:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8997 states to 8997 states and 40842 transitions. [2020-10-11 15:13:47,225 INFO L78 Accepts]: Start accepts. Automaton has 8997 states and 40842 transitions. Word has length 25 [2020-10-11 15:13:47,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:47,225 INFO L481 AbstractCegarLoop]: Abstraction has 8997 states and 40842 transitions. [2020-10-11 15:13:47,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 8997 states and 40842 transitions. [2020-10-11 15:13:47,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:47,228 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:47,228 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:47,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:47,430 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:47,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:47,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1201697793, now seen corresponding path program 1 times [2020-10-11 15:13:47,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:47,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682448549] [2020-10-11 15:13:47,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:47,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682448549] [2020-10-11 15:13:47,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823758975] [2020-10-11 15:13:47,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:47,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:47,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:47,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:47,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:47,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580205248] [2020-10-11 15:13:47,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:47,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:47,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:47,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:47,569 INFO L87 Difference]: Start difference. First operand 8997 states and 40842 transitions. Second operand 11 states. [2020-10-11 15:13:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:48,303 INFO L93 Difference]: Finished difference Result 29105 states and 111801 transitions. [2020-10-11 15:13:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:48,303 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:48,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:48,365 INFO L225 Difference]: With dead ends: 29105 [2020-10-11 15:13:48,365 INFO L226 Difference]: Without dead ends: 29085 [2020-10-11 15:13:48,365 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:48,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29085 states. [2020-10-11 15:13:48,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29085 to 8955. [2020-10-11 15:13:48,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8955 states. [2020-10-11 15:13:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8955 states to 8955 states and 40593 transitions. [2020-10-11 15:13:48,766 INFO L78 Accepts]: Start accepts. Automaton has 8955 states and 40593 transitions. Word has length 25 [2020-10-11 15:13:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:48,767 INFO L481 AbstractCegarLoop]: Abstraction has 8955 states and 40593 transitions. [2020-10-11 15:13:48,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 8955 states and 40593 transitions. [2020-10-11 15:13:48,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:48,770 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:48,770 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:48,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2020-10-11 15:13:48,971 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:48,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:48,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1218006273, now seen corresponding path program 2 times [2020-10-11 15:13:48,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:48,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46329408] [2020-10-11 15:13:48,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:49,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46329408] [2020-10-11 15:13:49,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469483596] [2020-10-11 15:13:49,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:49,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:13:49,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:49,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:49,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-11 15:13:49,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:49,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:49,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108120072] [2020-10-11 15:13:49,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:49,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:49,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:49,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:49,117 INFO L87 Difference]: Start difference. First operand 8955 states and 40593 transitions. Second operand 11 states. [2020-10-11 15:13:50,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:50,138 INFO L93 Difference]: Finished difference Result 28806 states and 110558 transitions. [2020-10-11 15:13:50,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:50,139 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:50,250 INFO L225 Difference]: With dead ends: 28806 [2020-10-11 15:13:50,250 INFO L226 Difference]: Without dead ends: 28779 [2020-10-11 15:13:50,250 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:50,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28779 states. [2020-10-11 15:13:51,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28779 to 8841. [2020-10-11 15:13:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8841 states. [2020-10-11 15:13:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 40062 transitions. [2020-10-11 15:13:51,366 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 40062 transitions. Word has length 25 [2020-10-11 15:13:51,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:51,367 INFO L481 AbstractCegarLoop]: Abstraction has 8841 states and 40062 transitions. [2020-10-11 15:13:51,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 40062 transitions. [2020-10-11 15:13:51,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:51,372 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:51,372 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:51,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:51,586 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:51,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:51,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1980442581, now seen corresponding path program 3 times [2020-10-11 15:13:51,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:51,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655406077] [2020-10-11 15:13:51,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:51,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655406077] [2020-10-11 15:13:51,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793238782] [2020-10-11 15:13:51,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:51,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-11 15:13:51,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:51,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:51,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:51,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:51,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:51,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497515141] [2020-10-11 15:13:51,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:51,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:51,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:51,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:51,716 INFO L87 Difference]: Start difference. First operand 8841 states and 40062 transitions. Second operand 11 states. [2020-10-11 15:13:52,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:52,422 INFO L93 Difference]: Finished difference Result 28636 states and 109852 transitions. [2020-10-11 15:13:52,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:52,423 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:52,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:52,482 INFO L225 Difference]: With dead ends: 28636 [2020-10-11 15:13:52,483 INFO L226 Difference]: Without dead ends: 28616 [2020-10-11 15:13:52,483 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:52,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28616 states. [2020-10-11 15:13:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28616 to 8702. [2020-10-11 15:13:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8702 states. [2020-10-11 15:13:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8702 states to 8702 states and 39438 transitions. [2020-10-11 15:13:52,865 INFO L78 Accepts]: Start accepts. Automaton has 8702 states and 39438 transitions. Word has length 25 [2020-10-11 15:13:52,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:52,866 INFO L481 AbstractCegarLoop]: Abstraction has 8702 states and 39438 transitions. [2020-10-11 15:13:52,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 8702 states and 39438 transitions. [2020-10-11 15:13:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:52,870 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:52,870 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:53,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2020-10-11 15:13:53,084 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:53,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:53,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1965964155, now seen corresponding path program 3 times [2020-10-11 15:13:53,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:53,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658077959] [2020-10-11 15:13:53,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:53,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658077959] [2020-10-11 15:13:53,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031776539] [2020-10-11 15:13:53,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:53,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-11 15:13:53,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:53,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:53,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:53,263 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:53,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:53,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:53,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732327521] [2020-10-11 15:13:53,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:53,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:53,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:53,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:53,273 INFO L87 Difference]: Start difference. First operand 8702 states and 39438 transitions. Second operand 11 states. [2020-10-11 15:13:54,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:54,241 INFO L93 Difference]: Finished difference Result 28297 states and 108461 transitions. [2020-10-11 15:13:54,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:54,242 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:54,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:54,334 INFO L225 Difference]: With dead ends: 28297 [2020-10-11 15:13:54,334 INFO L226 Difference]: Without dead ends: 28277 [2020-10-11 15:13:54,343 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:54,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28277 states. [2020-10-11 15:13:54,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28277 to 8596. [2020-10-11 15:13:54,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8596 states. [2020-10-11 15:13:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8596 states to 8596 states and 38978 transitions. [2020-10-11 15:13:54,863 INFO L78 Accepts]: Start accepts. Automaton has 8596 states and 38978 transitions. Word has length 25 [2020-10-11 15:13:54,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:54,864 INFO L481 AbstractCegarLoop]: Abstraction has 8596 states and 38978 transitions. [2020-10-11 15:13:54,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:54,864 INFO L276 IsEmpty]: Start isEmpty. Operand 8596 states and 38978 transitions. [2020-10-11 15:13:54,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:54,866 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:54,866 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:55,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:55,067 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:55,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:55,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1970443221, now seen corresponding path program 4 times [2020-10-11 15:13:55,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:55,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672213858] [2020-10-11 15:13:55,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:55,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672213858] [2020-10-11 15:13:55,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553911997] [2020-10-11 15:13:55,118 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:55,194 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:13:55,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:55,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:55,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:55,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:55,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:55,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620153298] [2020-10-11 15:13:55,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:55,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:55,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:55,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:55,217 INFO L87 Difference]: Start difference. First operand 8596 states and 38978 transitions. Second operand 11 states. [2020-10-11 15:13:55,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:55,870 INFO L93 Difference]: Finished difference Result 28565 states and 109596 transitions. [2020-10-11 15:13:55,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:55,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:55,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:55,929 INFO L225 Difference]: With dead ends: 28565 [2020-10-11 15:13:55,929 INFO L226 Difference]: Without dead ends: 28538 [2020-10-11 15:13:55,930 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2020-10-11 15:13:56,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 8563. [2020-10-11 15:13:56,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8563 states. [2020-10-11 15:13:56,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8563 states to 8563 states and 38809 transitions. [2020-10-11 15:13:56,323 INFO L78 Accepts]: Start accepts. Automaton has 8563 states and 38809 transitions. Word has length 25 [2020-10-11 15:13:56,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:56,323 INFO L481 AbstractCegarLoop]: Abstraction has 8563 states and 38809 transitions. [2020-10-11 15:13:56,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:56,323 INFO L276 IsEmpty]: Start isEmpty. Operand 8563 states and 38809 transitions. [2020-10-11 15:13:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:56,326 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:56,326 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:56,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2020-10-11 15:13:56,527 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:56,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:56,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1970428155, now seen corresponding path program 4 times [2020-10-11 15:13:56,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:56,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480755730] [2020-10-11 15:13:56,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:56,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480755730] [2020-10-11 15:13:56,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390771178] [2020-10-11 15:13:56,576 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:56,647 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:13:56,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:13:56,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:13:56,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:13:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:13:56,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:13:56,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:13:56,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577729445] [2020-10-11 15:13:56,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:13:56,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:56,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:13:56,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:13:56,671 INFO L87 Difference]: Start difference. First operand 8563 states and 38809 transitions. Second operand 11 states. [2020-10-11 15:13:57,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:57,397 INFO L93 Difference]: Finished difference Result 28213 states and 108237 transitions. [2020-10-11 15:13:57,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:57,398 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:13:57,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:57,454 INFO L225 Difference]: With dead ends: 28213 [2020-10-11 15:13:57,454 INFO L226 Difference]: Without dead ends: 28186 [2020-10-11 15:13:57,454 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:13:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28186 states. [2020-10-11 15:13:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28186 to 8421. [2020-10-11 15:13:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8421 states. [2020-10-11 15:13:57,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8421 states to 8421 states and 38146 transitions. [2020-10-11 15:13:57,957 INFO L78 Accepts]: Start accepts. Automaton has 8421 states and 38146 transitions. Word has length 25 [2020-10-11 15:13:57,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:57,958 INFO L481 AbstractCegarLoop]: Abstraction has 8421 states and 38146 transitions. [2020-10-11 15:13:57,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:13:57,958 INFO L276 IsEmpty]: Start isEmpty. Operand 8421 states and 38146 transitions. [2020-10-11 15:13:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:57,960 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:57,961 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:58,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:13:58,161 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:58,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:58,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1943046054, now seen corresponding path program 1 times [2020-10-11 15:13:58,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:58,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600081337] [2020-10-11 15:13:58,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:13:58,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600081337] [2020-10-11 15:13:58,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:58,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:13:58,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770774526] [2020-10-11 15:13:58,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:13:58,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:58,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:13:58,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:13:58,194 INFO L87 Difference]: Start difference. First operand 8421 states and 38146 transitions. Second operand 5 states. [2020-10-11 15:13:58,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:58,354 INFO L93 Difference]: Finished difference Result 13647 states and 59401 transitions. [2020-10-11 15:13:58,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:13:58,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-10-11 15:13:58,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:58,405 INFO L225 Difference]: With dead ends: 13647 [2020-10-11 15:13:58,405 INFO L226 Difference]: Without dead ends: 13615 [2020-10-11 15:13:58,406 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:13:58,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13615 states. [2020-10-11 15:13:58,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13615 to 9928. [2020-10-11 15:13:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9928 states. [2020-10-11 15:13:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9928 states to 9928 states and 44651 transitions. [2020-10-11 15:13:58,855 INFO L78 Accepts]: Start accepts. Automaton has 9928 states and 44651 transitions. Word has length 25 [2020-10-11 15:13:58,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:13:58,856 INFO L481 AbstractCegarLoop]: Abstraction has 9928 states and 44651 transitions. [2020-10-11 15:13:58,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:13:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 9928 states and 44651 transitions. [2020-10-11 15:13:58,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:13:58,860 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:13:58,861 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:13:58,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-10-11 15:13:58,861 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:13:58,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:13:58,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1440199159, now seen corresponding path program 5 times [2020-10-11 15:13:58,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:13:58,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259904214] [2020-10-11 15:13:58,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:13:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:13:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:13:58,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259904214] [2020-10-11 15:13:58,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:13:58,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:13:58,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102147819] [2020-10-11 15:13:58,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:13:58,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:13:58,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:13:58,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:13:58,913 INFO L87 Difference]: Start difference. First operand 9928 states and 44651 transitions. Second operand 9 states. [2020-10-11 15:13:59,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:13:59,525 INFO L93 Difference]: Finished difference Result 31816 states and 123346 transitions. [2020-10-11 15:13:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:13:59,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:13:59,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:13:59,591 INFO L225 Difference]: With dead ends: 31816 [2020-10-11 15:13:59,591 INFO L226 Difference]: Without dead ends: 31790 [2020-10-11 15:13:59,591 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:13:59,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31790 states. [2020-10-11 15:14:00,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31790 to 9766. [2020-10-11 15:14:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9766 states. [2020-10-11 15:14:00,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 43873 transitions. [2020-10-11 15:14:00,048 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 43873 transitions. Word has length 25 [2020-10-11 15:14:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:00,049 INFO L481 AbstractCegarLoop]: Abstraction has 9766 states and 43873 transitions. [2020-10-11 15:14:00,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 43873 transitions. [2020-10-11 15:14:00,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:14:00,051 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:00,051 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:00,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2020-10-11 15:14:00,052 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:00,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:00,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1440220797, now seen corresponding path program 5 times [2020-10-11 15:14:00,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:00,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587769717] [2020-10-11 15:14:00,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:00,108 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:14:00,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587769717] [2020-10-11 15:14:00,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:00,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:14:00,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418552235] [2020-10-11 15:14:00,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:00,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:00,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:00,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:00,109 INFO L87 Difference]: Start difference. First operand 9766 states and 43873 transitions. Second operand 9 states. [2020-10-11 15:14:00,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:00,763 INFO L93 Difference]: Finished difference Result 31277 states and 121098 transitions. [2020-10-11 15:14:00,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:00,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:14:00,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:00,829 INFO L225 Difference]: With dead ends: 31277 [2020-10-11 15:14:00,830 INFO L226 Difference]: Without dead ends: 31251 [2020-10-11 15:14:00,830 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:14:00,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31251 states. [2020-10-11 15:14:01,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31251 to 9592. [2020-10-11 15:14:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9592 states. [2020-10-11 15:14:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9592 states to 9592 states and 43051 transitions. [2020-10-11 15:14:01,275 INFO L78 Accepts]: Start accepts. Automaton has 9592 states and 43051 transitions. Word has length 25 [2020-10-11 15:14:01,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:01,275 INFO L481 AbstractCegarLoop]: Abstraction has 9592 states and 43051 transitions. [2020-10-11 15:14:01,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:01,276 INFO L276 IsEmpty]: Start isEmpty. Operand 9592 states and 43051 transitions. [2020-10-11 15:14:01,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:14:01,278 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:01,278 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:01,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2020-10-11 15:14:01,279 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:01,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:01,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1425735799, now seen corresponding path program 6 times [2020-10-11 15:14:01,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:01,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798526106] [2020-10-11 15:14:01,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:14:01,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798526106] [2020-10-11 15:14:01,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:01,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:14:01,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792972602] [2020-10-11 15:14:01,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:01,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:01,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:01,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:01,332 INFO L87 Difference]: Start difference. First operand 9592 states and 43051 transitions. Second operand 9 states. [2020-10-11 15:14:01,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:01,981 INFO L93 Difference]: Finished difference Result 30952 states and 119650 transitions. [2020-10-11 15:14:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:01,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:14:01,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:02,051 INFO L225 Difference]: With dead ends: 30952 [2020-10-11 15:14:02,051 INFO L226 Difference]: Without dead ends: 30919 [2020-10-11 15:14:02,051 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:14:02,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30919 states. [2020-10-11 15:14:02,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30919 to 9246. [2020-10-11 15:14:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9246 states. [2020-10-11 15:14:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9246 states to 9246 states and 41509 transitions. [2020-10-11 15:14:02,636 INFO L78 Accepts]: Start accepts. Automaton has 9246 states and 41509 transitions. Word has length 25 [2020-10-11 15:14:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:02,637 INFO L481 AbstractCegarLoop]: Abstraction has 9246 states and 41509 transitions. [2020-10-11 15:14:02,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 9246 states and 41509 transitions. [2020-10-11 15:14:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:14:02,639 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:02,639 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:02,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2020-10-11 15:14:02,640 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:02,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:02,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1425742371, now seen corresponding path program 5 times [2020-10-11 15:14:02,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:02,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801268225] [2020-10-11 15:14:02,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:02,683 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:14:02,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801268225] [2020-10-11 15:14:02,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:02,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:14:02,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535560700] [2020-10-11 15:14:02,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:02,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:02,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:02,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:02,685 INFO L87 Difference]: Start difference. First operand 9246 states and 41509 transitions. Second operand 9 states. [2020-10-11 15:14:03,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:03,354 INFO L93 Difference]: Finished difference Result 30541 states and 117947 transitions. [2020-10-11 15:14:03,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:03,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:14:03,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:03,420 INFO L225 Difference]: With dead ends: 30541 [2020-10-11 15:14:03,420 INFO L226 Difference]: Without dead ends: 30515 [2020-10-11 15:14:03,421 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:14:03,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30515 states. [2020-10-11 15:14:03,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30515 to 9136. [2020-10-11 15:14:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9136 states. [2020-10-11 15:14:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9136 states to 9136 states and 40999 transitions. [2020-10-11 15:14:03,839 INFO L78 Accepts]: Start accepts. Automaton has 9136 states and 40999 transitions. Word has length 25 [2020-10-11 15:14:03,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:03,840 INFO L481 AbstractCegarLoop]: Abstraction has 9136 states and 40999 transitions. [2020-10-11 15:14:03,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 9136 states and 40999 transitions. [2020-10-11 15:14:03,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:14:03,842 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:03,842 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:03,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2020-10-11 15:14:03,843 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:03,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:03,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1446529917, now seen corresponding path program 6 times [2020-10-11 15:14:03,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:03,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860758900] [2020-10-11 15:14:03,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:03,891 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:14:03,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860758900] [2020-10-11 15:14:03,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:03,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:14:03,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185761326] [2020-10-11 15:14:03,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:03,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:03,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:03,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:03,892 INFO L87 Difference]: Start difference. First operand 9136 states and 40999 transitions. Second operand 9 states. [2020-10-11 15:14:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:04,579 INFO L93 Difference]: Finished difference Result 30263 states and 116773 transitions. [2020-10-11 15:14:04,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:04,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:14:04,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:04,644 INFO L225 Difference]: With dead ends: 30263 [2020-10-11 15:14:04,644 INFO L226 Difference]: Without dead ends: 30230 [2020-10-11 15:14:04,644 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:14:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30230 states. [2020-10-11 15:14:05,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30230 to 8877. [2020-10-11 15:14:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8877 states. [2020-10-11 15:14:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8877 states to 8877 states and 39872 transitions. [2020-10-11 15:14:05,074 INFO L78 Accepts]: Start accepts. Automaton has 8877 states and 39872 transitions. Word has length 25 [2020-10-11 15:14:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:05,074 INFO L481 AbstractCegarLoop]: Abstraction has 8877 states and 39872 transitions. [2020-10-11 15:14:05,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 8877 states and 39872 transitions. [2020-10-11 15:14:05,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:14:05,077 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:05,077 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:05,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2020-10-11 15:14:05,078 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:05,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:05,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1446514851, now seen corresponding path program 6 times [2020-10-11 15:14:05,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:05,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748308413] [2020-10-11 15:14:05,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:14:05,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748308413] [2020-10-11 15:14:05,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:05,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:14:05,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082905415] [2020-10-11 15:14:05,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:05,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:05,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:05,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:05,131 INFO L87 Difference]: Start difference. First operand 8877 states and 39872 transitions. Second operand 9 states. [2020-10-11 15:14:05,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:05,835 INFO L93 Difference]: Finished difference Result 29856 states and 115140 transitions. [2020-10-11 15:14:05,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:05,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:14:05,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:05,899 INFO L225 Difference]: With dead ends: 29856 [2020-10-11 15:14:05,899 INFO L226 Difference]: Without dead ends: 29823 [2020-10-11 15:14:05,899 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:14:06,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29823 states. [2020-10-11 15:14:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29823 to 8560. [2020-10-11 15:14:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8560 states. [2020-10-11 15:14:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8560 states to 8560 states and 38495 transitions. [2020-10-11 15:14:06,316 INFO L78 Accepts]: Start accepts. Automaton has 8560 states and 38495 transitions. Word has length 25 [2020-10-11 15:14:06,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:06,316 INFO L481 AbstractCegarLoop]: Abstraction has 8560 states and 38495 transitions. [2020-10-11 15:14:06,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 8560 states and 38495 transitions. [2020-10-11 15:14:06,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-11 15:14:06,320 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:06,320 INFO L421 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:06,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2020-10-11 15:14:06,320 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:06,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:06,320 INFO L82 PathProgramCache]: Analyzing trace with hash -110415564, now seen corresponding path program 1 times [2020-10-11 15:14:06,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:06,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233232199] [2020-10-11 15:14:06,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:14:06,335 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:14:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:14:06,343 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:14:06,357 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 15:14:06,357 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 15:14:06,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2020-10-11 15:14:06,358 WARN L371 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-11 15:14:06,359 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2020-10-11 15:14:06,373 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,373 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,373 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,373 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,374 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,374 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,374 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,374 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,374 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,375 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,375 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,375 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,375 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,375 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,375 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,375 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,375 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,376 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,376 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,376 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,376 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,376 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,376 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,376 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,376 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,377 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,377 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,377 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,377 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,377 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,377 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,377 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,378 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,378 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,378 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,378 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,378 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,378 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,378 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,378 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,379 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,379 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,379 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,379 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,379 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,379 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,379 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,380 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,380 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,380 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,380 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,380 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,380 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,380 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,390 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,391 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,391 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,391 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,391 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,392 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,392 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,393 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,393 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,393 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,396 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,396 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,397 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,397 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,397 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,400 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,400 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,400 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,400 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,400 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,401 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,401 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,402 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,402 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,402 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,403 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,403 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,403 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,403 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,403 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,412 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,414 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,415 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,415 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,415 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,415 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:14:06,416 INFO L253 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-10-11 15:14:06,417 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:14:06,417 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:14:06,417 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:14:06,417 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:14:06,417 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:14:06,417 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:14:06,417 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:14:06,417 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:14:06,419 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:14:06,419 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 141 transitions, 402 flow [2020-10-11 15:14:06,419 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 141 transitions, 402 flow [2020-10-11 15:14:06,419 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions, 402 flow [2020-10-11 15:14:06,440 INFO L129 PetriNetUnfolder]: 8/171 cut-off events. [2020-10-11 15:14:06,440 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-11 15:14:06,442 INFO L80 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 310 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2020-10-11 15:14:06,449 INFO L117 LiptonReduction]: Number of co-enabled transitions 3612 [2020-10-11 15:14:08,164 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-10-11 15:14:08,446 INFO L132 LiptonReduction]: Checked pairs total: 5372 [2020-10-11 15:14:08,446 INFO L134 LiptonReduction]: Total number of compositions: 134 [2020-10-11 15:14:08,446 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 45 transitions, 210 flow [2020-10-11 15:14:09,964 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2020-10-11 15:14:09,965 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2020-10-11 15:14:09,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-11 15:14:09,965 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:09,965 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-11 15:14:09,965 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:09,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:09,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1291919, now seen corresponding path program 1 times [2020-10-11 15:14:09,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:09,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366847830] [2020-10-11 15:14:09,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:09,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:14:09,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366847830] [2020-10-11 15:14:09,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:09,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:14:09,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593998100] [2020-10-11 15:14:09,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:14:09,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:09,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:14:09,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:14:09,976 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2020-10-11 15:14:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:10,098 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2020-10-11 15:14:10,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:14:10,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-11 15:14:10,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:10,143 INFO L225 Difference]: With dead ends: 17885 [2020-10-11 15:14:10,143 INFO L226 Difference]: Without dead ends: 16791 [2020-10-11 15:14:10,144 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:14:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2020-10-11 15:14:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16791. [2020-10-11 15:14:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16791 states. [2020-10-11 15:14:10,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16791 states to 16791 states and 86558 transitions. [2020-10-11 15:14:10,900 INFO L78 Accepts]: Start accepts. Automaton has 16791 states and 86558 transitions. Word has length 3 [2020-10-11 15:14:10,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:10,900 INFO L481 AbstractCegarLoop]: Abstraction has 16791 states and 86558 transitions. [2020-10-11 15:14:10,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:14:10,900 INFO L276 IsEmpty]: Start isEmpty. Operand 16791 states and 86558 transitions. [2020-10-11 15:14:10,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 15:14:10,901 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:10,901 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:10,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2020-10-11 15:14:10,901 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:10,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:10,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1124534846, now seen corresponding path program 1 times [2020-10-11 15:14:10,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:10,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909870425] [2020-10-11 15:14:10,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:10,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:14:10,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909870425] [2020-10-11 15:14:10,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:10,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:14:10,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33355529] [2020-10-11 15:14:10,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:14:10,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:10,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:14:10,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:14:10,925 INFO L87 Difference]: Start difference. First operand 16791 states and 86558 transitions. Second operand 5 states. [2020-10-11 15:14:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:11,141 INFO L93 Difference]: Finished difference Result 30985 states and 150574 transitions. [2020-10-11 15:14:11,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:14:11,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-11 15:14:11,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:11,221 INFO L225 Difference]: With dead ends: 30985 [2020-10-11 15:14:11,221 INFO L226 Difference]: Without dead ends: 30977 [2020-10-11 15:14:11,222 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:14:11,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30977 states. [2020-10-11 15:14:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30977 to 19868. [2020-10-11 15:14:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19868 states. [2020-10-11 15:14:12,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19868 states to 19868 states and 103363 transitions. [2020-10-11 15:14:12,235 INFO L78 Accepts]: Start accepts. Automaton has 19868 states and 103363 transitions. Word has length 9 [2020-10-11 15:14:12,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:12,236 INFO L481 AbstractCegarLoop]: Abstraction has 19868 states and 103363 transitions. [2020-10-11 15:14:12,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:14:12,236 INFO L276 IsEmpty]: Start isEmpty. Operand 19868 states and 103363 transitions. [2020-10-11 15:14:12,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 15:14:12,236 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:12,236 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:12,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2020-10-11 15:14:12,236 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:12,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:12,237 INFO L82 PathProgramCache]: Analyzing trace with hash -696216523, now seen corresponding path program 1 times [2020-10-11 15:14:12,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:12,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295222832] [2020-10-11 15:14:12,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:14:12,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295222832] [2020-10-11 15:14:12,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:12,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:14:12,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388242869] [2020-10-11 15:14:12,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:14:12,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:12,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:14:12,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:14:12,268 INFO L87 Difference]: Start difference. First operand 19868 states and 103363 transitions. Second operand 5 states. [2020-10-11 15:14:12,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:12,512 INFO L93 Difference]: Finished difference Result 36296 states and 178836 transitions. [2020-10-11 15:14:12,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:14:12,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-11 15:14:12,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:12,608 INFO L225 Difference]: With dead ends: 36296 [2020-10-11 15:14:12,608 INFO L226 Difference]: Without dead ends: 36280 [2020-10-11 15:14:12,608 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:14:13,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36280 states. [2020-10-11 15:14:14,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36280 to 23806. [2020-10-11 15:14:14,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23806 states. [2020-10-11 15:14:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23806 states to 23806 states and 125455 transitions. [2020-10-11 15:14:14,175 INFO L78 Accepts]: Start accepts. Automaton has 23806 states and 125455 transitions. Word has length 13 [2020-10-11 15:14:14,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:14,175 INFO L481 AbstractCegarLoop]: Abstraction has 23806 states and 125455 transitions. [2020-10-11 15:14:14,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:14:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand 23806 states and 125455 transitions. [2020-10-11 15:14:14,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:14:14,175 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:14,175 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:14,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2020-10-11 15:14:14,176 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:14,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:14,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2123666531, now seen corresponding path program 1 times [2020-10-11 15:14:14,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:14,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743685129] [2020-10-11 15:14:14,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:14:14,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743685129] [2020-10-11 15:14:14,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718874069] [2020-10-11 15:14:14,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:14:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:14,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:14:14,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:14:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:14:14,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:14:14,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:14:14,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887668293] [2020-10-11 15:14:14,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:14,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:14,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:14,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:14,305 INFO L87 Difference]: Start difference. First operand 23806 states and 125455 transitions. Second operand 9 states. [2020-10-11 15:14:14,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:14,797 INFO L93 Difference]: Finished difference Result 56720 states and 262685 transitions. [2020-10-11 15:14:14,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:14:14,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-11 15:14:14,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:14,957 INFO L225 Difference]: With dead ends: 56720 [2020-10-11 15:14:14,957 INFO L226 Difference]: Without dead ends: 56704 [2020-10-11 15:14:14,957 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:14:15,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56704 states. [2020-10-11 15:14:16,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56704 to 23629. [2020-10-11 15:14:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23629 states. [2020-10-11 15:14:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23629 states to 23629 states and 124418 transitions. [2020-10-11 15:14:16,365 INFO L78 Accepts]: Start accepts. Automaton has 23629 states and 124418 transitions. Word has length 15 [2020-10-11 15:14:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:16,365 INFO L481 AbstractCegarLoop]: Abstraction has 23629 states and 124418 transitions. [2020-10-11 15:14:16,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:16,366 INFO L276 IsEmpty]: Start isEmpty. Operand 23629 states and 124418 transitions. [2020-10-11 15:14:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:14:16,366 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:16,366 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:16,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2020-10-11 15:14:16,567 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:16,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:16,567 INFO L82 PathProgramCache]: Analyzing trace with hash 950817645, now seen corresponding path program 2 times [2020-10-11 15:14:16,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:16,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245035746] [2020-10-11 15:14:16,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:14:16,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245035746] [2020-10-11 15:14:16,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:16,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:14:16,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953151558] [2020-10-11 15:14:16,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:14:16,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:16,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:14:16,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:14:16,598 INFO L87 Difference]: Start difference. First operand 23629 states and 124418 transitions. Second operand 7 states. [2020-10-11 15:14:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:17,103 INFO L93 Difference]: Finished difference Result 58078 states and 269185 transitions. [2020-10-11 15:14:17,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:14:17,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-11 15:14:17,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:17,267 INFO L225 Difference]: With dead ends: 58078 [2020-10-11 15:14:17,267 INFO L226 Difference]: Without dead ends: 58061 [2020-10-11 15:14:17,267 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:14:17,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58061 states. [2020-10-11 15:14:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58061 to 23109. [2020-10-11 15:14:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23109 states. [2020-10-11 15:14:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23109 states to 23109 states and 121651 transitions. [2020-10-11 15:14:21,220 INFO L78 Accepts]: Start accepts. Automaton has 23109 states and 121651 transitions. Word has length 15 [2020-10-11 15:14:21,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:21,220 INFO L481 AbstractCegarLoop]: Abstraction has 23109 states and 121651 transitions. [2020-10-11 15:14:21,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:14:21,221 INFO L276 IsEmpty]: Start isEmpty. Operand 23109 states and 121651 transitions. [2020-10-11 15:14:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-11 15:14:21,221 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:21,221 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:21,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2020-10-11 15:14:21,221 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:21,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:21,222 INFO L82 PathProgramCache]: Analyzing trace with hash -2120658652, now seen corresponding path program 1 times [2020-10-11 15:14:21,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:21,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378120051] [2020-10-11 15:14:21,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:14:21,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378120051] [2020-10-11 15:14:21,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:21,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:14:21,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629981574] [2020-10-11 15:14:21,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:14:21,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:21,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:14:21,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:14:21,244 INFO L87 Difference]: Start difference. First operand 23109 states and 121651 transitions. Second operand 5 states. [2020-10-11 15:14:21,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:21,551 INFO L93 Difference]: Finished difference Result 41885 states and 209629 transitions. [2020-10-11 15:14:21,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:14:21,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-11 15:14:21,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:21,670 INFO L225 Difference]: With dead ends: 41885 [2020-10-11 15:14:21,671 INFO L226 Difference]: Without dead ends: 41856 [2020-10-11 15:14:21,671 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:14:22,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41856 states. [2020-10-11 15:14:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41856 to 28237. [2020-10-11 15:14:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28237 states. [2020-10-11 15:14:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28237 states to 28237 states and 150261 transitions. [2020-10-11 15:14:22,943 INFO L78 Accepts]: Start accepts. Automaton has 28237 states and 150261 transitions. Word has length 17 [2020-10-11 15:14:22,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:22,944 INFO L481 AbstractCegarLoop]: Abstraction has 28237 states and 150261 transitions. [2020-10-11 15:14:22,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:14:22,944 INFO L276 IsEmpty]: Start isEmpty. Operand 28237 states and 150261 transitions. [2020-10-11 15:14:22,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:14:22,944 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:22,944 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:22,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2020-10-11 15:14:22,945 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:22,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:22,945 INFO L82 PathProgramCache]: Analyzing trace with hash 269605662, now seen corresponding path program 1 times [2020-10-11 15:14:22,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:22,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572349767] [2020-10-11 15:14:22,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:14:22,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572349767] [2020-10-11 15:14:22,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355163917] [2020-10-11 15:14:22,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:14:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:23,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:14:23,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:14:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:14:23,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:14:23,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:14:23,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104760451] [2020-10-11 15:14:23,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:23,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:23,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:23,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:23,078 INFO L87 Difference]: Start difference. First operand 28237 states and 150261 transitions. Second operand 9 states. [2020-10-11 15:14:23,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:23,633 INFO L93 Difference]: Finished difference Result 66831 states and 314874 transitions. [2020-10-11 15:14:23,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:14:23,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-10-11 15:14:23,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:23,820 INFO L225 Difference]: With dead ends: 66831 [2020-10-11 15:14:23,820 INFO L226 Difference]: Without dead ends: 66807 [2020-10-11 15:14:23,820 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:14:24,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66807 states. [2020-10-11 15:14:26,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66807 to 28673. [2020-10-11 15:14:26,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28673 states. [2020-10-11 15:14:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28673 states to 28673 states and 152375 transitions. [2020-10-11 15:14:26,240 INFO L78 Accepts]: Start accepts. Automaton has 28673 states and 152375 transitions. Word has length 19 [2020-10-11 15:14:26,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:26,240 INFO L481 AbstractCegarLoop]: Abstraction has 28673 states and 152375 transitions. [2020-10-11 15:14:26,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:26,241 INFO L276 IsEmpty]: Start isEmpty. Operand 28673 states and 152375 transitions. [2020-10-11 15:14:26,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:14:26,241 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:26,241 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:26,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2020-10-11 15:14:26,455 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:26,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:26,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2138468196, now seen corresponding path program 2 times [2020-10-11 15:14:26,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:26,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347125970] [2020-10-11 15:14:26,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:14:26,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347125970] [2020-10-11 15:14:26,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:26,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:14:26,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605030572] [2020-10-11 15:14:26,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:14:26,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:26,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:14:26,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:14:26,489 INFO L87 Difference]: Start difference. First operand 28673 states and 152375 transitions. Second operand 7 states. [2020-10-11 15:14:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:27,048 INFO L93 Difference]: Finished difference Result 68538 states and 323189 transitions. [2020-10-11 15:14:27,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:14:27,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:14:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:27,229 INFO L225 Difference]: With dead ends: 68538 [2020-10-11 15:14:27,229 INFO L226 Difference]: Without dead ends: 68505 [2020-10-11 15:14:27,230 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:14:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68505 states. [2020-10-11 15:14:28,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68505 to 28061. [2020-10-11 15:14:28,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28061 states. [2020-10-11 15:14:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28061 states to 28061 states and 149307 transitions. [2020-10-11 15:14:28,890 INFO L78 Accepts]: Start accepts. Automaton has 28061 states and 149307 transitions. Word has length 19 [2020-10-11 15:14:28,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:28,890 INFO L481 AbstractCegarLoop]: Abstraction has 28061 states and 149307 transitions. [2020-10-11 15:14:28,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:14:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 28061 states and 149307 transitions. [2020-10-11 15:14:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:14:28,891 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:28,891 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:28,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2020-10-11 15:14:28,891 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:28,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:28,891 INFO L82 PathProgramCache]: Analyzing trace with hash -2138444729, now seen corresponding path program 1 times [2020-10-11 15:14:28,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:28,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177780608] [2020-10-11 15:14:28,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:14:28,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177780608] [2020-10-11 15:14:28,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:28,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:14:28,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028395554] [2020-10-11 15:14:28,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:14:28,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:28,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:14:28,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:14:28,921 INFO L87 Difference]: Start difference. First operand 28061 states and 149307 transitions. Second operand 7 states. [2020-10-11 15:14:29,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:29,474 INFO L93 Difference]: Finished difference Result 69070 states and 326154 transitions. [2020-10-11 15:14:29,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:14:29,475 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:14:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:29,680 INFO L225 Difference]: With dead ends: 69070 [2020-10-11 15:14:29,680 INFO L226 Difference]: Without dead ends: 69037 [2020-10-11 15:14:29,680 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:14:30,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69037 states. [2020-10-11 15:14:33,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69037 to 28938. [2020-10-11 15:14:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28938 states. [2020-10-11 15:14:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28938 states to 28938 states and 153909 transitions. [2020-10-11 15:14:33,700 INFO L78 Accepts]: Start accepts. Automaton has 28938 states and 153909 transitions. Word has length 19 [2020-10-11 15:14:33,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:33,700 INFO L481 AbstractCegarLoop]: Abstraction has 28938 states and 153909 transitions. [2020-10-11 15:14:33,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:14:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 28938 states and 153909 transitions. [2020-10-11 15:14:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:14:33,701 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:33,701 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:33,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2020-10-11 15:14:33,702 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:33,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:33,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2117255609, now seen corresponding path program 2 times [2020-10-11 15:14:33,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:33,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857247463] [2020-10-11 15:14:33,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:14:33,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857247463] [2020-10-11 15:14:33,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:33,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:14:33,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86696751] [2020-10-11 15:14:33,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:14:33,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:33,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:14:33,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:14:33,733 INFO L87 Difference]: Start difference. First operand 28938 states and 153909 transitions. Second operand 7 states. [2020-10-11 15:14:34,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:34,272 INFO L93 Difference]: Finished difference Result 70096 states and 331298 transitions. [2020-10-11 15:14:34,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:14:34,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:14:34,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:34,477 INFO L225 Difference]: With dead ends: 70096 [2020-10-11 15:14:34,477 INFO L226 Difference]: Without dead ends: 70063 [2020-10-11 15:14:34,477 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:14:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70063 states. [2020-10-11 15:14:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70063 to 29094. [2020-10-11 15:14:36,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29094 states. [2020-10-11 15:14:36,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29094 states to 29094 states and 154883 transitions. [2020-10-11 15:14:36,182 INFO L78 Accepts]: Start accepts. Automaton has 29094 states and 154883 transitions. Word has length 19 [2020-10-11 15:14:36,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:36,182 INFO L481 AbstractCegarLoop]: Abstraction has 29094 states and 154883 transitions. [2020-10-11 15:14:36,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:14:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 29094 states and 154883 transitions. [2020-10-11 15:14:36,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:14:36,183 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:36,184 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:36,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2020-10-11 15:14:36,184 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:36,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:36,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1393024961, now seen corresponding path program 1 times [2020-10-11 15:14:36,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:36,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909248868] [2020-10-11 15:14:36,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:14:36,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909248868] [2020-10-11 15:14:36,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240425739] [2020-10-11 15:14:36,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:14:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:36,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:14:36,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:14:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:14:36,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:14:36,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:14:36,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375737905] [2020-10-11 15:14:36,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:14:36,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:36,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:14:36,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:14:36,350 INFO L87 Difference]: Start difference. First operand 29094 states and 154883 transitions. Second operand 11 states. [2020-10-11 15:14:37,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:37,436 INFO L93 Difference]: Finished difference Result 100731 states and 448596 transitions. [2020-10-11 15:14:37,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:37,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:14:37,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:37,705 INFO L225 Difference]: With dead ends: 100731 [2020-10-11 15:14:37,705 INFO L226 Difference]: Without dead ends: 100715 [2020-10-11 15:14:37,705 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:14:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100715 states. [2020-10-11 15:14:40,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100715 to 28723. [2020-10-11 15:14:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28723 states. [2020-10-11 15:14:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28723 states to 28723 states and 152772 transitions. [2020-10-11 15:14:40,747 INFO L78 Accepts]: Start accepts. Automaton has 28723 states and 152772 transitions. Word has length 21 [2020-10-11 15:14:40,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:40,748 INFO L481 AbstractCegarLoop]: Abstraction has 28723 states and 152772 transitions. [2020-10-11 15:14:40,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:14:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 28723 states and 152772 transitions. [2020-10-11 15:14:40,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:14:40,749 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:40,749 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:40,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:14:40,950 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:40,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:40,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1414214081, now seen corresponding path program 2 times [2020-10-11 15:14:40,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:40,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618412293] [2020-10-11 15:14:40,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:40,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:14:40,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618412293] [2020-10-11 15:14:40,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102064890] [2020-10-11 15:14:40,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:14:41,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:14:41,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:14:41,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:14:41,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:14:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-11 15:14:41,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:14:41,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:14:41,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666197925] [2020-10-11 15:14:41,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:14:41,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:41,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:14:41,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:14:41,107 INFO L87 Difference]: Start difference. First operand 28723 states and 152772 transitions. Second operand 11 states. [2020-10-11 15:14:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:42,205 INFO L93 Difference]: Finished difference Result 99884 states and 444368 transitions. [2020-10-11 15:14:42,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:42,205 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-11 15:14:42,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:42,476 INFO L225 Difference]: With dead ends: 99884 [2020-10-11 15:14:42,477 INFO L226 Difference]: Without dead ends: 99863 [2020-10-11 15:14:42,477 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:14:43,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99863 states. [2020-10-11 15:14:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99863 to 28343. [2020-10-11 15:14:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28343 states. [2020-10-11 15:14:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28343 states to 28343 states and 150639 transitions. [2020-10-11 15:14:44,626 INFO L78 Accepts]: Start accepts. Automaton has 28343 states and 150639 transitions. Word has length 21 [2020-10-11 15:14:44,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:44,626 INFO L481 AbstractCegarLoop]: Abstraction has 28343 states and 150639 transitions. [2020-10-11 15:14:44,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:14:44,627 INFO L276 IsEmpty]: Start isEmpty. Operand 28343 states and 150639 transitions. [2020-10-11 15:14:44,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:14:44,628 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:44,628 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:44,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2020-10-11 15:14:44,828 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:44,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:44,829 INFO L82 PathProgramCache]: Analyzing trace with hash -2073547329, now seen corresponding path program 3 times [2020-10-11 15:14:44,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:44,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352864823] [2020-10-11 15:14:44,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:14:44,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352864823] [2020-10-11 15:14:44,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:44,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:14:44,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568401559] [2020-10-11 15:14:44,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:44,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:44,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:44,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:44,881 INFO L87 Difference]: Start difference. First operand 28343 states and 150639 transitions. Second operand 9 states. [2020-10-11 15:14:45,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:45,941 INFO L93 Difference]: Finished difference Result 100063 states and 445271 transitions. [2020-10-11 15:14:45,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:45,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-11 15:14:45,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:47,024 INFO L225 Difference]: With dead ends: 100063 [2020-10-11 15:14:47,024 INFO L226 Difference]: Without dead ends: 100047 [2020-10-11 15:14:47,025 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:14:48,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100047 states. [2020-10-11 15:14:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100047 to 27662. [2020-10-11 15:14:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27662 states. [2020-10-11 15:14:49,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27662 states to 27662 states and 147100 transitions. [2020-10-11 15:14:49,053 INFO L78 Accepts]: Start accepts. Automaton has 27662 states and 147100 transitions. Word has length 21 [2020-10-11 15:14:49,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:49,053 INFO L481 AbstractCegarLoop]: Abstraction has 27662 states and 147100 transitions. [2020-10-11 15:14:49,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 27662 states and 147100 transitions. [2020-10-11 15:14:49,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:14:49,054 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:49,054 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:49,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2020-10-11 15:14:49,054 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:49,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:49,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2051019009, now seen corresponding path program 4 times [2020-10-11 15:14:49,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:49,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059645560] [2020-10-11 15:14:49,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:14:49,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059645560] [2020-10-11 15:14:49,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:49,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:14:49,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447313989] [2020-10-11 15:14:49,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:49,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:49,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:49,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:49,107 INFO L87 Difference]: Start difference. First operand 27662 states and 147100 transitions. Second operand 9 states. [2020-10-11 15:14:50,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:50,160 INFO L93 Difference]: Finished difference Result 99531 states and 442783 transitions. [2020-10-11 15:14:50,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:50,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-11 15:14:50,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:50,428 INFO L225 Difference]: With dead ends: 99531 [2020-10-11 15:14:50,429 INFO L226 Difference]: Without dead ends: 99510 [2020-10-11 15:14:50,429 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:14:51,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99510 states. [2020-10-11 15:14:52,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99510 to 27286. [2020-10-11 15:14:52,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27286 states. [2020-10-11 15:14:52,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27286 states to 27286 states and 144979 transitions. [2020-10-11 15:14:52,491 INFO L78 Accepts]: Start accepts. Automaton has 27286 states and 144979 transitions. Word has length 21 [2020-10-11 15:14:52,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:52,491 INFO L481 AbstractCegarLoop]: Abstraction has 27286 states and 144979 transitions. [2020-10-11 15:14:52,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:52,491 INFO L276 IsEmpty]: Start isEmpty. Operand 27286 states and 144979 transitions. [2020-10-11 15:14:52,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:14:52,492 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:52,492 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:52,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2020-10-11 15:14:52,492 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:52,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:52,493 INFO L82 PathProgramCache]: Analyzing trace with hash 102150333, now seen corresponding path program 1 times [2020-10-11 15:14:52,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:52,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596011845] [2020-10-11 15:14:52,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:14:52,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596011845] [2020-10-11 15:14:52,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:52,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:14:52,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121049027] [2020-10-11 15:14:52,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:14:52,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:52,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:14:52,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:14:52,512 INFO L87 Difference]: Start difference. First operand 27286 states and 144979 transitions. Second operand 5 states. [2020-10-11 15:14:52,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:52,852 INFO L93 Difference]: Finished difference Result 49004 states and 248721 transitions. [2020-10-11 15:14:52,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:14:52,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-11 15:14:52,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:53,444 INFO L225 Difference]: With dead ends: 49004 [2020-10-11 15:14:53,444 INFO L226 Difference]: Without dead ends: 48958 [2020-10-11 15:14:53,444 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:14:54,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48958 states. [2020-10-11 15:14:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48958 to 33985. [2020-10-11 15:14:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33985 states. [2020-10-11 15:14:54,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33985 states to 33985 states and 181777 transitions. [2020-10-11 15:14:54,884 INFO L78 Accepts]: Start accepts. Automaton has 33985 states and 181777 transitions. Word has length 21 [2020-10-11 15:14:54,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:54,884 INFO L481 AbstractCegarLoop]: Abstraction has 33985 states and 181777 transitions. [2020-10-11 15:14:54,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:14:54,884 INFO L276 IsEmpty]: Start isEmpty. Operand 33985 states and 181777 transitions. [2020-10-11 15:14:54,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:14:54,885 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:54,885 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:54,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2020-10-11 15:14:54,886 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:54,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:54,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1130516927, now seen corresponding path program 5 times [2020-10-11 15:14:54,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:54,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169743221] [2020-10-11 15:14:54,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:14:54,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169743221] [2020-10-11 15:14:54,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:54,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:14:54,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170768995] [2020-10-11 15:14:54,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:54,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:54,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:54,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:54,938 INFO L87 Difference]: Start difference. First operand 33985 states and 181777 transitions. Second operand 9 states. [2020-10-11 15:14:56,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:14:56,061 INFO L93 Difference]: Finished difference Result 115592 states and 523747 transitions. [2020-10-11 15:14:56,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:14:56,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-11 15:14:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:14:56,385 INFO L225 Difference]: With dead ends: 115592 [2020-10-11 15:14:56,385 INFO L226 Difference]: Without dead ends: 115567 [2020-10-11 15:14:56,386 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:14:57,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115567 states. [2020-10-11 15:14:58,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115567 to 33074. [2020-10-11 15:14:58,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33074 states. [2020-10-11 15:14:58,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33074 states to 33074 states and 176935 transitions. [2020-10-11 15:14:58,878 INFO L78 Accepts]: Start accepts. Automaton has 33074 states and 176935 transitions. Word has length 21 [2020-10-11 15:14:58,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:14:58,878 INFO L481 AbstractCegarLoop]: Abstraction has 33074 states and 176935 transitions. [2020-10-11 15:14:58,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:14:58,878 INFO L276 IsEmpty]: Start isEmpty. Operand 33074 states and 176935 transitions. [2020-10-11 15:14:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:14:58,879 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:14:58,879 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:14:58,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2020-10-11 15:14:58,879 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:14:58,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:14:58,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1131856127, now seen corresponding path program 6 times [2020-10-11 15:14:58,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:14:58,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947939106] [2020-10-11 15:14:58,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:14:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:14:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:14:58,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947939106] [2020-10-11 15:14:58,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:14:58,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:14:58,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648480205] [2020-10-11 15:14:58,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:14:58,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:14:58,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:14:58,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:14:58,930 INFO L87 Difference]: Start difference. First operand 33074 states and 176935 transitions. Second operand 9 states. [2020-10-11 15:15:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:00,059 INFO L93 Difference]: Finished difference Result 114402 states and 517732 transitions. [2020-10-11 15:15:00,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:15:00,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-11 15:15:00,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:00,382 INFO L225 Difference]: With dead ends: 114402 [2020-10-11 15:15:00,382 INFO L226 Difference]: Without dead ends: 114371 [2020-10-11 15:15:00,383 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:15:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114371 states. [2020-10-11 15:15:03,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114371 to 31960. [2020-10-11 15:15:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31960 states. [2020-10-11 15:15:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31960 states to 31960 states and 171209 transitions. [2020-10-11 15:15:03,392 INFO L78 Accepts]: Start accepts. Automaton has 31960 states and 171209 transitions. Word has length 21 [2020-10-11 15:15:03,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:03,392 INFO L481 AbstractCegarLoop]: Abstraction has 31960 states and 171209 transitions. [2020-10-11 15:15:03,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:15:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 31960 states and 171209 transitions. [2020-10-11 15:15:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:15:03,394 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:03,394 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:03,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2020-10-11 15:15:03,394 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:15:03,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:03,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1106577557, now seen corresponding path program 1 times [2020-10-11 15:15:03,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:03,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073272749] [2020-10-11 15:15:03,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:03,423 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:03,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073272749] [2020-10-11 15:15:03,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882956491] [2020-10-11 15:15:03,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:03,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:15:03,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:03,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:03,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:15:03,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599467190] [2020-10-11 15:15:03,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:15:03,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:03,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:15:03,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:15:03,554 INFO L87 Difference]: Start difference. First operand 31960 states and 171209 transitions. Second operand 9 states. [2020-10-11 15:15:04,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:04,197 INFO L93 Difference]: Finished difference Result 75380 states and 361389 transitions. [2020-10-11 15:15:04,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:15:04,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-11 15:15:04,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:04,412 INFO L225 Difference]: With dead ends: 75380 [2020-10-11 15:15:04,412 INFO L226 Difference]: Without dead ends: 75344 [2020-10-11 15:15:04,413 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:15:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75344 states. [2020-10-11 15:15:06,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75344 to 32974. [2020-10-11 15:15:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32974 states. [2020-10-11 15:15:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32974 states to 32974 states and 176363 transitions. [2020-10-11 15:15:06,268 INFO L78 Accepts]: Start accepts. Automaton has 32974 states and 176363 transitions. Word has length 23 [2020-10-11 15:15:06,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:06,268 INFO L481 AbstractCegarLoop]: Abstraction has 32974 states and 176363 transitions. [2020-10-11 15:15:06,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:15:06,268 INFO L276 IsEmpty]: Start isEmpty. Operand 32974 states and 176363 transitions. [2020-10-11 15:15:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:15:06,270 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:06,270 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:06,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:06,470 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:15:06,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:06,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1026706248, now seen corresponding path program 1 times [2020-10-11 15:15:06,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:06,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751003265] [2020-10-11 15:15:06,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:06,504 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:06,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751003265] [2020-10-11 15:15:06,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981746986] [2020-10-11 15:15:06,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:06,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:15:06,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:06,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:06,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:15:06,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448662352] [2020-10-11 15:15:06,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:15:06,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:06,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:15:06,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:15:06,605 INFO L87 Difference]: Start difference. First operand 32974 states and 176363 transitions. Second operand 9 states. [2020-10-11 15:15:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:07,255 INFO L93 Difference]: Finished difference Result 79463 states and 381713 transitions. [2020-10-11 15:15:07,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:15:07,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-11 15:15:07,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:07,480 INFO L225 Difference]: With dead ends: 79463 [2020-10-11 15:15:07,480 INFO L226 Difference]: Without dead ends: 79421 [2020-10-11 15:15:07,480 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:15:08,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79421 states. [2020-10-11 15:15:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79421 to 33977. [2020-10-11 15:15:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33977 states. [2020-10-11 15:15:10,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33977 states to 33977 states and 181698 transitions. [2020-10-11 15:15:10,016 INFO L78 Accepts]: Start accepts. Automaton has 33977 states and 181698 transitions. Word has length 23 [2020-10-11 15:15:10,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:10,017 INFO L481 AbstractCegarLoop]: Abstraction has 33977 states and 181698 transitions. [2020-10-11 15:15:10,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:15:10,017 INFO L276 IsEmpty]: Start isEmpty. Operand 33977 states and 181698 transitions. [2020-10-11 15:15:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:15:10,019 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:10,019 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:10,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:10,220 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:15:10,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:10,220 INFO L82 PathProgramCache]: Analyzing trace with hash -617779723, now seen corresponding path program 2 times [2020-10-11 15:15:10,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:10,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647808758] [2020-10-11 15:15:10,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:15:10,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647808758] [2020-10-11 15:15:10,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:15:10,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:15:10,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306612504] [2020-10-11 15:15:10,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:15:10,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:10,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:15:10,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:15:10,255 INFO L87 Difference]: Start difference. First operand 33977 states and 181698 transitions. Second operand 7 states. [2020-10-11 15:15:10,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:10,890 INFO L93 Difference]: Finished difference Result 80867 states and 388763 transitions. [2020-10-11 15:15:10,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:15:10,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-11 15:15:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:11,123 INFO L225 Difference]: With dead ends: 80867 [2020-10-11 15:15:11,123 INFO L226 Difference]: Without dead ends: 80812 [2020-10-11 15:15:11,123 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:15:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80812 states. [2020-10-11 15:15:12,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80812 to 34223. [2020-10-11 15:15:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34223 states. [2020-10-11 15:15:13,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34223 states to 34223 states and 183033 transitions. [2020-10-11 15:15:13,063 INFO L78 Accepts]: Start accepts. Automaton has 34223 states and 183033 transitions. Word has length 23 [2020-10-11 15:15:13,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:13,063 INFO L481 AbstractCegarLoop]: Abstraction has 34223 states and 183033 transitions. [2020-10-11 15:15:13,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:15:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 34223 states and 183033 transitions. [2020-10-11 15:15:13,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:15:13,065 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:13,065 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:13,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2020-10-11 15:15:13,065 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:15:13,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:13,065 INFO L82 PathProgramCache]: Analyzing trace with hash -617778328, now seen corresponding path program 2 times [2020-10-11 15:15:13,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:13,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400727807] [2020-10-11 15:15:13,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:15:13,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400727807] [2020-10-11 15:15:13,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:15:13,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:15:13,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037229699] [2020-10-11 15:15:13,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:15:13,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:13,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:15:13,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:15:13,099 INFO L87 Difference]: Start difference. First operand 34223 states and 183033 transitions. Second operand 7 states. [2020-10-11 15:15:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:13,726 INFO L93 Difference]: Finished difference Result 80887 states and 388540 transitions. [2020-10-11 15:15:13,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:15:13,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-11 15:15:13,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:13,959 INFO L225 Difference]: With dead ends: 80887 [2020-10-11 15:15:13,960 INFO L226 Difference]: Without dead ends: 80832 [2020-10-11 15:15:13,960 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:15:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80832 states. [2020-10-11 15:15:15,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80832 to 34508. [2020-10-11 15:15:15,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34508 states. [2020-10-11 15:15:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34508 states to 34508 states and 184670 transitions. [2020-10-11 15:15:15,918 INFO L78 Accepts]: Start accepts. Automaton has 34508 states and 184670 transitions. Word has length 23 [2020-10-11 15:15:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:15,918 INFO L481 AbstractCegarLoop]: Abstraction has 34508 states and 184670 transitions. [2020-10-11 15:15:15,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:15:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 34508 states and 184670 transitions. [2020-10-11 15:15:15,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:15:15,920 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:15,920 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:15,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2020-10-11 15:15:15,920 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:15:15,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:15,921 INFO L82 PathProgramCache]: Analyzing trace with hash -617756256, now seen corresponding path program 1 times [2020-10-11 15:15:15,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:15,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907823991] [2020-10-11 15:15:15,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:15,952 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:15:15,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907823991] [2020-10-11 15:15:15,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:15:15,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:15:15,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927918183] [2020-10-11 15:15:15,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:15:15,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:15,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:15:15,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:15:15,954 INFO L87 Difference]: Start difference. First operand 34508 states and 184670 transitions. Second operand 7 states. [2020-10-11 15:15:16,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:16,649 INFO L93 Difference]: Finished difference Result 83313 states and 401031 transitions. [2020-10-11 15:15:16,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:15:16,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-11 15:15:16,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:16,923 INFO L225 Difference]: With dead ends: 83313 [2020-10-11 15:15:16,923 INFO L226 Difference]: Without dead ends: 83258 [2020-10-11 15:15:16,923 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:15:18,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83258 states. [2020-10-11 15:15:19,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83258 to 36258. [2020-10-11 15:15:19,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36258 states. [2020-10-11 15:15:19,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36258 states to 36258 states and 193887 transitions. [2020-10-11 15:15:19,432 INFO L78 Accepts]: Start accepts. Automaton has 36258 states and 193887 transitions. Word has length 23 [2020-10-11 15:15:19,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:19,432 INFO L481 AbstractCegarLoop]: Abstraction has 36258 states and 193887 transitions. [2020-10-11 15:15:19,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:15:19,432 INFO L276 IsEmpty]: Start isEmpty. Operand 36258 states and 193887 transitions. [2020-10-11 15:15:19,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 15:15:19,434 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:19,434 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:19,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2020-10-11 15:15:19,435 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:15:19,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:19,435 INFO L82 PathProgramCache]: Analyzing trace with hash -581716896, now seen corresponding path program 2 times [2020-10-11 15:15:19,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:19,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119846340] [2020-10-11 15:15:19,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:15:19,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119846340] [2020-10-11 15:15:19,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:15:19,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:15:19,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294189151] [2020-10-11 15:15:19,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:15:19,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:19,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:15:19,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:15:19,467 INFO L87 Difference]: Start difference. First operand 36258 states and 193887 transitions. Second operand 7 states. [2020-10-11 15:15:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:20,136 INFO L93 Difference]: Finished difference Result 84364 states and 406246 transitions. [2020-10-11 15:15:20,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:15:20,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-11 15:15:20,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:20,397 INFO L225 Difference]: With dead ends: 84364 [2020-10-11 15:15:20,397 INFO L226 Difference]: Without dead ends: 84309 [2020-10-11 15:15:20,397 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:15:21,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84309 states. [2020-10-11 15:15:22,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84309 to 37062. [2020-10-11 15:15:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37062 states. [2020-10-11 15:15:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37062 states to 37062 states and 198528 transitions. [2020-10-11 15:15:22,455 INFO L78 Accepts]: Start accepts. Automaton has 37062 states and 198528 transitions. Word has length 23 [2020-10-11 15:15:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:22,455 INFO L481 AbstractCegarLoop]: Abstraction has 37062 states and 198528 transitions. [2020-10-11 15:15:22,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:15:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 37062 states and 198528 transitions. [2020-10-11 15:15:22,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:15:22,458 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:22,458 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:22,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2020-10-11 15:15:22,459 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:15:22,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:22,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1745706838, now seen corresponding path program 1 times [2020-10-11 15:15:22,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:22,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389443308] [2020-10-11 15:15:22,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:22,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389443308] [2020-10-11 15:15:22,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384276892] [2020-10-11 15:15:22,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:22,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:15:22,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:22,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:22,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:15:22,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990712603] [2020-10-11 15:15:22,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:15:22,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:22,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:15:22,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:15:22,621 INFO L87 Difference]: Start difference. First operand 37062 states and 198528 transitions. Second operand 11 states. [2020-10-11 15:15:23,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:23,860 INFO L93 Difference]: Finished difference Result 122892 states and 561130 transitions. [2020-10-11 15:15:23,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:15:23,861 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:15:23,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:24,195 INFO L225 Difference]: With dead ends: 122892 [2020-10-11 15:15:24,196 INFO L226 Difference]: Without dead ends: 122862 [2020-10-11 15:15:24,196 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:15:25,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122862 states. [2020-10-11 15:15:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122862 to 36735. [2020-10-11 15:15:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36735 states. [2020-10-11 15:15:27,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36735 states to 36735 states and 196486 transitions. [2020-10-11 15:15:27,577 INFO L78 Accepts]: Start accepts. Automaton has 36735 states and 196486 transitions. Word has length 25 [2020-10-11 15:15:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:27,577 INFO L481 AbstractCegarLoop]: Abstraction has 36735 states and 196486 transitions. [2020-10-11 15:15:27,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:15:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 36735 states and 196486 transitions. [2020-10-11 15:15:27,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:15:27,580 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:27,580 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:27,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2020-10-11 15:15:27,781 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:15:27,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:27,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1730856598, now seen corresponding path program 2 times [2020-10-11 15:15:27,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:27,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563856692] [2020-10-11 15:15:27,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:27,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:27,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563856692] [2020-10-11 15:15:27,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341353676] [2020-10-11 15:15:27,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:27,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:15:27,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:15:27,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:15:27,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:27,936 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:27,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:27,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:15:27,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250111029] [2020-10-11 15:15:27,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:15:27,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:27,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:15:27,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:15:27,937 INFO L87 Difference]: Start difference. First operand 36735 states and 196486 transitions. Second operand 11 states. [2020-10-11 15:15:29,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:29,165 INFO L93 Difference]: Finished difference Result 121506 states and 554103 transitions. [2020-10-11 15:15:29,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:15:29,165 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:15:29,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:29,503 INFO L225 Difference]: With dead ends: 121506 [2020-10-11 15:15:29,503 INFO L226 Difference]: Without dead ends: 121473 [2020-10-11 15:15:29,503 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:15:30,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121473 states. [2020-10-11 15:15:32,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121473 to 36666. [2020-10-11 15:15:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36666 states. [2020-10-11 15:15:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36666 states to 36666 states and 195964 transitions. [2020-10-11 15:15:32,175 INFO L78 Accepts]: Start accepts. Automaton has 36666 states and 195964 transitions. Word has length 25 [2020-10-11 15:15:32,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:32,176 INFO L481 AbstractCegarLoop]: Abstraction has 36666 states and 195964 transitions. [2020-10-11 15:15:32,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:15:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 36666 states and 195964 transitions. [2020-10-11 15:15:32,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:15:32,180 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:32,180 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:32,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:32,381 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:15:32,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:32,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1730878670, now seen corresponding path program 1 times [2020-10-11 15:15:32,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:32,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991579549] [2020-10-11 15:15:32,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:32,429 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:32,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991579549] [2020-10-11 15:15:32,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813994205] [2020-10-11 15:15:32,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:32,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:15:32,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:32,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:32,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:15:32,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604891086] [2020-10-11 15:15:32,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:15:32,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:32,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:15:32,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:15:32,538 INFO L87 Difference]: Start difference. First operand 36666 states and 195964 transitions. Second operand 11 states. [2020-10-11 15:15:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:33,724 INFO L93 Difference]: Finished difference Result 120500 states and 549397 transitions. [2020-10-11 15:15:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:15:33,724 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:15:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:34,070 INFO L225 Difference]: With dead ends: 120500 [2020-10-11 15:15:34,070 INFO L226 Difference]: Without dead ends: 120470 [2020-10-11 15:15:34,070 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:15:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120470 states. [2020-10-11 15:15:37,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120470 to 36343. [2020-10-11 15:15:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36343 states. [2020-10-11 15:15:37,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36343 states to 36343 states and 194056 transitions. [2020-10-11 15:15:37,347 INFO L78 Accepts]: Start accepts. Automaton has 36343 states and 194056 transitions. Word has length 25 [2020-10-11 15:15:37,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:37,347 INFO L481 AbstractCegarLoop]: Abstraction has 36343 states and 194056 transitions. [2020-10-11 15:15:37,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:15:37,347 INFO L276 IsEmpty]: Start isEmpty. Operand 36343 states and 194056 transitions. [2020-10-11 15:15:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:15:37,350 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:37,350 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:37,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2020-10-11 15:15:37,550 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:15:37,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:37,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1766918030, now seen corresponding path program 2 times [2020-10-11 15:15:37,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:37,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669229151] [2020-10-11 15:15:37,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:37,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:37,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669229151] [2020-10-11 15:15:37,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121069217] [2020-10-11 15:15:37,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:37,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:15:37,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:15:37,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:15:37,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:15:37,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:37,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:15:37,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561625077] [2020-10-11 15:15:37,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:15:37,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:37,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:15:37,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:15:37,722 INFO L87 Difference]: Start difference. First operand 36343 states and 194056 transitions. Second operand 11 states. [2020-10-11 15:15:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:38,921 INFO L93 Difference]: Finished difference Result 119731 states and 545560 transitions. [2020-10-11 15:15:38,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:15:38,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:15:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:39,266 INFO L225 Difference]: With dead ends: 119731 [2020-10-11 15:15:39,267 INFO L226 Difference]: Without dead ends: 119698 [2020-10-11 15:15:39,267 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:15:40,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119698 states. [2020-10-11 15:15:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119698 to 36040. [2020-10-11 15:15:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36040 states. [2020-10-11 15:15:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36040 states to 36040 states and 192287 transitions. [2020-10-11 15:15:41,871 INFO L78 Accepts]: Start accepts. Automaton has 36040 states and 192287 transitions. Word has length 25 [2020-10-11 15:15:41,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:41,871 INFO L481 AbstractCegarLoop]: Abstraction has 36040 states and 192287 transitions. [2020-10-11 15:15:41,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:15:41,871 INFO L276 IsEmpty]: Start isEmpty. Operand 36040 states and 192287 transitions. [2020-10-11 15:15:41,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:15:41,873 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:41,873 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:42,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:42,074 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:15:42,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:42,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1849107924, now seen corresponding path program 3 times [2020-10-11 15:15:42,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:42,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742196101] [2020-10-11 15:15:42,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:42,123 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:42,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742196101] [2020-10-11 15:15:42,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053052653] [2020-10-11 15:15:42,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:42,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-11 15:15:42,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:15:42,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:15:42,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:42,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:42,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:42,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:15:42,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765365664] [2020-10-11 15:15:42,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:15:42,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:42,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:15:42,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:15:42,230 INFO L87 Difference]: Start difference. First operand 36040 states and 192287 transitions. Second operand 11 states. [2020-10-11 15:15:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:43,389 INFO L93 Difference]: Finished difference Result 119762 states and 545615 transitions. [2020-10-11 15:15:43,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:15:43,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:15:43,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:43,728 INFO L225 Difference]: With dead ends: 119762 [2020-10-11 15:15:43,729 INFO L226 Difference]: Without dead ends: 119732 [2020-10-11 15:15:43,729 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:15:44,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119732 states. [2020-10-11 15:15:46,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119732 to 35475. [2020-10-11 15:15:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35475 states. [2020-10-11 15:15:46,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35475 states to 35475 states and 189246 transitions. [2020-10-11 15:15:46,930 INFO L78 Accepts]: Start accepts. Automaton has 35475 states and 189246 transitions. Word has length 25 [2020-10-11 15:15:46,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:46,931 INFO L481 AbstractCegarLoop]: Abstraction has 35475 states and 189246 transitions. [2020-10-11 15:15:46,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:15:46,931 INFO L276 IsEmpty]: Start isEmpty. Operand 35475 states and 189246 transitions. [2020-10-11 15:15:46,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:15:46,933 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:46,933 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:47,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2020-10-11 15:15:47,134 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:15:47,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:47,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1177775680, now seen corresponding path program 4 times [2020-10-11 15:15:47,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:47,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457199223] [2020-10-11 15:15:47,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:47,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457199223] [2020-10-11 15:15:47,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509618760] [2020-10-11 15:15:47,183 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:47,270 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:15:47,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:15:47,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:15:47,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:47,296 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:47,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:47,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:15:47,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703070984] [2020-10-11 15:15:47,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:15:47,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:47,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:15:47,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:15:47,298 INFO L87 Difference]: Start difference. First operand 35475 states and 189246 transitions. Second operand 11 states. [2020-10-11 15:15:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:48,502 INFO L93 Difference]: Finished difference Result 120788 states and 550630 transitions. [2020-10-11 15:15:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:15:48,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:15:48,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:48,853 INFO L225 Difference]: With dead ends: 120788 [2020-10-11 15:15:48,853 INFO L226 Difference]: Without dead ends: 120755 [2020-10-11 15:15:48,854 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:15:50,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120755 states. [2020-10-11 15:15:51,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120755 to 35406. [2020-10-11 15:15:51,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35406 states. [2020-10-11 15:15:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35406 states to 35406 states and 188724 transitions. [2020-10-11 15:15:51,475 INFO L78 Accepts]: Start accepts. Automaton has 35406 states and 188724 transitions. Word has length 25 [2020-10-11 15:15:51,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:51,475 INFO L481 AbstractCegarLoop]: Abstraction has 35406 states and 188724 transitions. [2020-10-11 15:15:51,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:15:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 35406 states and 188724 transitions. [2020-10-11 15:15:51,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:15:51,478 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:51,478 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:51,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2020-10-11 15:15:51,679 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:15:51,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:51,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1177752213, now seen corresponding path program 1 times [2020-10-11 15:15:51,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:51,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080498165] [2020-10-11 15:15:51,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:51,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:51,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080498165] [2020-10-11 15:15:51,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386344656] [2020-10-11 15:15:51,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:51,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:15:51,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:51,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:51,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:15:51,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131639254] [2020-10-11 15:15:51,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:15:51,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:51,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:15:51,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:15:51,839 INFO L87 Difference]: Start difference. First operand 35406 states and 188724 transitions. Second operand 11 states. [2020-10-11 15:15:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:53,100 INFO L93 Difference]: Finished difference Result 120291 states and 549128 transitions. [2020-10-11 15:15:53,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:15:53,101 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:15:53,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:53,477 INFO L225 Difference]: With dead ends: 120291 [2020-10-11 15:15:53,478 INFO L226 Difference]: Without dead ends: 120261 [2020-10-11 15:15:53,478 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:15:55,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120261 states. [2020-10-11 15:15:56,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120261 to 35196. [2020-10-11 15:15:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35196 states. [2020-10-11 15:15:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35196 states to 35196 states and 187476 transitions. [2020-10-11 15:15:56,619 INFO L78 Accepts]: Start accepts. Automaton has 35196 states and 187476 transitions. Word has length 25 [2020-10-11 15:15:56,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:15:56,619 INFO L481 AbstractCegarLoop]: Abstraction has 35196 states and 187476 transitions. [2020-10-11 15:15:56,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:15:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 35196 states and 187476 transitions. [2020-10-11 15:15:56,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:15:56,621 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:15:56,621 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:15:56,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:56,822 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:15:56,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:15:56,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1141712853, now seen corresponding path program 2 times [2020-10-11 15:15:56,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:15:56,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022518095] [2020-10-11 15:15:56,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:15:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:15:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:56,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022518095] [2020-10-11 15:15:56,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566648255] [2020-10-11 15:15:56,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:15:56,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:15:56,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:15:56,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:15:56,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:15:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:15:56,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:15:56,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:15:56,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58964372] [2020-10-11 15:15:56,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:15:56,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:15:56,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:15:56,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:15:56,977 INFO L87 Difference]: Start difference. First operand 35196 states and 187476 transitions. Second operand 11 states. [2020-10-11 15:15:58,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:15:58,121 INFO L93 Difference]: Finished difference Result 119264 states and 544110 transitions. [2020-10-11 15:15:58,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:15:58,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-11 15:15:58,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:15:58,479 INFO L225 Difference]: With dead ends: 119264 [2020-10-11 15:15:58,479 INFO L226 Difference]: Without dead ends: 119224 [2020-10-11 15:15:58,480 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:15:59,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119224 states. [2020-10-11 15:16:00,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119224 to 34815. [2020-10-11 15:16:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34815 states. [2020-10-11 15:16:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34815 states to 34815 states and 185342 transitions. [2020-10-11 15:16:01,036 INFO L78 Accepts]: Start accepts. Automaton has 34815 states and 185342 transitions. Word has length 25 [2020-10-11 15:16:01,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:01,036 INFO L481 AbstractCegarLoop]: Abstraction has 34815 states and 185342 transitions. [2020-10-11 15:16:01,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:16:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 34815 states and 185342 transitions. [2020-10-11 15:16:01,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:01,039 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:01,039 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:01,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2020-10-11 15:16:01,247 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:16:01,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:01,247 INFO L82 PathProgramCache]: Analyzing trace with hash -980827488, now seen corresponding path program 5 times [2020-10-11 15:16:01,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:01,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004626676] [2020-10-11 15:16:01,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:01,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004626676] [2020-10-11 15:16:01,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:01,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:01,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311597818] [2020-10-11 15:16:01,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:01,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:01,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:01,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:01,297 INFO L87 Difference]: Start difference. First operand 34815 states and 185342 transitions. Second operand 9 states. [2020-10-11 15:16:02,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:02,423 INFO L93 Difference]: Finished difference Result 119116 states and 542590 transitions. [2020-10-11 15:16:02,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:02,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:02,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:02,798 INFO L225 Difference]: With dead ends: 119116 [2020-10-11 15:16:02,799 INFO L226 Difference]: Without dead ends: 119086 [2020-10-11 15:16:02,799 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:04,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119086 states. [2020-10-11 15:16:05,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119086 to 34044. [2020-10-11 15:16:05,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34044 states. [2020-10-11 15:16:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34044 states to 34044 states and 181257 transitions. [2020-10-11 15:16:05,936 INFO L78 Accepts]: Start accepts. Automaton has 34044 states and 181257 transitions. Word has length 25 [2020-10-11 15:16:05,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:05,937 INFO L481 AbstractCegarLoop]: Abstraction has 34044 states and 181257 transitions. [2020-10-11 15:16:05,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:05,937 INFO L276 IsEmpty]: Start isEmpty. Operand 34044 states and 181257 transitions. [2020-10-11 15:16:05,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:05,939 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:05,939 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:05,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2020-10-11 15:16:05,940 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:16:05,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:05,940 INFO L82 PathProgramCache]: Analyzing trace with hash -980805416, now seen corresponding path program 3 times [2020-10-11 15:16:05,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:05,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693550394] [2020-10-11 15:16:05,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:05,998 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:05,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693550394] [2020-10-11 15:16:05,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:05,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:05,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567867074] [2020-10-11 15:16:05,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:05,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:05,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:06,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:06,000 INFO L87 Difference]: Start difference. First operand 34044 states and 181257 transitions. Second operand 9 states. [2020-10-11 15:16:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:07,172 INFO L93 Difference]: Finished difference Result 118392 states and 539774 transitions. [2020-10-11 15:16:07,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:07,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:07,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:07,524 INFO L225 Difference]: With dead ends: 118392 [2020-10-11 15:16:07,524 INFO L226 Difference]: Without dead ends: 118362 [2020-10-11 15:16:07,524 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:08,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118362 states. [2020-10-11 15:16:09,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118362 to 33530. [2020-10-11 15:16:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33530 states. [2020-10-11 15:16:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33530 states to 33530 states and 178563 transitions. [2020-10-11 15:16:10,081 INFO L78 Accepts]: Start accepts. Automaton has 33530 states and 178563 transitions. Word has length 25 [2020-10-11 15:16:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:10,081 INFO L481 AbstractCegarLoop]: Abstraction has 33530 states and 178563 transitions. [2020-10-11 15:16:10,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:10,081 INFO L276 IsEmpty]: Start isEmpty. Operand 33530 states and 178563 transitions. [2020-10-11 15:16:10,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:10,083 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:10,084 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:10,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2020-10-11 15:16:10,084 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:16:10,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:10,084 INFO L82 PathProgramCache]: Analyzing trace with hash -979488288, now seen corresponding path program 6 times [2020-10-11 15:16:10,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:10,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314346028] [2020-10-11 15:16:10,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:10,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314346028] [2020-10-11 15:16:10,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:10,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:10,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067702151] [2020-10-11 15:16:10,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:10,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:10,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:10,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:10,135 INFO L87 Difference]: Start difference. First operand 33530 states and 178563 transitions. Second operand 9 states. [2020-10-11 15:16:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:11,269 INFO L93 Difference]: Finished difference Result 116966 states and 531912 transitions. [2020-10-11 15:16:11,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:11,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:11,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:11,637 INFO L225 Difference]: With dead ends: 116966 [2020-10-11 15:16:11,637 INFO L226 Difference]: Without dead ends: 116926 [2020-10-11 15:16:11,637 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:12,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116926 states. [2020-10-11 15:16:14,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116926 to 32557. [2020-10-11 15:16:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32557 states. [2020-10-11 15:16:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32557 states to 32557 states and 173592 transitions. [2020-10-11 15:16:14,732 INFO L78 Accepts]: Start accepts. Automaton has 32557 states and 173592 transitions. Word has length 25 [2020-10-11 15:16:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:14,733 INFO L481 AbstractCegarLoop]: Abstraction has 32557 states and 173592 transitions. [2020-10-11 15:16:14,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 32557 states and 173592 transitions. [2020-10-11 15:16:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:14,735 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:14,735 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:14,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2020-10-11 15:16:14,735 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:16:14,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:14,735 INFO L82 PathProgramCache]: Analyzing trace with hash -979464821, now seen corresponding path program 3 times [2020-10-11 15:16:14,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:14,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139835602] [2020-10-11 15:16:14,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:14,784 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:14,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139835602] [2020-10-11 15:16:14,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:14,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:14,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376961957] [2020-10-11 15:16:14,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:14,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:14,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:14,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:14,786 INFO L87 Difference]: Start difference. First operand 32557 states and 173592 transitions. Second operand 9 states. [2020-10-11 15:16:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:15,912 INFO L93 Difference]: Finished difference Result 116421 states and 530054 transitions. [2020-10-11 15:16:15,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:15,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:15,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:16,249 INFO L225 Difference]: With dead ends: 116421 [2020-10-11 15:16:16,252 INFO L226 Difference]: Without dead ends: 116391 [2020-10-11 15:16:16,252 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:17,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116391 states. [2020-10-11 15:16:18,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116391 to 32226. [2020-10-11 15:16:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32226 states. [2020-10-11 15:16:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32226 states to 32226 states and 171898 transitions. [2020-10-11 15:16:18,708 INFO L78 Accepts]: Start accepts. Automaton has 32226 states and 171898 transitions. Word has length 25 [2020-10-11 15:16:18,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:18,708 INFO L481 AbstractCegarLoop]: Abstraction has 32226 states and 171898 transitions. [2020-10-11 15:16:18,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 32226 states and 171898 transitions. [2020-10-11 15:16:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:18,711 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:18,711 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:18,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2020-10-11 15:16:18,711 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:16:18,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash -958277096, now seen corresponding path program 4 times [2020-10-11 15:16:18,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:18,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339541159] [2020-10-11 15:16:18,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:18,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339541159] [2020-10-11 15:16:18,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:18,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:18,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832975417] [2020-10-11 15:16:18,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:18,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:18,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:18,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:18,766 INFO L87 Difference]: Start difference. First operand 32226 states and 171898 transitions. Second operand 9 states. [2020-10-11 15:16:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:19,960 INFO L93 Difference]: Finished difference Result 116502 states and 530595 transitions. [2020-10-11 15:16:19,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:19,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:19,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:20,291 INFO L225 Difference]: With dead ends: 116502 [2020-10-11 15:16:20,291 INFO L226 Difference]: Without dead ends: 116462 [2020-10-11 15:16:20,292 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116462 states. [2020-10-11 15:16:23,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116462 to 32188. [2020-10-11 15:16:23,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32188 states. [2020-10-11 15:16:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32188 states to 32188 states and 171558 transitions. [2020-10-11 15:16:23,364 INFO L78 Accepts]: Start accepts. Automaton has 32188 states and 171558 transitions. Word has length 25 [2020-10-11 15:16:23,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:23,364 INFO L481 AbstractCegarLoop]: Abstraction has 32188 states and 171558 transitions. [2020-10-11 15:16:23,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 32188 states and 171558 transitions. [2020-10-11 15:16:23,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:23,367 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:23,367 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:23,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2020-10-11 15:16:23,368 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:16:23,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:23,368 INFO L82 PathProgramCache]: Analyzing trace with hash -958275701, now seen corresponding path program 4 times [2020-10-11 15:16:23,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:23,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848005897] [2020-10-11 15:16:23,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:23,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848005897] [2020-10-11 15:16:23,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:23,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:23,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898260875] [2020-10-11 15:16:23,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:23,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:23,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:23,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:23,412 INFO L87 Difference]: Start difference. First operand 32188 states and 171558 transitions. Second operand 9 states. [2020-10-11 15:16:24,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:24,647 INFO L93 Difference]: Finished difference Result 115555 states and 526107 transitions. [2020-10-11 15:16:24,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:24,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:24,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:24,968 INFO L225 Difference]: With dead ends: 115555 [2020-10-11 15:16:24,968 INFO L226 Difference]: Without dead ends: 115515 [2020-10-11 15:16:24,968 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:26,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115515 states. [2020-10-11 15:16:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115515 to 31998. [2020-10-11 15:16:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31998 states. [2020-10-11 15:16:27,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31998 states to 31998 states and 170450 transitions. [2020-10-11 15:16:27,441 INFO L78 Accepts]: Start accepts. Automaton has 31998 states and 170450 transitions. Word has length 25 [2020-10-11 15:16:27,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:27,441 INFO L481 AbstractCegarLoop]: Abstraction has 31998 states and 170450 transitions. [2020-10-11 15:16:27,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:27,441 INFO L276 IsEmpty]: Start isEmpty. Operand 31998 states and 170450 transitions. [2020-10-11 15:16:27,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:27,443 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:27,443 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:27,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2020-10-11 15:16:27,444 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:16:27,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:27,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1698987747, now seen corresponding path program 1 times [2020-10-11 15:16:27,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:27,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439985285] [2020-10-11 15:16:27,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:27,462 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:16:27,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439985285] [2020-10-11 15:16:27,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:27,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:16:27,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688760799] [2020-10-11 15:16:27,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:16:27,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:27,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:16:27,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:16:27,463 INFO L87 Difference]: Start difference. First operand 31998 states and 170450 transitions. Second operand 5 states. [2020-10-11 15:16:27,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:27,847 INFO L93 Difference]: Finished difference Result 56734 states and 290623 transitions. [2020-10-11 15:16:27,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:16:27,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-10-11 15:16:27,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:28,007 INFO L225 Difference]: With dead ends: 56734 [2020-10-11 15:16:28,007 INFO L226 Difference]: Without dead ends: 56671 [2020-10-11 15:16:28,008 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:16:28,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56671 states. [2020-10-11 15:16:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56671 to 40400. [2020-10-11 15:16:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40400 states. [2020-10-11 15:16:29,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40400 states to 40400 states and 215336 transitions. [2020-10-11 15:16:29,740 INFO L78 Accepts]: Start accepts. Automaton has 40400 states and 215336 transitions. Word has length 25 [2020-10-11 15:16:29,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:29,740 INFO L481 AbstractCegarLoop]: Abstraction has 40400 states and 215336 transitions. [2020-10-11 15:16:29,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:16:29,740 INFO L276 IsEmpty]: Start isEmpty. Operand 40400 states and 215336 transitions. [2020-10-11 15:16:29,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:29,743 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:29,743 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:29,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2020-10-11 15:16:29,743 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:16:29,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:29,743 INFO L82 PathProgramCache]: Analyzing trace with hash -670679464, now seen corresponding path program 5 times [2020-10-11 15:16:29,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:29,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543041435] [2020-10-11 15:16:29,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:29,793 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:29,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543041435] [2020-10-11 15:16:29,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:29,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:29,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794740100] [2020-10-11 15:16:29,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:29,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:29,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:29,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:29,795 INFO L87 Difference]: Start difference. First operand 40400 states and 215336 transitions. Second operand 9 states. [2020-10-11 15:16:31,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:31,631 INFO L93 Difference]: Finished difference Result 137449 states and 636138 transitions. [2020-10-11 15:16:31,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:31,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:31,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:32,017 INFO L225 Difference]: With dead ends: 137449 [2020-10-11 15:16:32,017 INFO L226 Difference]: Without dead ends: 137407 [2020-10-11 15:16:32,017 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:33,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137407 states. [2020-10-11 15:16:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137407 to 39840. [2020-10-11 15:16:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39840 states. [2020-10-11 15:16:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39840 states to 39840 states and 212294 transitions. [2020-10-11 15:16:35,018 INFO L78 Accepts]: Start accepts. Automaton has 39840 states and 212294 transitions. Word has length 25 [2020-10-11 15:16:35,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:35,018 INFO L481 AbstractCegarLoop]: Abstraction has 39840 states and 212294 transitions. [2020-10-11 15:16:35,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:35,018 INFO L276 IsEmpty]: Start isEmpty. Operand 39840 states and 212294 transitions. [2020-10-11 15:16:35,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:35,020 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:35,020 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:35,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2020-10-11 15:16:35,021 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:16:35,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:35,021 INFO L82 PathProgramCache]: Analyzing trace with hash -669338869, now seen corresponding path program 5 times [2020-10-11 15:16:35,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:35,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601598817] [2020-10-11 15:16:35,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:35,076 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:35,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601598817] [2020-10-11 15:16:35,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:35,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:35,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774707997] [2020-10-11 15:16:35,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:35,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:35,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:35,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:35,078 INFO L87 Difference]: Start difference. First operand 39840 states and 212294 transitions. Second operand 9 states. [2020-10-11 15:16:36,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:36,331 INFO L93 Difference]: Finished difference Result 136260 states and 629977 transitions. [2020-10-11 15:16:36,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:36,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:36,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:36,714 INFO L225 Difference]: With dead ends: 136260 [2020-10-11 15:16:36,714 INFO L226 Difference]: Without dead ends: 136218 [2020-10-11 15:16:36,717 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:38,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136218 states. [2020-10-11 15:16:39,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136218 to 39457. [2020-10-11 15:16:39,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39457 states. [2020-10-11 15:16:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39457 states to 39457 states and 210241 transitions. [2020-10-11 15:16:39,788 INFO L78 Accepts]: Start accepts. Automaton has 39457 states and 210241 transitions. Word has length 25 [2020-10-11 15:16:39,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:39,788 INFO L481 AbstractCegarLoop]: Abstraction has 39457 states and 210241 transitions. [2020-10-11 15:16:39,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:39,788 INFO L276 IsEmpty]: Start isEmpty. Operand 39457 states and 210241 transitions. [2020-10-11 15:16:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:39,792 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:39,792 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:39,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2020-10-11 15:16:39,792 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:16:39,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:39,793 INFO L82 PathProgramCache]: Analyzing trace with hash -684190504, now seen corresponding path program 6 times [2020-10-11 15:16:39,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:39,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345306316] [2020-10-11 15:16:39,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:39,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345306316] [2020-10-11 15:16:39,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:39,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:39,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598029201] [2020-10-11 15:16:39,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:39,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:39,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:39,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:39,851 INFO L87 Difference]: Start difference. First operand 39457 states and 210241 transitions. Second operand 9 states. [2020-10-11 15:16:41,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:41,416 INFO L93 Difference]: Finished difference Result 135358 states and 625465 transitions. [2020-10-11 15:16:41,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:41,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:41,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:41,818 INFO L225 Difference]: With dead ends: 135358 [2020-10-11 15:16:41,818 INFO L226 Difference]: Without dead ends: 135306 [2020-10-11 15:16:41,819 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135306 states. [2020-10-11 15:16:44,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135306 to 38674. [2020-10-11 15:16:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38674 states. [2020-10-11 15:16:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38674 states to 38674 states and 206150 transitions. [2020-10-11 15:16:44,728 INFO L78 Accepts]: Start accepts. Automaton has 38674 states and 206150 transitions. Word has length 25 [2020-10-11 15:16:44,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:44,728 INFO L481 AbstractCegarLoop]: Abstraction has 38674 states and 206150 transitions. [2020-10-11 15:16:44,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 38674 states and 206150 transitions. [2020-10-11 15:16:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 15:16:44,730 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:44,730 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:44,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2020-10-11 15:16:44,731 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:16:44,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:44,731 INFO L82 PathProgramCache]: Analyzing trace with hash -684189109, now seen corresponding path program 6 times [2020-10-11 15:16:44,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:44,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813196756] [2020-10-11 15:16:44,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:16:44,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813196756] [2020-10-11 15:16:44,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:16:44,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:16:44,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781135867] [2020-10-11 15:16:44,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:44,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:44,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:44,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:44,780 INFO L87 Difference]: Start difference. First operand 38674 states and 206150 transitions. Second operand 9 states. [2020-10-11 15:16:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:46,034 INFO L93 Difference]: Finished difference Result 134089 states and 619317 transitions. [2020-10-11 15:16:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:16:46,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-11 15:16:46,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:46,436 INFO L225 Difference]: With dead ends: 134089 [2020-10-11 15:16:46,436 INFO L226 Difference]: Without dead ends: 134037 [2020-10-11 15:16:46,436 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:16:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134037 states. [2020-10-11 15:16:50,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134037 to 37675. [2020-10-11 15:16:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37675 states. [2020-10-11 15:16:50,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37675 states to 37675 states and 201015 transitions. [2020-10-11 15:16:50,155 INFO L78 Accepts]: Start accepts. Automaton has 37675 states and 201015 transitions. Word has length 25 [2020-10-11 15:16:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:50,155 INFO L481 AbstractCegarLoop]: Abstraction has 37675 states and 201015 transitions. [2020-10-11 15:16:50,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 37675 states and 201015 transitions. [2020-10-11 15:16:50,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:16:50,159 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:50,159 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:50,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2020-10-11 15:16:50,159 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:16:50,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:50,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1444696671, now seen corresponding path program 1 times [2020-10-11 15:16:50,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:50,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537206800] [2020-10-11 15:16:50,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:16:50,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537206800] [2020-10-11 15:16:50,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776301176] [2020-10-11 15:16:50,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:16:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:50,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:16:50,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:16:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:16:50,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:16:50,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:16:50,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037240370] [2020-10-11 15:16:50,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:16:50,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:50,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:16:50,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:16:50,294 INFO L87 Difference]: Start difference. First operand 37675 states and 201015 transitions. Second operand 9 states. [2020-10-11 15:16:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:50,970 INFO L93 Difference]: Finished difference Result 85349 states and 414605 transitions. [2020-10-11 15:16:50,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:16:50,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-11 15:16:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:51,229 INFO L225 Difference]: With dead ends: 85349 [2020-10-11 15:16:51,229 INFO L226 Difference]: Without dead ends: 85301 [2020-10-11 15:16:51,230 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:16:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85301 states. [2020-10-11 15:16:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85301 to 38836. [2020-10-11 15:16:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38836 states. [2020-10-11 15:16:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38836 states to 38836 states and 206710 transitions. [2020-10-11 15:16:53,347 INFO L78 Accepts]: Start accepts. Automaton has 38836 states and 206710 transitions. Word has length 27 [2020-10-11 15:16:53,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:16:53,347 INFO L481 AbstractCegarLoop]: Abstraction has 38836 states and 206710 transitions. [2020-10-11 15:16:53,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:16:53,347 INFO L276 IsEmpty]: Start isEmpty. Operand 38836 states and 206710 transitions. [2020-10-11 15:16:53,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:16:53,351 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:16:53,351 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:16:53,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable117 [2020-10-11 15:16:53,565 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:16:53,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:16:53,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1707919879, now seen corresponding path program 1 times [2020-10-11 15:16:53,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:16:53,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384312441] [2020-10-11 15:16:53,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:16:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:16:53,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384312441] [2020-10-11 15:16:53,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446480599] [2020-10-11 15:16:53,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:16:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:16:53,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:16:53,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:16:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:16:53,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:16:53,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:16:53,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219251278] [2020-10-11 15:16:53,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:16:53,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:16:53,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:16:53,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:16:53,740 INFO L87 Difference]: Start difference. First operand 38836 states and 206710 transitions. Second operand 13 states. [2020-10-11 15:16:56,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:16:56,222 INFO L93 Difference]: Finished difference Result 184520 states and 806691 transitions. [2020-10-11 15:16:56,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:16:56,223 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:16:56,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:16:56,739 INFO L225 Difference]: With dead ends: 184520 [2020-10-11 15:16:56,740 INFO L226 Difference]: Without dead ends: 184502 [2020-10-11 15:16:56,740 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1606 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:16:58,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184502 states. [2020-10-11 15:17:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184502 to 38937. [2020-10-11 15:17:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38937 states. [2020-10-11 15:17:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38937 states to 38937 states and 207195 transitions. [2020-10-11 15:17:01,424 INFO L78 Accepts]: Start accepts. Automaton has 38937 states and 207195 transitions. Word has length 27 [2020-10-11 15:17:01,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:17:01,424 INFO L481 AbstractCegarLoop]: Abstraction has 38937 states and 207195 transitions. [2020-10-11 15:17:01,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:17:01,424 INFO L276 IsEmpty]: Start isEmpty. Operand 38937 states and 207195 transitions. [2020-10-11 15:17:01,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:17:01,428 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:17:01,428 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:17:01,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2020-10-11 15:17:01,629 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:17:01,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:17:01,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1671880519, now seen corresponding path program 2 times [2020-10-11 15:17:01,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:17:01,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834742931] [2020-10-11 15:17:01,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:17:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:17:01,695 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:01,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834742931] [2020-10-11 15:17:01,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897116615] [2020-10-11 15:17:01,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:01,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:17:01,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:17:01,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:17:01,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:17:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:01,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:17:01,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:17:01,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746313719] [2020-10-11 15:17:01,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:17:01,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:17:01,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:17:01,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:17:01,804 INFO L87 Difference]: Start difference. First operand 38937 states and 207195 transitions. Second operand 13 states. [2020-10-11 15:17:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:17:04,326 INFO L93 Difference]: Finished difference Result 184111 states and 804949 transitions. [2020-10-11 15:17:04,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:17:04,326 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:17:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:17:04,850 INFO L225 Difference]: With dead ends: 184111 [2020-10-11 15:17:04,850 INFO L226 Difference]: Without dead ends: 184087 [2020-10-11 15:17:04,851 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:17:06,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184087 states. [2020-10-11 15:17:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184087 to 38705. [2020-10-11 15:17:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38705 states. [2020-10-11 15:17:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38705 states to 38705 states and 205959 transitions. [2020-10-11 15:17:09,886 INFO L78 Accepts]: Start accepts. Automaton has 38705 states and 205959 transitions. Word has length 27 [2020-10-11 15:17:09,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:17:09,886 INFO L481 AbstractCegarLoop]: Abstraction has 38705 states and 205959 transitions. [2020-10-11 15:17:09,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:17:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 38705 states and 205959 transitions. [2020-10-11 15:17:09,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:17:09,890 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:17:09,890 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:17:10,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:10,091 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:17:10,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:17:10,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1200868665, now seen corresponding path program 3 times [2020-10-11 15:17:10,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:17:10,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648897230] [2020-10-11 15:17:10,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:17:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:17:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:10,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648897230] [2020-10-11 15:17:10,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280980184] [2020-10-11 15:17:10,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:10,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-11 15:17:10,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:17:10,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:17:10,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:17:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:10,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:17:10,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:17:10,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686527599] [2020-10-11 15:17:10,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:17:10,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:17:10,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:17:10,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:17:10,260 INFO L87 Difference]: Start difference. First operand 38705 states and 205959 transitions. Second operand 13 states. [2020-10-11 15:17:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:17:12,714 INFO L93 Difference]: Finished difference Result 183485 states and 802028 transitions. [2020-10-11 15:17:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:17:12,715 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:17:12,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:17:13,197 INFO L225 Difference]: With dead ends: 183485 [2020-10-11 15:17:13,197 INFO L226 Difference]: Without dead ends: 183467 [2020-10-11 15:17:13,198 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1602 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:17:14,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183467 states. [2020-10-11 15:17:16,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183467 to 38802. [2020-10-11 15:17:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38802 states. [2020-10-11 15:17:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38802 states to 38802 states and 206432 transitions. [2020-10-11 15:17:17,016 INFO L78 Accepts]: Start accepts. Automaton has 38802 states and 206432 transitions. Word has length 27 [2020-10-11 15:17:17,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:17:17,017 INFO L481 AbstractCegarLoop]: Abstraction has 38802 states and 206432 transitions. [2020-10-11 15:17:17,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:17:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 38802 states and 206432 transitions. [2020-10-11 15:17:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:17:17,020 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:17:17,020 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:17:17,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:17,221 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:17:17,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:17:17,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1222057785, now seen corresponding path program 4 times [2020-10-11 15:17:17,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:17:17,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190789079] [2020-10-11 15:17:17,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:17:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:17:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:17,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190789079] [2020-10-11 15:17:17,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537778297] [2020-10-11 15:17:17,286 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:17,368 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:17:17,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:17:17,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:17:17,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:17:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:17,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:17:17,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:17:17,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464991254] [2020-10-11 15:17:17,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:17:17,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:17:17,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:17:17,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:17:17,391 INFO L87 Difference]: Start difference. First operand 38802 states and 206432 transitions. Second operand 13 states. [2020-10-11 15:17:20,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:17:20,563 INFO L93 Difference]: Finished difference Result 183194 states and 800691 transitions. [2020-10-11 15:17:20,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:17:20,563 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:17:20,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:17:21,053 INFO L225 Difference]: With dead ends: 183194 [2020-10-11 15:17:21,053 INFO L226 Difference]: Without dead ends: 183170 [2020-10-11 15:17:21,054 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1607 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:17:22,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183170 states. [2020-10-11 15:17:24,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183170 to 38578. [2020-10-11 15:17:24,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38578 states. [2020-10-11 15:17:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38578 states to 38578 states and 205224 transitions. [2020-10-11 15:17:24,758 INFO L78 Accepts]: Start accepts. Automaton has 38578 states and 205224 transitions. Word has length 27 [2020-10-11 15:17:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:17:24,758 INFO L481 AbstractCegarLoop]: Abstraction has 38578 states and 205224 transitions. [2020-10-11 15:17:24,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:17:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 38578 states and 205224 transitions. [2020-10-11 15:17:24,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:17:24,762 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:17:24,762 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:17:24,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:24,963 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:17:24,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:17:24,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1510994617, now seen corresponding path program 5 times [2020-10-11 15:17:24,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:17:24,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438234655] [2020-10-11 15:17:24,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:17:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:17:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:25,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438234655] [2020-10-11 15:17:25,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663003760] [2020-10-11 15:17:25,026 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:25,112 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-10-11 15:17:25,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:17:25,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:17:25,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:17:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:25,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:17:25,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:17:25,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339174586] [2020-10-11 15:17:25,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:17:25,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:17:25,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:17:25,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:17:25,139 INFO L87 Difference]: Start difference. First operand 38578 states and 205224 transitions. Second operand 13 states. [2020-10-11 15:17:27,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:17:27,783 INFO L93 Difference]: Finished difference Result 182584 states and 797818 transitions. [2020-10-11 15:17:27,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:17:27,783 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:17:27,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:17:28,262 INFO L225 Difference]: With dead ends: 182584 [2020-10-11 15:17:28,262 INFO L226 Difference]: Without dead ends: 182566 [2020-10-11 15:17:28,262 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:17:30,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182566 states. [2020-10-11 15:17:32,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182566 to 38683. [2020-10-11 15:17:32,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38683 states. [2020-10-11 15:17:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38683 states to 38683 states and 205717 transitions. [2020-10-11 15:17:32,717 INFO L78 Accepts]: Start accepts. Automaton has 38683 states and 205717 transitions. Word has length 27 [2020-10-11 15:17:32,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:17:32,717 INFO L481 AbstractCegarLoop]: Abstraction has 38683 states and 205717 transitions. [2020-10-11 15:17:32,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:17:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 38683 states and 205717 transitions. [2020-10-11 15:17:32,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:17:32,721 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:17:32,721 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:17:32,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2020-10-11 15:17:32,922 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:17:32,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:17:32,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1496144377, now seen corresponding path program 6 times [2020-10-11 15:17:32,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:17:32,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744740691] [2020-10-11 15:17:32,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:17:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:17:32,986 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:32,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744740691] [2020-10-11 15:17:32,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518597036] [2020-10-11 15:17:32,987 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:33,070 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2020-10-11 15:17:33,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:17:33,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:17:33,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:17:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-11 15:17:33,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:17:33,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:17:33,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956194235] [2020-10-11 15:17:33,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:17:33,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:17:33,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:17:33,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:17:33,093 INFO L87 Difference]: Start difference. First operand 38683 states and 205717 transitions. Second operand 13 states. [2020-10-11 15:17:35,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:17:35,518 INFO L93 Difference]: Finished difference Result 182167 states and 796056 transitions. [2020-10-11 15:17:35,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:17:35,519 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:17:35,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:17:36,003 INFO L225 Difference]: With dead ends: 182167 [2020-10-11 15:17:36,003 INFO L226 Difference]: Without dead ends: 182139 [2020-10-11 15:17:36,004 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1599 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:17:37,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182139 states. [2020-10-11 15:17:40,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182139 to 38439. [2020-10-11 15:17:40,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38439 states. [2020-10-11 15:17:40,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38439 states to 38439 states and 204452 transitions. [2020-10-11 15:17:40,662 INFO L78 Accepts]: Start accepts. Automaton has 38439 states and 204452 transitions. Word has length 27 [2020-10-11 15:17:40,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:17:40,662 INFO L481 AbstractCegarLoop]: Abstraction has 38439 states and 204452 transitions. [2020-10-11 15:17:40,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:17:40,662 INFO L276 IsEmpty]: Start isEmpty. Operand 38439 states and 204452 transitions. [2020-10-11 15:17:40,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:17:40,665 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:17:40,665 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:17:40,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2020-10-11 15:17:40,866 INFO L429 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:17:40,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:17:40,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1123724041, now seen corresponding path program 7 times [2020-10-11 15:17:40,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:17:40,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642500208] [2020-10-11 15:17:40,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:17:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:17:40,931 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:17:40,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642500208] [2020-10-11 15:17:40,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135237030] [2020-10-11 15:17:40,932 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:17:41,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:17:41,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:17:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:17:41,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:17:41,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:17:41,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562203706] [2020-10-11 15:17:41,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:17:41,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:17:41,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:17:41,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:17:41,043 INFO L87 Difference]: Start difference. First operand 38439 states and 204452 transitions. Second operand 13 states. [2020-10-11 15:17:43,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:17:43,502 INFO L93 Difference]: Finished difference Result 183258 states and 800935 transitions. [2020-10-11 15:17:43,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:17:43,503 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:17:43,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:17:44,001 INFO L225 Difference]: With dead ends: 183258 [2020-10-11 15:17:44,001 INFO L226 Difference]: Without dead ends: 183240 [2020-10-11 15:17:44,001 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1606 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:17:45,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183240 states. [2020-10-11 15:17:47,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183240 to 38278. [2020-10-11 15:17:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38278 states. [2020-10-11 15:17:47,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38278 states to 38278 states and 203659 transitions. [2020-10-11 15:17:47,789 INFO L78 Accepts]: Start accepts. Automaton has 38278 states and 203659 transitions. Word has length 27 [2020-10-11 15:17:47,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:17:47,789 INFO L481 AbstractCegarLoop]: Abstraction has 38278 states and 203659 transitions. [2020-10-11 15:17:47,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:17:47,789 INFO L276 IsEmpty]: Start isEmpty. Operand 38278 states and 203659 transitions. [2020-10-11 15:17:47,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:17:47,793 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:17:47,793 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:17:47,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2020-10-11 15:17:47,994 INFO L429 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:17:47,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:17:47,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1087684681, now seen corresponding path program 8 times [2020-10-11 15:17:47,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:17:47,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047531033] [2020-10-11 15:17:47,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:17:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:17:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:17:48,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047531033] [2020-10-11 15:17:48,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108030216] [2020-10-11 15:17:48,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:48,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:17:48,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:17:48,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:17:48,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:17:48,745 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:17:48,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:17:48,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:17:48,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143353694] [2020-10-11 15:17:48,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:17:48,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:17:48,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:17:48,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:17:48,747 INFO L87 Difference]: Start difference. First operand 38278 states and 203659 transitions. Second operand 13 states. [2020-10-11 15:17:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:17:51,319 INFO L93 Difference]: Finished difference Result 182849 states and 799193 transitions. [2020-10-11 15:17:51,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:17:51,320 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:17:51,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:17:51,804 INFO L225 Difference]: With dead ends: 182849 [2020-10-11 15:17:51,805 INFO L226 Difference]: Without dead ends: 182825 [2020-10-11 15:17:51,805 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:17:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182825 states. [2020-10-11 15:17:55,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182825 to 37884. [2020-10-11 15:17:55,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37884 states. [2020-10-11 15:17:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37884 states to 37884 states and 201622 transitions. [2020-10-11 15:17:55,589 INFO L78 Accepts]: Start accepts. Automaton has 37884 states and 201622 transitions. Word has length 27 [2020-10-11 15:17:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:17:55,589 INFO L481 AbstractCegarLoop]: Abstraction has 37884 states and 201622 transitions. [2020-10-11 15:17:55,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:17:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 37884 states and 201622 transitions. [2020-10-11 15:17:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:17:55,592 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:17:55,593 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:17:55,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2020-10-11 15:17:55,793 INFO L429 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:17:55,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:17:55,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2028959203, now seen corresponding path program 9 times [2020-10-11 15:17:55,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:17:55,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644489923] [2020-10-11 15:17:55,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:17:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:17:55,868 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:17:55,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644489923] [2020-10-11 15:17:55,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930598872] [2020-10-11 15:17:55,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:17:55,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-11 15:17:55,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:17:55,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:17:55,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:17:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:17:55,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:17:55,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:17:55,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916759933] [2020-10-11 15:17:55,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:17:55,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:17:55,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:17:55,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:17:55,975 INFO L87 Difference]: Start difference. First operand 37884 states and 201622 transitions. Second operand 13 states. [2020-10-11 15:17:59,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:17:59,132 INFO L93 Difference]: Finished difference Result 183773 states and 803153 transitions. [2020-10-11 15:17:59,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:17:59,132 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:17:59,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:17:59,637 INFO L225 Difference]: With dead ends: 183773 [2020-10-11 15:17:59,637 INFO L226 Difference]: Without dead ends: 183755 [2020-10-11 15:17:59,637 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1612 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:18:01,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183755 states. [2020-10-11 15:18:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183755 to 37981. [2020-10-11 15:18:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37981 states. [2020-10-11 15:18:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37981 states to 37981 states and 202095 transitions. [2020-10-11 15:18:03,382 INFO L78 Accepts]: Start accepts. Automaton has 37981 states and 202095 transitions. Word has length 27 [2020-10-11 15:18:03,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:18:03,382 INFO L481 AbstractCegarLoop]: Abstraction has 37981 states and 202095 transitions. [2020-10-11 15:18:03,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:18:03,382 INFO L276 IsEmpty]: Start isEmpty. Operand 37981 states and 202095 transitions. [2020-10-11 15:18:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:18:03,387 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:18:03,387 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:18:03,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126 [2020-10-11 15:18:03,601 INFO L429 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:18:03,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:18:03,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2051487523, now seen corresponding path program 10 times [2020-10-11 15:18:03,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:18:03,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397973706] [2020-10-11 15:18:03,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:18:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:03,671 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:18:03,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397973706] [2020-10-11 15:18:03,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915648482] [2020-10-11 15:18:03,671 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:18:03,753 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:18:03,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:18:03,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:18:03,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:18:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:18:03,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:18:03,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:18:03,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361600397] [2020-10-11 15:18:03,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:18:03,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:18:03,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:18:03,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:18:03,779 INFO L87 Difference]: Start difference. First operand 37981 states and 202095 transitions. Second operand 13 states. [2020-10-11 15:18:06,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:18:06,393 INFO L93 Difference]: Finished difference Result 184574 states and 806606 transitions. [2020-10-11 15:18:06,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:18:06,393 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:18:06,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:18:06,879 INFO L225 Difference]: With dead ends: 184574 [2020-10-11 15:18:06,879 INFO L226 Difference]: Without dead ends: 184550 [2020-10-11 15:18:06,880 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1612 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:18:09,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184550 states. [2020-10-11 15:18:11,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184550 to 37723. [2020-10-11 15:18:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37723 states. [2020-10-11 15:18:11,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37723 states to 37723 states and 200669 transitions. [2020-10-11 15:18:11,351 INFO L78 Accepts]: Start accepts. Automaton has 37723 states and 200669 transitions. Word has length 27 [2020-10-11 15:18:11,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:18:11,351 INFO L481 AbstractCegarLoop]: Abstraction has 37723 states and 200669 transitions. [2020-10-11 15:18:11,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:18:11,351 INFO L276 IsEmpty]: Start isEmpty. Operand 37723 states and 200669 transitions. [2020-10-11 15:18:11,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:18:11,355 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:18:11,355 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:18:11,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127,56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:18:11,561 INFO L429 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:18:11,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:18:11,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1310776872, now seen corresponding path program 1 times [2020-10-11 15:18:11,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:18:11,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061047245] [2020-10-11 15:18:11,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:18:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:18:11,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061047245] [2020-10-11 15:18:11,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704416074] [2020-10-11 15:18:11,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:18:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:11,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:18:11,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:18:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:18:11,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:18:11,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:18:11,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830583256] [2020-10-11 15:18:11,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:18:11,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:18:11,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:18:11,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:18:11,698 INFO L87 Difference]: Start difference. First operand 37723 states and 200669 transitions. Second operand 9 states. [2020-10-11 15:18:12,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:18:12,413 INFO L93 Difference]: Finished difference Result 87418 states and 424333 transitions. [2020-10-11 15:18:12,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:18:12,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-11 15:18:12,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:18:12,661 INFO L225 Difference]: With dead ends: 87418 [2020-10-11 15:18:12,661 INFO L226 Difference]: Without dead ends: 87366 [2020-10-11 15:18:12,662 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:18:13,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87366 states. [2020-10-11 15:18:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87366 to 39181. [2020-10-11 15:18:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39181 states. [2020-10-11 15:18:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39181 states to 39181 states and 208301 transitions. [2020-10-11 15:18:14,841 INFO L78 Accepts]: Start accepts. Automaton has 39181 states and 208301 transitions. Word has length 27 [2020-10-11 15:18:14,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:18:14,841 INFO L481 AbstractCegarLoop]: Abstraction has 39181 states and 208301 transitions. [2020-10-11 15:18:14,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:18:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 39181 states and 208301 transitions. [2020-10-11 15:18:14,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:18:14,845 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:18:14,845 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:18:15,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2020-10-11 15:18:15,046 INFO L429 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:18:15,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:18:15,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1955882141, now seen corresponding path program 11 times [2020-10-11 15:18:15,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:18:15,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737579319] [2020-10-11 15:18:15,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:18:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:18:15,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737579319] [2020-10-11 15:18:15,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177600329] [2020-10-11 15:18:15,113 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:18:15,197 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-10-11 15:18:15,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:18:15,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:18:15,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:18:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:18:15,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:18:15,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:18:15,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827994165] [2020-10-11 15:18:15,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:18:15,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:18:15,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:18:15,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:18:15,221 INFO L87 Difference]: Start difference. First operand 39181 states and 208301 transitions. Second operand 13 states. [2020-10-11 15:18:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:18:18,282 INFO L93 Difference]: Finished difference Result 181204 states and 790360 transitions. [2020-10-11 15:18:18,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:18:18,283 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:18:18,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:18:18,755 INFO L225 Difference]: With dead ends: 181204 [2020-10-11 15:18:18,756 INFO L226 Difference]: Without dead ends: 181186 [2020-10-11 15:18:18,756 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1592 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:18:20,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181186 states. [2020-10-11 15:18:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181186 to 39282. [2020-10-11 15:18:22,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39282 states. [2020-10-11 15:18:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39282 states to 39282 states and 208786 transitions. [2020-10-11 15:18:22,374 INFO L78 Accepts]: Start accepts. Automaton has 39282 states and 208786 transitions. Word has length 27 [2020-10-11 15:18:22,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:18:22,374 INFO L481 AbstractCegarLoop]: Abstraction has 39282 states and 208786 transitions. [2020-10-11 15:18:22,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:18:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 39282 states and 208786 transitions. [2020-10-11 15:18:22,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:18:22,378 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:18:22,378 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:18:22,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129,58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:18:22,578 INFO L429 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:18:22,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:18:22,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1969393181, now seen corresponding path program 12 times [2020-10-11 15:18:22,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:18:22,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66357626] [2020-10-11 15:18:22,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:18:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:22,645 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:18:22,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66357626] [2020-10-11 15:18:22,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481430514] [2020-10-11 15:18:22,646 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:18:22,729 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2020-10-11 15:18:22,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:18:22,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-11 15:18:22,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:18:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:18:22,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:18:22,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-11 15:18:22,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730948504] [2020-10-11 15:18:22,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 15:18:22,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:18:22,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 15:18:22,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 15:18:22,754 INFO L87 Difference]: Start difference. First operand 39282 states and 208786 transitions. Second operand 13 states. [2020-10-11 15:18:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:18:25,250 INFO L93 Difference]: Finished difference Result 181788 states and 792986 transitions. [2020-10-11 15:18:25,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:18:25,250 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-11 15:18:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:18:25,739 INFO L225 Difference]: With dead ends: 181788 [2020-10-11 15:18:25,740 INFO L226 Difference]: Without dead ends: 181760 [2020-10-11 15:18:25,740 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1606 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1001, Invalid=3969, Unknown=0, NotChecked=0, Total=4970 [2020-10-11 15:18:28,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181760 states. [2020-10-11 15:18:30,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181760 to 39046. [2020-10-11 15:18:30,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39046 states. [2020-10-11 15:18:30,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39046 states to 39046 states and 207541 transitions. [2020-10-11 15:18:30,178 INFO L78 Accepts]: Start accepts. Automaton has 39046 states and 207541 transitions. Word has length 27 [2020-10-11 15:18:30,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:18:30,178 INFO L481 AbstractCegarLoop]: Abstraction has 39046 states and 207541 transitions. [2020-10-11 15:18:30,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 15:18:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand 39046 states and 207541 transitions. [2020-10-11 15:18:30,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:18:30,183 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:18:30,184 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:18:30,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable130 [2020-10-11 15:18:30,399 INFO L429 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:18:30,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:18:30,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1977356605, now seen corresponding path program 13 times [2020-10-11 15:18:30,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:18:30,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515352646] [2020-10-11 15:18:30,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:18:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:18:30,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515352646] [2020-10-11 15:18:30,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:18:30,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:18:30,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330709063] [2020-10-11 15:18:30,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:18:30,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:18:30,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:18:30,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:18:30,472 INFO L87 Difference]: Start difference. First operand 39046 states and 207541 transitions. Second operand 11 states. [2020-10-11 15:18:32,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:18:32,939 INFO L93 Difference]: Finished difference Result 182119 states and 794828 transitions. [2020-10-11 15:18:32,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:18:32,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:18:32,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:18:33,444 INFO L225 Difference]: With dead ends: 182119 [2020-10-11 15:18:33,445 INFO L226 Difference]: Without dead ends: 182101 [2020-10-11 15:18:33,445 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1555 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:18:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182101 states. [2020-10-11 15:18:37,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182101 to 38885. [2020-10-11 15:18:37,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38885 states. [2020-10-11 15:18:38,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38885 states to 38885 states and 206748 transitions. [2020-10-11 15:18:38,020 INFO L78 Accepts]: Start accepts. Automaton has 38885 states and 206748 transitions. Word has length 27 [2020-10-11 15:18:38,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:18:38,020 INFO L481 AbstractCegarLoop]: Abstraction has 38885 states and 206748 transitions. [2020-10-11 15:18:38,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:18:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 38885 states and 206748 transitions. [2020-10-11 15:18:38,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:18:38,024 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:18:38,024 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:18:38,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2020-10-11 15:18:38,025 INFO L429 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:18:38,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:18:38,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1956167485, now seen corresponding path program 14 times [2020-10-11 15:18:38,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:18:38,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883212496] [2020-10-11 15:18:38,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:18:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:18:38,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883212496] [2020-10-11 15:18:38,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:18:38,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:18:38,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500694166] [2020-10-11 15:18:38,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:18:38,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:18:38,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:18:38,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:18:38,093 INFO L87 Difference]: Start difference. First operand 38885 states and 206748 transitions. Second operand 11 states. [2020-10-11 15:18:40,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:18:40,567 INFO L93 Difference]: Finished difference Result 182770 states and 797712 transitions. [2020-10-11 15:18:40,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:18:40,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:18:40,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:18:41,051 INFO L225 Difference]: With dead ends: 182770 [2020-10-11 15:18:41,051 INFO L226 Difference]: Without dead ends: 182746 [2020-10-11 15:18:41,052 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1559 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:18:42,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182746 states. [2020-10-11 15:18:44,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182746 to 38499. [2020-10-11 15:18:44,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38499 states. [2020-10-11 15:18:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38499 states to 38499 states and 204735 transitions. [2020-10-11 15:18:44,760 INFO L78 Accepts]: Start accepts. Automaton has 38499 states and 204735 transitions. Word has length 27 [2020-10-11 15:18:44,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:18:44,760 INFO L481 AbstractCegarLoop]: Abstraction has 38499 states and 204735 transitions. [2020-10-11 15:18:44,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:18:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 38499 states and 204735 transitions. [2020-10-11 15:18:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:18:44,764 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:18:44,764 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:18:44,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2020-10-11 15:18:44,765 INFO L429 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:18:44,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:18:44,765 INFO L82 PathProgramCache]: Analyzing trace with hash -690385405, now seen corresponding path program 15 times [2020-10-11 15:18:44,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:18:44,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605265992] [2020-10-11 15:18:44,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:18:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:18:44,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605265992] [2020-10-11 15:18:44,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:18:44,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:18:44,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054090950] [2020-10-11 15:18:44,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:18:44,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:18:44,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:18:44,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:18:44,832 INFO L87 Difference]: Start difference. First operand 38499 states and 204735 transitions. Second operand 11 states. [2020-10-11 15:18:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:18:47,821 INFO L93 Difference]: Finished difference Result 181153 states and 790470 transitions. [2020-10-11 15:18:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:18:47,822 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:18:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:18:48,377 INFO L225 Difference]: With dead ends: 181153 [2020-10-11 15:18:48,377 INFO L226 Difference]: Without dead ends: 181135 [2020-10-11 15:18:48,377 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1561 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:18:49,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181135 states. [2020-10-11 15:18:51,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181135 to 38208. [2020-10-11 15:18:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38208 states. [2020-10-11 15:18:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38208 states to 38208 states and 203398 transitions. [2020-10-11 15:18:51,948 INFO L78 Accepts]: Start accepts. Automaton has 38208 states and 203398 transitions. Word has length 27 [2020-10-11 15:18:51,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:18:51,948 INFO L481 AbstractCegarLoop]: Abstraction has 38208 states and 203398 transitions. [2020-10-11 15:18:51,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:18:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 38208 states and 203398 transitions. [2020-10-11 15:18:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:18:51,952 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:18:51,952 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:18:51,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2020-10-11 15:18:51,952 INFO L429 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:18:51,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:18:51,952 INFO L82 PathProgramCache]: Analyzing trace with hash -667857085, now seen corresponding path program 16 times [2020-10-11 15:18:51,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:18:51,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233750063] [2020-10-11 15:18:51,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:18:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:18:52,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233750063] [2020-10-11 15:18:52,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:18:52,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:18:52,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97489258] [2020-10-11 15:18:52,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:18:52,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:18:52,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:18:52,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:18:52,014 INFO L87 Difference]: Start difference. First operand 38208 states and 203398 transitions. Second operand 11 states. [2020-10-11 15:18:54,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:18:54,420 INFO L93 Difference]: Finished difference Result 181957 states and 793915 transitions. [2020-10-11 15:18:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:18:54,420 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:18:54,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:18:54,902 INFO L225 Difference]: With dead ends: 181957 [2020-10-11 15:18:54,902 INFO L226 Difference]: Without dead ends: 181933 [2020-10-11 15:18:54,902 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:18:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181933 states. [2020-10-11 15:18:59,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181933 to 37822. [2020-10-11 15:18:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37822 states. [2020-10-11 15:18:59,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37822 states to 37822 states and 201385 transitions. [2020-10-11 15:18:59,277 INFO L78 Accepts]: Start accepts. Automaton has 37822 states and 201385 transitions. Word has length 27 [2020-10-11 15:18:59,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:18:59,277 INFO L481 AbstractCegarLoop]: Abstraction has 37822 states and 201385 transitions. [2020-10-11 15:18:59,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:18:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 37822 states and 201385 transitions. [2020-10-11 15:18:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:18:59,281 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:18:59,281 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:18:59,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2020-10-11 15:18:59,282 INFO L429 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:18:59,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:18:59,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1485355099, now seen corresponding path program 1 times [2020-10-11 15:18:59,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:18:59,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085357258] [2020-10-11 15:18:59,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:18:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:18:59,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085357258] [2020-10-11 15:18:59,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913854176] [2020-10-11 15:18:59,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:18:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:18:59,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:18:59,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:18:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:18:59,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:18:59,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-11 15:18:59,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484496211] [2020-10-11 15:18:59,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:18:59,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:18:59,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:18:59,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:18:59,413 INFO L87 Difference]: Start difference. First operand 37822 states and 201385 transitions. Second operand 9 states. [2020-10-11 15:19:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:00,133 INFO L93 Difference]: Finished difference Result 90020 states and 438095 transitions. [2020-10-11 15:19:00,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:19:00,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-11 15:19:00,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:00,394 INFO L225 Difference]: With dead ends: 90020 [2020-10-11 15:19:00,394 INFO L226 Difference]: Without dead ends: 89960 [2020-10-11 15:19:00,395 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-10-11 15:19:01,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89960 states. [2020-10-11 15:19:02,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89960 to 39411. [2020-10-11 15:19:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39411 states. [2020-10-11 15:19:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39411 states to 39411 states and 210063 transitions. [2020-10-11 15:19:02,613 INFO L78 Accepts]: Start accepts. Automaton has 39411 states and 210063 transitions. Word has length 27 [2020-10-11 15:19:02,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:02,614 INFO L481 AbstractCegarLoop]: Abstraction has 39411 states and 210063 transitions. [2020-10-11 15:19:02,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:19:02,614 INFO L276 IsEmpty]: Start isEmpty. Operand 39411 states and 210063 transitions. [2020-10-11 15:19:02,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:02,618 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:02,618 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:02,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2020-10-11 15:19:02,819 INFO L429 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:19:02,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:02,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1781288445, now seen corresponding path program 17 times [2020-10-11 15:19:02,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:02,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068505716] [2020-10-11 15:19:02,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:19:02,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068505716] [2020-10-11 15:19:02,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:02,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:19:02,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392481498] [2020-10-11 15:19:02,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:19:02,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:02,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:19:02,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:19:02,889 INFO L87 Difference]: Start difference. First operand 39411 states and 210063 transitions. Second operand 11 states. [2020-10-11 15:19:06,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:06,085 INFO L93 Difference]: Finished difference Result 181463 states and 790579 transitions. [2020-10-11 15:19:06,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:19:06,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:19:06,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:06,602 INFO L225 Difference]: With dead ends: 181463 [2020-10-11 15:19:06,602 INFO L226 Difference]: Without dead ends: 181445 [2020-10-11 15:19:06,602 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1555 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:19:08,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181445 states. [2020-10-11 15:19:10,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181445 to 39508. [2020-10-11 15:19:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39508 states. [2020-10-11 15:19:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39508 states to 39508 states and 210536 transitions. [2020-10-11 15:19:10,279 INFO L78 Accepts]: Start accepts. Automaton has 39508 states and 210536 transitions. Word has length 27 [2020-10-11 15:19:10,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:10,279 INFO L481 AbstractCegarLoop]: Abstraction has 39508 states and 210536 transitions. [2020-10-11 15:19:10,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:19:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 39508 states and 210536 transitions. [2020-10-11 15:19:10,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:10,283 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:10,284 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:10,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2020-10-11 15:19:10,284 INFO L429 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:19:10,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:10,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1779949245, now seen corresponding path program 18 times [2020-10-11 15:19:10,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:10,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626956742] [2020-10-11 15:19:10,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:19:10,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626956742] [2020-10-11 15:19:10,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:10,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:19:10,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958939132] [2020-10-11 15:19:10,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:19:10,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:10,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:19:10,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:19:10,352 INFO L87 Difference]: Start difference. First operand 39508 states and 210536 transitions. Second operand 11 states. [2020-10-11 15:19:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:12,894 INFO L93 Difference]: Finished difference Result 181054 states and 788837 transitions. [2020-10-11 15:19:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:19:12,894 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:19:12,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:13,374 INFO L225 Difference]: With dead ends: 181054 [2020-10-11 15:19:13,375 INFO L226 Difference]: Without dead ends: 181026 [2020-10-11 15:19:13,375 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:19:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181026 states. [2020-10-11 15:19:17,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181026 to 39280. [2020-10-11 15:19:17,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39280 states. [2020-10-11 15:19:17,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39280 states to 39280 states and 209319 transitions. [2020-10-11 15:19:17,989 INFO L78 Accepts]: Start accepts. Automaton has 39280 states and 209319 transitions. Word has length 27 [2020-10-11 15:19:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:17,989 INFO L481 AbstractCegarLoop]: Abstraction has 39280 states and 209319 transitions. [2020-10-11 15:19:17,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:19:17,989 INFO L276 IsEmpty]: Start isEmpty. Operand 39280 states and 209319 transitions. [2020-10-11 15:19:17,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:17,994 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:17,994 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:17,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2020-10-11 15:19:17,994 INFO L429 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:19:17,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:17,995 INFO L82 PathProgramCache]: Analyzing trace with hash -639654315, now seen corresponding path program 2 times [2020-10-11 15:19:17,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:17,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427143641] [2020-10-11 15:19:17,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:19:18,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427143641] [2020-10-11 15:19:18,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:18,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:19:18,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748199037] [2020-10-11 15:19:18,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:19:18,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:18,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:19:18,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:19:18,028 INFO L87 Difference]: Start difference. First operand 39280 states and 209319 transitions. Second operand 7 states. [2020-10-11 15:19:18,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:18,716 INFO L93 Difference]: Finished difference Result 90032 states and 438659 transitions. [2020-10-11 15:19:18,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:19:18,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-11 15:19:18,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:18,973 INFO L225 Difference]: With dead ends: 90032 [2020-10-11 15:19:18,973 INFO L226 Difference]: Without dead ends: 89955 [2020-10-11 15:19:18,973 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:19:19,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89955 states. [2020-10-11 15:19:21,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89955 to 40208. [2020-10-11 15:19:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40208 states. [2020-10-11 15:19:21,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40208 states to 40208 states and 214272 transitions. [2020-10-11 15:19:21,196 INFO L78 Accepts]: Start accepts. Automaton has 40208 states and 214272 transitions. Word has length 27 [2020-10-11 15:19:21,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:21,196 INFO L481 AbstractCegarLoop]: Abstraction has 40208 states and 214272 transitions. [2020-10-11 15:19:21,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:19:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 40208 states and 214272 transitions. [2020-10-11 15:19:21,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:21,201 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:21,201 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:21,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2020-10-11 15:19:21,201 INFO L429 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:19:21,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:21,202 INFO L82 PathProgramCache]: Analyzing trace with hash -639652920, now seen corresponding path program 2 times [2020-10-11 15:19:21,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:21,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211466614] [2020-10-11 15:19:21,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:19:21,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211466614] [2020-10-11 15:19:21,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:21,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:19:21,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746131649] [2020-10-11 15:19:21,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:19:21,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:21,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:19:21,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:19:21,246 INFO L87 Difference]: Start difference. First operand 40208 states and 214272 transitions. Second operand 7 states. [2020-10-11 15:19:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:21,908 INFO L93 Difference]: Finished difference Result 90501 states and 440366 transitions. [2020-10-11 15:19:21,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:19:21,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-11 15:19:21,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:22,166 INFO L225 Difference]: With dead ends: 90501 [2020-10-11 15:19:22,166 INFO L226 Difference]: Without dead ends: 90424 [2020-10-11 15:19:22,166 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:19:23,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90424 states. [2020-10-11 15:19:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90424 to 40817. [2020-10-11 15:19:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40817 states. [2020-10-11 15:19:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40817 states to 40817 states and 217501 transitions. [2020-10-11 15:19:25,062 INFO L78 Accepts]: Start accepts. Automaton has 40817 states and 217501 transitions. Word has length 27 [2020-10-11 15:19:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:25,063 INFO L481 AbstractCegarLoop]: Abstraction has 40817 states and 217501 transitions. [2020-10-11 15:19:25,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:19:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand 40817 states and 217501 transitions. [2020-10-11 15:19:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:25,067 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:25,067 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:25,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2020-10-11 15:19:25,068 INFO L429 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:19:25,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:25,068 INFO L82 PathProgramCache]: Analyzing trace with hash -639668389, now seen corresponding path program 2 times [2020-10-11 15:19:25,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:25,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116134674] [2020-10-11 15:19:25,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:19:25,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116134674] [2020-10-11 15:19:25,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:25,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:19:25,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769064378] [2020-10-11 15:19:25,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:19:25,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:25,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:19:25,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:19:25,106 INFO L87 Difference]: Start difference. First operand 40817 states and 217501 transitions. Second operand 7 states. [2020-10-11 15:19:25,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:25,804 INFO L93 Difference]: Finished difference Result 91389 states and 444541 transitions. [2020-10-11 15:19:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:19:25,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-11 15:19:25,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:26,070 INFO L225 Difference]: With dead ends: 91389 [2020-10-11 15:19:26,070 INFO L226 Difference]: Without dead ends: 91312 [2020-10-11 15:19:26,070 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:19:27,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91312 states. [2020-10-11 15:19:28,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91312 to 41653. [2020-10-11 15:19:28,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41653 states. [2020-10-11 15:19:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41653 states to 41653 states and 221647 transitions. [2020-10-11 15:19:28,400 INFO L78 Accepts]: Start accepts. Automaton has 41653 states and 221647 transitions. Word has length 27 [2020-10-11 15:19:28,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:28,401 INFO L481 AbstractCegarLoop]: Abstraction has 41653 states and 221647 transitions. [2020-10-11 15:19:28,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:19:28,401 INFO L276 IsEmpty]: Start isEmpty. Operand 41653 states and 221647 transitions. [2020-10-11 15:19:28,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:28,405 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:28,405 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:28,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2020-10-11 15:19:28,406 INFO L429 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:19:28,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:28,406 INFO L82 PathProgramCache]: Analyzing trace with hash -639630848, now seen corresponding path program 1 times [2020-10-11 15:19:28,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:28,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662692090] [2020-10-11 15:19:28,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:19:28,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662692090] [2020-10-11 15:19:28,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:28,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:19:28,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397023790] [2020-10-11 15:19:28,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:19:28,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:28,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:19:28,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:19:28,439 INFO L87 Difference]: Start difference. First operand 41653 states and 221647 transitions. Second operand 7 states. [2020-10-11 15:19:29,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:29,178 INFO L93 Difference]: Finished difference Result 96066 states and 468402 transitions. [2020-10-11 15:19:29,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:19:29,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-11 15:19:29,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:29,464 INFO L225 Difference]: With dead ends: 96066 [2020-10-11 15:19:29,464 INFO L226 Difference]: Without dead ends: 95989 [2020-10-11 15:19:29,464 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:19:30,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95989 states. [2020-10-11 15:19:31,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95989 to 44034. [2020-10-11 15:19:31,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44034 states. [2020-10-11 15:19:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44034 states to 44034 states and 234037 transitions. [2020-10-11 15:19:31,845 INFO L78 Accepts]: Start accepts. Automaton has 44034 states and 234037 transitions. Word has length 27 [2020-10-11 15:19:31,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:31,845 INFO L481 AbstractCegarLoop]: Abstraction has 44034 states and 234037 transitions. [2020-10-11 15:19:31,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:19:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 44034 states and 234037 transitions. [2020-10-11 15:19:31,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:31,851 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:31,851 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:31,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2020-10-11 15:19:31,851 INFO L429 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:19:31,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:31,851 INFO L82 PathProgramCache]: Analyzing trace with hash -616120448, now seen corresponding path program 2 times [2020-10-11 15:19:31,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:31,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894321041] [2020-10-11 15:19:31,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:19:31,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894321041] [2020-10-11 15:19:31,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:31,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:19:31,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322901183] [2020-10-11 15:19:31,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:19:31,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:31,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:19:31,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:19:31,888 INFO L87 Difference]: Start difference. First operand 44034 states and 234037 transitions. Second operand 7 states. [2020-10-11 15:19:32,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:32,969 INFO L93 Difference]: Finished difference Result 97335 states and 474289 transitions. [2020-10-11 15:19:32,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:19:32,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-11 15:19:32,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:33,247 INFO L225 Difference]: With dead ends: 97335 [2020-10-11 15:19:33,248 INFO L226 Difference]: Without dead ends: 97258 [2020-10-11 15:19:33,248 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:19:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97258 states. [2020-10-11 15:19:35,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97258 to 45832. [2020-10-11 15:19:35,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45832 states. [2020-10-11 15:19:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45832 states to 45832 states and 243883 transitions. [2020-10-11 15:19:35,670 INFO L78 Accepts]: Start accepts. Automaton has 45832 states and 243883 transitions. Word has length 27 [2020-10-11 15:19:35,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:35,671 INFO L481 AbstractCegarLoop]: Abstraction has 45832 states and 243883 transitions. [2020-10-11 15:19:35,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:19:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 45832 states and 243883 transitions. [2020-10-11 15:19:35,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:35,676 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:35,676 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:35,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2020-10-11 15:19:35,676 INFO L429 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:19:35,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:35,676 INFO L82 PathProgramCache]: Analyzing trace with hash -263020797, now seen corresponding path program 19 times [2020-10-11 15:19:35,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:35,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687266319] [2020-10-11 15:19:35,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:19:35,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687266319] [2020-10-11 15:19:35,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:35,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:19:35,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286929336] [2020-10-11 15:19:35,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:19:35,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:35,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:19:35,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:19:35,749 INFO L87 Difference]: Start difference. First operand 45832 states and 243883 transitions. Second operand 11 states. [2020-10-11 15:19:38,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:38,390 INFO L93 Difference]: Finished difference Result 206462 states and 913897 transitions. [2020-10-11 15:19:38,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:19:38,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:19:38,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:38,944 INFO L225 Difference]: With dead ends: 206462 [2020-10-11 15:19:38,944 INFO L226 Difference]: Without dead ends: 206438 [2020-10-11 15:19:38,944 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:19:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206438 states. [2020-10-11 15:19:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206438 to 45730. [2020-10-11 15:19:44,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45730 states. [2020-10-11 15:19:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45730 states to 45730 states and 243333 transitions. [2020-10-11 15:19:44,322 INFO L78 Accepts]: Start accepts. Automaton has 45730 states and 243333 transitions. Word has length 27 [2020-10-11 15:19:44,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:44,322 INFO L481 AbstractCegarLoop]: Abstraction has 45730 states and 243333 transitions. [2020-10-11 15:19:44,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:19:44,322 INFO L276 IsEmpty]: Start isEmpty. Operand 45730 states and 243333 transitions. [2020-10-11 15:19:44,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:44,327 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:44,327 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:44,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2020-10-11 15:19:44,328 INFO L429 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:19:44,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:44,328 INFO L82 PathProgramCache]: Analyzing trace with hash -277871037, now seen corresponding path program 20 times [2020-10-11 15:19:44,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:44,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901364167] [2020-10-11 15:19:44,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:19:44,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901364167] [2020-10-11 15:19:44,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:44,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:19:44,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702156689] [2020-10-11 15:19:44,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:19:44,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:44,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:19:44,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:19:44,395 INFO L87 Difference]: Start difference. First operand 45730 states and 243333 transitions. Second operand 11 states. [2020-10-11 15:19:46,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:46,987 INFO L93 Difference]: Finished difference Result 205970 states and 911791 transitions. [2020-10-11 15:19:46,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:19:46,989 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:19:46,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:47,542 INFO L225 Difference]: With dead ends: 205970 [2020-10-11 15:19:47,542 INFO L226 Difference]: Without dead ends: 205940 [2020-10-11 15:19:47,543 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1548 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:19:49,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205940 states. [2020-10-11 15:19:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205940 to 45335. [2020-10-11 15:19:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45335 states. [2020-10-11 15:19:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45335 states to 45335 states and 241261 transitions. [2020-10-11 15:19:52,858 INFO L78 Accepts]: Start accepts. Automaton has 45335 states and 241261 transitions. Word has length 27 [2020-10-11 15:19:52,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:19:52,858 INFO L481 AbstractCegarLoop]: Abstraction has 45335 states and 241261 transitions. [2020-10-11 15:19:52,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:19:52,858 INFO L276 IsEmpty]: Start isEmpty. Operand 45335 states and 241261 transitions. [2020-10-11 15:19:52,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:19:52,863 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:19:52,863 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:19:52,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2020-10-11 15:19:52,863 INFO L429 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:19:52,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:19:52,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1023950403, now seen corresponding path program 21 times [2020-10-11 15:19:52,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:19:52,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449447223] [2020-10-11 15:19:52,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:19:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:19:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:19:52,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449447223] [2020-10-11 15:19:52,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:19:52,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:19:52,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858658075] [2020-10-11 15:19:52,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:19:52,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:19:52,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:19:52,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:19:52,936 INFO L87 Difference]: Start difference. First operand 45335 states and 241261 transitions. Second operand 11 states. [2020-10-11 15:19:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:19:55,625 INFO L93 Difference]: Finished difference Result 205404 states and 909139 transitions. [2020-10-11 15:19:55,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:19:55,626 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:19:55,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:19:56,177 INFO L225 Difference]: With dead ends: 205404 [2020-10-11 15:19:56,177 INFO L226 Difference]: Without dead ends: 205380 [2020-10-11 15:19:56,178 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1547 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:19:58,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205380 states. [2020-10-11 15:20:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205380 to 45076. [2020-10-11 15:20:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45076 states. [2020-10-11 15:20:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45076 states to 45076 states and 240064 transitions. [2020-10-11 15:20:00,518 INFO L78 Accepts]: Start accepts. Automaton has 45076 states and 240064 transitions. Word has length 27 [2020-10-11 15:20:00,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:00,518 INFO L481 AbstractCegarLoop]: Abstraction has 45076 states and 240064 transitions. [2020-10-11 15:20:00,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 45076 states and 240064 transitions. [2020-10-11 15:20:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:20:00,523 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:00,524 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:00,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2020-10-11 15:20:00,524 INFO L429 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:20:00,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:00,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1010439363, now seen corresponding path program 22 times [2020-10-11 15:20:00,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:00,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017259221] [2020-10-11 15:20:00,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:20:01,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017259221] [2020-10-11 15:20:01,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:20:01,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:20:01,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769221077] [2020-10-11 15:20:01,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:01,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:01,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:01,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:01,278 INFO L87 Difference]: Start difference. First operand 45076 states and 240064 transitions. Second operand 11 states. [2020-10-11 15:20:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:03,991 INFO L93 Difference]: Finished difference Result 205143 states and 907975 transitions. [2020-10-11 15:20:03,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:20:03,992 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:20:03,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:04,545 INFO L225 Difference]: With dead ends: 205143 [2020-10-11 15:20:04,546 INFO L226 Difference]: Without dead ends: 205113 [2020-10-11 15:20:04,546 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1562 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:20:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205113 states. [2020-10-11 15:20:08,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205113 to 44685. [2020-10-11 15:20:08,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44685 states. [2020-10-11 15:20:08,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44685 states to 44685 states and 238000 transitions. [2020-10-11 15:20:08,831 INFO L78 Accepts]: Start accepts. Automaton has 44685 states and 238000 transitions. Word has length 27 [2020-10-11 15:20:08,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:08,832 INFO L481 AbstractCegarLoop]: Abstraction has 44685 states and 238000 transitions. [2020-10-11 15:20:08,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:08,832 INFO L276 IsEmpty]: Start isEmpty. Operand 44685 states and 238000 transitions. [2020-10-11 15:20:08,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:20:08,836 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:08,837 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:08,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2020-10-11 15:20:08,837 INFO L429 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:20:08,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:08,837 INFO L82 PathProgramCache]: Analyzing trace with hash -377078589, now seen corresponding path program 23 times [2020-10-11 15:20:08,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:08,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215237829] [2020-10-11 15:20:08,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:08,903 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:20:08,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215237829] [2020-10-11 15:20:08,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:20:08,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:20:08,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761468051] [2020-10-11 15:20:08,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:08,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:08,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:08,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:08,905 INFO L87 Difference]: Start difference. First operand 44685 states and 238000 transitions. Second operand 11 states. [2020-10-11 15:20:12,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:12,068 INFO L93 Difference]: Finished difference Result 204573 states and 905311 transitions. [2020-10-11 15:20:12,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:20:12,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:20:12,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:12,620 INFO L225 Difference]: With dead ends: 204573 [2020-10-11 15:20:12,621 INFO L226 Difference]: Without dead ends: 204549 [2020-10-11 15:20:12,621 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1554 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:20:14,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204549 states. [2020-10-11 15:20:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204549 to 44434. [2020-10-11 15:20:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44434 states. [2020-10-11 15:20:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44434 states to 44434 states and 236823 transitions. [2020-10-11 15:20:16,895 INFO L78 Accepts]: Start accepts. Automaton has 44434 states and 236823 transitions. Word has length 27 [2020-10-11 15:20:16,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:16,895 INFO L481 AbstractCegarLoop]: Abstraction has 44434 states and 236823 transitions. [2020-10-11 15:20:16,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand 44434 states and 236823 transitions. [2020-10-11 15:20:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-11 15:20:16,900 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:16,901 INFO L421 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:16,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2020-10-11 15:20:16,901 INFO L429 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:20:16,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:16,901 INFO L82 PathProgramCache]: Analyzing trace with hash -375739389, now seen corresponding path program 24 times [2020-10-11 15:20:16,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:16,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339590852] [2020-10-11 15:20:16,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:20:16,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339590852] [2020-10-11 15:20:16,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:20:16,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 15:20:16,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166279323] [2020-10-11 15:20:16,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:16,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:16,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:16,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:16,973 INFO L87 Difference]: Start difference. First operand 44434 states and 236823 transitions. Second operand 11 states. [2020-10-11 15:20:20,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:20,710 INFO L93 Difference]: Finished difference Result 204089 states and 903225 transitions. [2020-10-11 15:20:20,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2020-10-11 15:20:20,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-11 15:20:20,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:21,289 INFO L225 Difference]: With dead ends: 204089 [2020-10-11 15:20:21,289 INFO L226 Difference]: Without dead ends: 204054 [2020-10-11 15:20:21,290 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1564 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=941, Invalid=3751, Unknown=0, NotChecked=0, Total=4692 [2020-10-11 15:20:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204054 states. [2020-10-11 15:20:25,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204054 to 43794. [2020-10-11 15:20:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43794 states. [2020-10-11 15:20:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43794 states to 43794 states and 233791 transitions. [2020-10-11 15:20:25,453 INFO L78 Accepts]: Start accepts. Automaton has 43794 states and 233791 transitions. Word has length 27 [2020-10-11 15:20:25,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:25,453 INFO L481 AbstractCegarLoop]: Abstraction has 43794 states and 233791 transitions. [2020-10-11 15:20:25,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 43794 states and 233791 transitions. [2020-10-11 15:20:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:20:25,461 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:25,461 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:25,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2020-10-11 15:20:25,462 INFO L429 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:20:25,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:25,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1079064756, now seen corresponding path program 1 times [2020-10-11 15:20:25,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:25,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424708949] [2020-10-11 15:20:25,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:25,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424708949] [2020-10-11 15:20:25,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306332477] [2020-10-11 15:20:25,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:25,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:20:25,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:20:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:25,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:20:25,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:20:25,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224959570] [2020-10-11 15:20:25,655 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:25,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:25,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:25,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:25,655 INFO L87 Difference]: Start difference. First operand 43794 states and 233791 transitions. Second operand 11 states. [2020-10-11 15:20:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:27,025 INFO L93 Difference]: Finished difference Result 139868 states and 649854 transitions. [2020-10-11 15:20:27,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:20:27,025 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:20:27,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:27,414 INFO L225 Difference]: With dead ends: 139868 [2020-10-11 15:20:27,414 INFO L226 Difference]: Without dead ends: 139824 [2020-10-11 15:20:27,414 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:20:28,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139824 states. [2020-10-11 15:20:31,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139824 to 44208. [2020-10-11 15:20:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2020-10-11 15:20:31,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 235737 transitions. [2020-10-11 15:20:31,294 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 235737 transitions. Word has length 29 [2020-10-11 15:20:31,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:31,294 INFO L481 AbstractCegarLoop]: Abstraction has 44208 states and 235737 transitions. [2020-10-11 15:20:31,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:31,294 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 235737 transitions. [2020-10-11 15:20:31,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:20:31,302 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:31,302 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:31,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable149 [2020-10-11 15:20:31,503 INFO L429 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:20:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:31,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1079080225, now seen corresponding path program 1 times [2020-10-11 15:20:31,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:31,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536625918] [2020-10-11 15:20:31,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:31,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536625918] [2020-10-11 15:20:31,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152692346] [2020-10-11 15:20:31,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:31,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:20:31,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:20:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:31,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:20:31,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:20:31,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399777770] [2020-10-11 15:20:31,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:31,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:31,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:31,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:31,663 INFO L87 Difference]: Start difference. First operand 44208 states and 235737 transitions. Second operand 11 states. [2020-10-11 15:20:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:33,146 INFO L93 Difference]: Finished difference Result 138663 states and 644549 transitions. [2020-10-11 15:20:33,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:20:33,147 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:20:33,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:33,536 INFO L225 Difference]: With dead ends: 138663 [2020-10-11 15:20:33,537 INFO L226 Difference]: Without dead ends: 138619 [2020-10-11 15:20:33,537 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:20:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138619 states. [2020-10-11 15:20:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138619 to 44346. [2020-10-11 15:20:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44346 states. [2020-10-11 15:20:36,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44346 states to 44346 states and 236212 transitions. [2020-10-11 15:20:36,746 INFO L78 Accepts]: Start accepts. Automaton has 44346 states and 236212 transitions. Word has length 29 [2020-10-11 15:20:36,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:36,746 INFO L481 AbstractCegarLoop]: Abstraction has 44346 states and 236212 transitions. [2020-10-11 15:20:36,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand 44346 states and 236212 transitions. [2020-10-11 15:20:36,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:20:36,755 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:36,755 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:36,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150,62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:36,955 INFO L429 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:20:36,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:36,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1079042684, now seen corresponding path program 1 times [2020-10-11 15:20:36,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:36,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188865276] [2020-10-11 15:20:36,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:37,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188865276] [2020-10-11 15:20:37,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475202553] [2020-10-11 15:20:37,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:37,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:20:37,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:20:37,115 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:37,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:20:37,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:20:37,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709636063] [2020-10-11 15:20:37,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:37,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:37,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:37,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:37,116 INFO L87 Difference]: Start difference. First operand 44346 states and 236212 transitions. Second operand 11 states. [2020-10-11 15:20:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:38,923 INFO L93 Difference]: Finished difference Result 137475 states and 638613 transitions. [2020-10-11 15:20:38,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:20:38,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:20:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:39,304 INFO L225 Difference]: With dead ends: 137475 [2020-10-11 15:20:39,304 INFO L226 Difference]: Without dead ends: 137431 [2020-10-11 15:20:39,304 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:20:40,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137431 states. [2020-10-11 15:20:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137431 to 44001. [2020-10-11 15:20:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44001 states. [2020-10-11 15:20:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44001 states to 44001 states and 234197 transitions. [2020-10-11 15:20:42,382 INFO L78 Accepts]: Start accepts. Automaton has 44001 states and 234197 transitions. Word has length 29 [2020-10-11 15:20:42,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:42,382 INFO L481 AbstractCegarLoop]: Abstraction has 44001 states and 234197 transitions. [2020-10-11 15:20:42,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:42,382 INFO L276 IsEmpty]: Start isEmpty. Operand 44001 states and 234197 transitions. [2020-10-11 15:20:42,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:20:42,391 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:42,391 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:42,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,63 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:42,591 INFO L429 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:20:42,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:42,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1076743476, now seen corresponding path program 2 times [2020-10-11 15:20:42,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:42,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319471641] [2020-10-11 15:20:42,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:42,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319471641] [2020-10-11 15:20:42,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444379721] [2020-10-11 15:20:42,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:42,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:20:42,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:20:42,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:20:42,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:20:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:42,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:20:42,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:20:42,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612022698] [2020-10-11 15:20:42,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:42,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:42,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:42,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:42,756 INFO L87 Difference]: Start difference. First operand 44001 states and 234197 transitions. Second operand 11 states. [2020-10-11 15:20:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:44,183 INFO L93 Difference]: Finished difference Result 137660 states and 639047 transitions. [2020-10-11 15:20:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:20:44,184 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:20:44,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:44,559 INFO L225 Difference]: With dead ends: 137660 [2020-10-11 15:20:44,560 INFO L226 Difference]: Without dead ends: 137614 [2020-10-11 15:20:44,560 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:20:45,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137614 states. [2020-10-11 15:20:48,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137614 to 43606. [2020-10-11 15:20:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43606 states. [2020-10-11 15:20:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43606 states to 43606 states and 231805 transitions. [2020-10-11 15:20:48,434 INFO L78 Accepts]: Start accepts. Automaton has 43606 states and 231805 transitions. Word has length 29 [2020-10-11 15:20:48,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:48,434 INFO L481 AbstractCegarLoop]: Abstraction has 43606 states and 231805 transitions. [2020-10-11 15:20:48,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 43606 states and 231805 transitions. [2020-10-11 15:20:48,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:20:48,443 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:48,443 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:48,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152,64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:48,643 INFO L429 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:20:48,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:48,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1091609185, now seen corresponding path program 2 times [2020-10-11 15:20:48,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:48,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499464483] [2020-10-11 15:20:48,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:48,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499464483] [2020-10-11 15:20:48,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93201536] [2020-10-11 15:20:48,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:48,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:20:48,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:20:48,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:20:48,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:20:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:48,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:20:48,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:20:48,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129668736] [2020-10-11 15:20:48,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:48,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:48,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:48,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:48,809 INFO L87 Difference]: Start difference. First operand 43606 states and 231805 transitions. Second operand 11 states. [2020-10-11 15:20:50,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:50,194 INFO L93 Difference]: Finished difference Result 136227 states and 631974 transitions. [2020-10-11 15:20:50,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:20:50,195 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:20:50,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:50,577 INFO L225 Difference]: With dead ends: 136227 [2020-10-11 15:20:50,577 INFO L226 Difference]: Without dead ends: 136181 [2020-10-11 15:20:50,578 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:20:51,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136181 states. [2020-10-11 15:20:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136181 to 43334. [2020-10-11 15:20:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43334 states. [2020-10-11 15:20:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43334 states to 43334 states and 230138 transitions. [2020-10-11 15:20:53,626 INFO L78 Accepts]: Start accepts. Automaton has 43334 states and 230138 transitions. Word has length 29 [2020-10-11 15:20:53,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:53,626 INFO L481 AbstractCegarLoop]: Abstraction has 43334 states and 230138 transitions. [2020-10-11 15:20:53,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:53,626 INFO L276 IsEmpty]: Start isEmpty. Operand 43334 states and 230138 transitions. [2020-10-11 15:20:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:20:53,635 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:53,635 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:53,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153,65 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:53,842 INFO L429 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:20:53,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:53,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1055532284, now seen corresponding path program 2 times [2020-10-11 15:20:53,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:53,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764429187] [2020-10-11 15:20:53,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:53,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764429187] [2020-10-11 15:20:53,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798036612] [2020-10-11 15:20:53,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:53,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:20:53,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:20:53,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:20:53,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:20:54,017 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-11 15:20:54,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:20:54,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:20:54,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273651348] [2020-10-11 15:20:54,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:54,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:54,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:54,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:54,018 INFO L87 Difference]: Start difference. First operand 43334 states and 230138 transitions. Second operand 11 states. [2020-10-11 15:20:55,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:20:55,411 INFO L93 Difference]: Finished difference Result 135193 states and 626279 transitions. [2020-10-11 15:20:55,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:20:55,411 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:20:55,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:20:56,599 INFO L225 Difference]: With dead ends: 135193 [2020-10-11 15:20:56,600 INFO L226 Difference]: Without dead ends: 135147 [2020-10-11 15:20:56,600 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:20:57,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135147 states. [2020-10-11 15:20:59,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135147 to 43128. [2020-10-11 15:20:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43128 states. [2020-10-11 15:20:59,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43128 states to 43128 states and 228903 transitions. [2020-10-11 15:20:59,393 INFO L78 Accepts]: Start accepts. Automaton has 43128 states and 228903 transitions. Word has length 29 [2020-10-11 15:20:59,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:20:59,393 INFO L481 AbstractCegarLoop]: Abstraction has 43128 states and 228903 transitions. [2020-10-11 15:20:59,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:20:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 43128 states and 228903 transitions. [2020-10-11 15:20:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:20:59,401 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:20:59,401 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:20:59,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable154 [2020-10-11 15:20:59,602 INFO L429 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:20:59,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:20:59,603 INFO L82 PathProgramCache]: Analyzing trace with hash -233799798, now seen corresponding path program 3 times [2020-10-11 15:20:59,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:20:59,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054854847] [2020-10-11 15:20:59,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:20:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:20:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:20:59,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054854847] [2020-10-11 15:20:59,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676685670] [2020-10-11 15:20:59,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:20:59,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-11 15:20:59,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:20:59,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:20:59,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:20:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:20:59,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:20:59,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:20:59,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412765366] [2020-10-11 15:20:59,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:20:59,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:20:59,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:20:59,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:20:59,771 INFO L87 Difference]: Start difference. First operand 43128 states and 228903 transitions. Second operand 11 states. [2020-10-11 15:21:01,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:01,175 INFO L93 Difference]: Finished difference Result 135315 states and 626661 transitions. [2020-10-11 15:21:01,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:01,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:01,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:01,567 INFO L225 Difference]: With dead ends: 135315 [2020-10-11 15:21:01,567 INFO L226 Difference]: Without dead ends: 135271 [2020-10-11 15:21:01,567 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:21:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135271 states. [2020-10-11 15:21:04,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135271 to 42904. [2020-10-11 15:21:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42904 states. [2020-10-11 15:21:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42904 states to 42904 states and 227530 transitions. [2020-10-11 15:21:04,610 INFO L78 Accepts]: Start accepts. Automaton has 42904 states and 227530 transitions. Word has length 29 [2020-10-11 15:21:04,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:04,610 INFO L481 AbstractCegarLoop]: Abstraction has 42904 states and 227530 transitions. [2020-10-11 15:21:04,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:04,610 INFO L276 IsEmpty]: Start isEmpty. Operand 42904 states and 227530 transitions. [2020-10-11 15:21:04,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:04,618 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:04,618 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:04,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable155 [2020-10-11 15:21:04,819 INFO L429 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:21:04,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:04,820 INFO L82 PathProgramCache]: Analyzing trace with hash -938803546, now seen corresponding path program 1 times [2020-10-11 15:21:04,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:04,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915261778] [2020-10-11 15:21:04,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:05,497 WARN L193 SmtUtils]: Spent 665.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2020-10-11 15:21:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:21:05,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915261778] [2020-10-11 15:21:05,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591359302] [2020-10-11 15:21:05,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:05,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:05,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:21:05,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:05,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:05,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918144536] [2020-10-11 15:21:05,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:05,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:05,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:05,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:05,646 INFO L87 Difference]: Start difference. First operand 42904 states and 227530 transitions. Second operand 11 states. [2020-10-11 15:21:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:07,060 INFO L93 Difference]: Finished difference Result 140989 states and 654549 transitions. [2020-10-11 15:21:07,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:07,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:07,469 INFO L225 Difference]: With dead ends: 140989 [2020-10-11 15:21:07,469 INFO L226 Difference]: Without dead ends: 140945 [2020-10-11 15:21:07,470 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:21:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140945 states. [2020-10-11 15:21:10,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140945 to 42930. [2020-10-11 15:21:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42930 states. [2020-10-11 15:21:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42930 states to 42930 states and 227280 transitions. [2020-10-11 15:21:10,620 INFO L78 Accepts]: Start accepts. Automaton has 42930 states and 227280 transitions. Word has length 29 [2020-10-11 15:21:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:10,620 INFO L481 AbstractCegarLoop]: Abstraction has 42930 states and 227280 transitions. [2020-10-11 15:21:10,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 42930 states and 227280 transitions. [2020-10-11 15:21:10,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:10,628 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:10,628 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:10,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156,68 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:10,829 INFO L429 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:21:10,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:10,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1231154336, now seen corresponding path program 4 times [2020-10-11 15:21:10,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:10,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415217153] [2020-10-11 15:21:10,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:21:10,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415217153] [2020-10-11 15:21:10,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222861823] [2020-10-11 15:21:10,884 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:10,970 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:21:10,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:21:10,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:10,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:21:10,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:10,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:10,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301482697] [2020-10-11 15:21:10,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:10,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:10,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:10,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:10,992 INFO L87 Difference]: Start difference. First operand 42930 states and 227280 transitions. Second operand 11 states. [2020-10-11 15:21:12,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:12,461 INFO L93 Difference]: Finished difference Result 136674 states and 632799 transitions. [2020-10-11 15:21:12,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:12,462 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:12,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:12,836 INFO L225 Difference]: With dead ends: 136674 [2020-10-11 15:21:12,836 INFO L226 Difference]: Without dead ends: 136628 [2020-10-11 15:21:12,836 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:21:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136628 states. [2020-10-11 15:21:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136628 to 43133. [2020-10-11 15:21:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43133 states. [2020-10-11 15:21:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43133 states to 43133 states and 228222 transitions. [2020-10-11 15:21:16,679 INFO L78 Accepts]: Start accepts. Automaton has 43133 states and 228222 transitions. Word has length 29 [2020-10-11 15:21:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:16,679 INFO L481 AbstractCegarLoop]: Abstraction has 43133 states and 228222 transitions. [2020-10-11 15:21:16,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 43133 states and 228222 transitions. [2020-10-11 15:21:16,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:16,687 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:16,687 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:16,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable157 [2020-10-11 15:21:16,888 INFO L429 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:21:16,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:16,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1231140262, now seen corresponding path program 2 times [2020-10-11 15:21:16,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:16,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127484636] [2020-10-11 15:21:16,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:16,938 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:21:16,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127484636] [2020-10-11 15:21:16,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714208640] [2020-10-11 15:21:16,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:17,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:21:17,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:21:17,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:17,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:21:17,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:17,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:17,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932006845] [2020-10-11 15:21:17,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:17,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:17,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:17,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:17,046 INFO L87 Difference]: Start difference. First operand 43133 states and 228222 transitions. Second operand 11 states. [2020-10-11 15:21:18,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:18,420 INFO L93 Difference]: Finished difference Result 137702 states and 638553 transitions. [2020-10-11 15:21:18,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:18,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:18,825 INFO L225 Difference]: With dead ends: 137702 [2020-10-11 15:21:18,825 INFO L226 Difference]: Without dead ends: 137652 [2020-10-11 15:21:18,825 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:21:20,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137652 states. [2020-10-11 15:21:21,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137652 to 42970. [2020-10-11 15:21:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42970 states. [2020-10-11 15:21:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42970 states to 42970 states and 227334 transitions. [2020-10-11 15:21:21,956 INFO L78 Accepts]: Start accepts. Automaton has 42970 states and 227334 transitions. Word has length 29 [2020-10-11 15:21:21,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:21,956 INFO L481 AbstractCegarLoop]: Abstraction has 42970 states and 227334 transitions. [2020-10-11 15:21:21,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 42970 states and 227334 transitions. [2020-10-11 15:21:21,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:21,964 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:21,964 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:22,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable158 [2020-10-11 15:21:22,165 INFO L429 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:21:22,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:22,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1231177803, now seen corresponding path program 1 times [2020-10-11 15:21:22,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:22,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576629168] [2020-10-11 15:21:22,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:21:22,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576629168] [2020-10-11 15:21:22,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672520728] [2020-10-11 15:21:22,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:22,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:22,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:21:22,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:22,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:22,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103168686] [2020-10-11 15:21:22,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:22,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:22,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:22,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:22,325 INFO L87 Difference]: Start difference. First operand 42970 states and 227334 transitions. Second operand 11 states. [2020-10-11 15:21:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:24,368 INFO L93 Difference]: Finished difference Result 136895 states and 634251 transitions. [2020-10-11 15:21:24,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:24,369 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:24,765 INFO L225 Difference]: With dead ends: 136895 [2020-10-11 15:21:24,765 INFO L226 Difference]: Without dead ends: 136851 [2020-10-11 15:21:24,765 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:21:26,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136851 states. [2020-10-11 15:21:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136851 to 42730. [2020-10-11 15:21:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42730 states. [2020-10-11 15:21:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42730 states to 42730 states and 225896 transitions. [2020-10-11 15:21:27,736 INFO L78 Accepts]: Start accepts. Automaton has 42730 states and 225896 transitions. Word has length 29 [2020-10-11 15:21:27,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:27,736 INFO L481 AbstractCegarLoop]: Abstraction has 42730 states and 225896 transitions. [2020-10-11 15:21:27,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 42730 states and 225896 transitions. [2020-10-11 15:21:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:27,744 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:27,744 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:27,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable159 [2020-10-11 15:21:27,953 INFO L429 AbstractCegarLoop]: === Iteration 86 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:21:27,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:27,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1254688203, now seen corresponding path program 2 times [2020-10-11 15:21:27,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:27,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179391501] [2020-10-11 15:21:27,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:28,004 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:21:28,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179391501] [2020-10-11 15:21:28,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625644504] [2020-10-11 15:21:28,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:28,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:21:28,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:21:28,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:28,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-11 15:21:28,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:28,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:28,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919968496] [2020-10-11 15:21:28,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:28,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:28,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:28,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:28,111 INFO L87 Difference]: Start difference. First operand 42730 states and 225896 transitions. Second operand 11 states. [2020-10-11 15:21:29,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:29,516 INFO L93 Difference]: Finished difference Result 136603 states and 632426 transitions. [2020-10-11 15:21:29,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:29,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:29,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:29,956 INFO L225 Difference]: With dead ends: 136603 [2020-10-11 15:21:29,956 INFO L226 Difference]: Without dead ends: 136553 [2020-10-11 15:21:29,957 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:21:31,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136553 states. [2020-10-11 15:21:32,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136553 to 42336. [2020-10-11 15:21:32,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42336 states. [2020-10-11 15:21:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42336 states to 42336 states and 223735 transitions. [2020-10-11 15:21:32,939 INFO L78 Accepts]: Start accepts. Automaton has 42336 states and 223735 transitions. Word has length 29 [2020-10-11 15:21:32,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:32,939 INFO L481 AbstractCegarLoop]: Abstraction has 42336 states and 223735 transitions. [2020-10-11 15:21:32,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:32,940 INFO L276 IsEmpty]: Start isEmpty. Operand 42336 states and 223735 transitions. [2020-10-11 15:21:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:32,948 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:32,948 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:33,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160,72 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:33,148 INFO L429 AbstractCegarLoop]: === Iteration 87 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:21:33,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:33,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1636984727, now seen corresponding path program 3 times [2020-10-11 15:21:33,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:33,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944514970] [2020-10-11 15:21:33,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:33,832 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:33,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944514970] [2020-10-11 15:21:33,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153173768] [2020-10-11 15:21:33,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:33,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-11 15:21:33,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:21:33,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:33,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:33,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:33,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:33,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049137090] [2020-10-11 15:21:33,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:33,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:33,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:33,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:33,936 INFO L87 Difference]: Start difference. First operand 42336 states and 223735 transitions. Second operand 11 states. [2020-10-11 15:21:35,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:35,322 INFO L93 Difference]: Finished difference Result 136165 states and 630523 transitions. [2020-10-11 15:21:35,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:35,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:35,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:35,715 INFO L225 Difference]: With dead ends: 136165 [2020-10-11 15:21:35,715 INFO L226 Difference]: Without dead ends: 136121 [2020-10-11 15:21:35,716 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:21:37,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136121 states. [2020-10-11 15:21:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136121 to 42190. [2020-10-11 15:21:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42190 states. [2020-10-11 15:21:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42190 states to 42190 states and 222836 transitions. [2020-10-11 15:21:38,706 INFO L78 Accepts]: Start accepts. Automaton has 42190 states and 222836 transitions. Word has length 29 [2020-10-11 15:21:38,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:38,706 INFO L481 AbstractCegarLoop]: Abstraction has 42190 states and 222836 transitions. [2020-10-11 15:21:38,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:38,706 INFO L276 IsEmpty]: Start isEmpty. Operand 42190 states and 222836 transitions. [2020-10-11 15:21:38,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:38,714 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:38,714 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:38,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161,73 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:38,915 INFO L429 AbstractCegarLoop]: === Iteration 88 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:21:38,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:38,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1194503706, now seen corresponding path program 3 times [2020-10-11 15:21:38,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:38,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945238350] [2020-10-11 15:21:38,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:38,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945238350] [2020-10-11 15:21:38,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019616470] [2020-10-11 15:21:38,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:39,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-11 15:21:39,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:21:39,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:39,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:39,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:39,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:39,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924047437] [2020-10-11 15:21:39,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:39,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:39,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:39,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:39,068 INFO L87 Difference]: Start difference. First operand 42190 states and 222836 transitions. Second operand 11 states. [2020-10-11 15:21:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:40,458 INFO L93 Difference]: Finished difference Result 135620 states and 627622 transitions. [2020-10-11 15:21:40,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:40,459 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:40,852 INFO L225 Difference]: With dead ends: 135620 [2020-10-11 15:21:40,852 INFO L226 Difference]: Without dead ends: 135576 [2020-10-11 15:21:40,852 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:21:42,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135576 states. [2020-10-11 15:21:44,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135576 to 42095. [2020-10-11 15:21:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42095 states. [2020-10-11 15:21:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42095 states to 42095 states and 222269 transitions. [2020-10-11 15:21:44,617 INFO L78 Accepts]: Start accepts. Automaton has 42095 states and 222269 transitions. Word has length 29 [2020-10-11 15:21:44,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:44,617 INFO L481 AbstractCegarLoop]: Abstraction has 42095 states and 222269 transitions. [2020-10-11 15:21:44,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 42095 states and 222269 transitions. [2020-10-11 15:21:44,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:44,625 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:44,625 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:44,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162,74 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:44,826 INFO L429 AbstractCegarLoop]: === Iteration 89 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:21:44,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:44,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1497105939, now seen corresponding path program 4 times [2020-10-11 15:21:44,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:44,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556856622] [2020-10-11 15:21:44,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:44,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556856622] [2020-10-11 15:21:44,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850074979] [2020-10-11 15:21:44,880 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:44,965 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:21:44,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:21:44,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:44,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:44,986 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:44,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:44,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:44,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833204654] [2020-10-11 15:21:44,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:44,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:44,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:44,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:44,987 INFO L87 Difference]: Start difference. First operand 42095 states and 222269 transitions. Second operand 11 states. [2020-10-11 15:21:46,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:46,381 INFO L93 Difference]: Finished difference Result 137900 states and 638782 transitions. [2020-10-11 15:21:46,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:46,382 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:46,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:46,782 INFO L225 Difference]: With dead ends: 137900 [2020-10-11 15:21:46,782 INFO L226 Difference]: Without dead ends: 137850 [2020-10-11 15:21:46,782 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:21:48,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137850 states. [2020-10-11 15:21:49,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137850 to 42209. [2020-10-11 15:21:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42209 states. [2020-10-11 15:21:49,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42209 states to 42209 states and 222796 transitions. [2020-10-11 15:21:49,954 INFO L78 Accepts]: Start accepts. Automaton has 42209 states and 222796 transitions. Word has length 29 [2020-10-11 15:21:49,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:49,954 INFO L481 AbstractCegarLoop]: Abstraction has 42209 states and 222796 transitions. [2020-10-11 15:21:49,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 42209 states and 222796 transitions. [2020-10-11 15:21:49,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:49,962 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:49,962 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:50,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163,75 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:50,163 INFO L429 AbstractCegarLoop]: === Iteration 90 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:21:50,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:50,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1497107334, now seen corresponding path program 4 times [2020-10-11 15:21:50,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:50,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333307377] [2020-10-11 15:21:50,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:50,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333307377] [2020-10-11 15:21:50,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32740766] [2020-10-11 15:21:50,217 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:50,300 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-11 15:21:50,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:21:50,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:50,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:50,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:50,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:50,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673112193] [2020-10-11 15:21:50,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:50,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:50,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:50,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:50,324 INFO L87 Difference]: Start difference. First operand 42209 states and 222796 transitions. Second operand 11 states. [2020-10-11 15:21:51,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:51,777 INFO L93 Difference]: Finished difference Result 136803 states and 633722 transitions. [2020-10-11 15:21:51,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:51,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:51,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:52,177 INFO L225 Difference]: With dead ends: 136803 [2020-10-11 15:21:52,177 INFO L226 Difference]: Without dead ends: 136753 [2020-10-11 15:21:52,178 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:21:54,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136753 states. [2020-10-11 15:21:55,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136753 to 42058. [2020-10-11 15:21:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42058 states. [2020-10-11 15:21:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42058 states to 42058 states and 221940 transitions. [2020-10-11 15:21:55,835 INFO L78 Accepts]: Start accepts. Automaton has 42058 states and 221940 transitions. Word has length 29 [2020-10-11 15:21:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:21:55,835 INFO L481 AbstractCegarLoop]: Abstraction has 42058 states and 221940 transitions. [2020-10-11 15:21:55,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:21:55,835 INFO L276 IsEmpty]: Start isEmpty. Operand 42058 states and 221940 transitions. [2020-10-11 15:21:55,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:21:55,843 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:21:55,843 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:21:56,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164,76 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:56,044 INFO L429 AbstractCegarLoop]: === Iteration 91 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:21:56,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:21:56,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1497129406, now seen corresponding path program 1 times [2020-10-11 15:21:56,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:21:56,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715637520] [2020-10-11 15:21:56,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:21:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:56,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715637520] [2020-10-11 15:21:56,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244254527] [2020-10-11 15:21:56,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:21:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:21:56,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:21:56,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:21:56,203 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:21:56,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:21:56,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:21:56,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657391793] [2020-10-11 15:21:56,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:21:56,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:21:56,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:21:56,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:21:56,205 INFO L87 Difference]: Start difference. First operand 42058 states and 221940 transitions. Second operand 11 states. [2020-10-11 15:21:57,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:21:57,707 INFO L93 Difference]: Finished difference Result 136837 states and 634815 transitions. [2020-10-11 15:21:57,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:21:57,707 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:21:57,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:21:58,143 INFO L225 Difference]: With dead ends: 136837 [2020-10-11 15:21:58,144 INFO L226 Difference]: Without dead ends: 136793 [2020-10-11 15:21:58,144 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:21:59,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136793 states. [2020-10-11 15:22:01,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136793 to 41929. [2020-10-11 15:22:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41929 states. [2020-10-11 15:22:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41929 states to 41929 states and 221167 transitions. [2020-10-11 15:22:01,224 INFO L78 Accepts]: Start accepts. Automaton has 41929 states and 221167 transitions. Word has length 29 [2020-10-11 15:22:01,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:01,224 INFO L481 AbstractCegarLoop]: Abstraction has 41929 states and 221167 transitions. [2020-10-11 15:22:01,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:22:01,224 INFO L276 IsEmpty]: Start isEmpty. Operand 41929 states and 221167 transitions. [2020-10-11 15:22:01,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:01,233 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:01,233 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:01,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165,77 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:22:01,433 INFO L429 AbstractCegarLoop]: === Iteration 92 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:22:01,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:01,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1520639806, now seen corresponding path program 2 times [2020-10-11 15:22:01,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:01,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449022317] [2020-10-11 15:22:01,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:01,485 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:22:01,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449022317] [2020-10-11 15:22:01,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938941929] [2020-10-11 15:22:01,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:22:01,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-11 15:22:01,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-11 15:22:01,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-11 15:22:01,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:22:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-11 15:22:01,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:22:01,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-11 15:22:01,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214622424] [2020-10-11 15:22:01,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 15:22:01,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:01,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 15:22:01,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:22:01,596 INFO L87 Difference]: Start difference. First operand 41929 states and 221167 transitions. Second operand 11 states. [2020-10-11 15:22:03,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:03,459 INFO L93 Difference]: Finished difference Result 136136 states and 631023 transitions. [2020-10-11 15:22:03,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:03,460 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-10-11 15:22:03,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:03,864 INFO L225 Difference]: With dead ends: 136136 [2020-10-11 15:22:03,865 INFO L226 Difference]: Without dead ends: 136077 [2020-10-11 15:22:03,865 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-10-11 15:22:05,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136077 states. [2020-10-11 15:22:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136077 to 41353. [2020-10-11 15:22:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41353 states. [2020-10-11 15:22:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41353 states to 41353 states and 218039 transitions. [2020-10-11 15:22:06,755 INFO L78 Accepts]: Start accepts. Automaton has 41353 states and 218039 transitions. Word has length 29 [2020-10-11 15:22:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:06,755 INFO L481 AbstractCegarLoop]: Abstraction has 41353 states and 218039 transitions. [2020-10-11 15:22:06,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 15:22:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 41353 states and 218039 transitions. [2020-10-11 15:22:06,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:06,763 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:06,763 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:06,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 78 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable166 [2020-10-11 15:22:06,964 INFO L429 AbstractCegarLoop]: === Iteration 93 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:22:06,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:06,964 INFO L82 PathProgramCache]: Analyzing trace with hash -527473920, now seen corresponding path program 5 times [2020-10-11 15:22:06,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:06,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946604666] [2020-10-11 15:22:06,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:07,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946604666] [2020-10-11 15:22:07,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:07,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:07,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389206369] [2020-10-11 15:22:07,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:07,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:07,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:07,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:07,015 INFO L87 Difference]: Start difference. First operand 41353 states and 218039 transitions. Second operand 9 states. [2020-10-11 15:22:08,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:08,422 INFO L93 Difference]: Finished difference Result 135187 states and 625168 transitions. [2020-10-11 15:22:08,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:08,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:08,842 INFO L225 Difference]: With dead ends: 135187 [2020-10-11 15:22:08,842 INFO L226 Difference]: Without dead ends: 135143 [2020-10-11 15:22:08,842 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135143 states. [2020-10-11 15:22:11,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135143 to 40915. [2020-10-11 15:22:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40915 states. [2020-10-11 15:22:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40915 states to 40915 states and 215544 transitions. [2020-10-11 15:22:11,783 INFO L78 Accepts]: Start accepts. Automaton has 40915 states and 215544 transitions. Word has length 29 [2020-10-11 15:22:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:11,783 INFO L481 AbstractCegarLoop]: Abstraction has 40915 states and 215544 transitions. [2020-10-11 15:22:11,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 40915 states and 215544 transitions. [2020-10-11 15:22:11,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:11,791 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:11,791 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:11,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2020-10-11 15:22:11,792 INFO L429 AbstractCegarLoop]: === Iteration 94 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:22:11,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:11,792 INFO L82 PathProgramCache]: Analyzing trace with hash -527489389, now seen corresponding path program 5 times [2020-10-11 15:22:11,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:11,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166563628] [2020-10-11 15:22:11,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:11,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166563628] [2020-10-11 15:22:11,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:11,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:11,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804416304] [2020-10-11 15:22:11,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:11,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:11,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:11,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:11,845 INFO L87 Difference]: Start difference. First operand 40915 states and 215544 transitions. Second operand 9 states. [2020-10-11 15:22:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:13,494 INFO L93 Difference]: Finished difference Result 133251 states and 615922 transitions. [2020-10-11 15:22:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:13,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:13,882 INFO L225 Difference]: With dead ends: 133251 [2020-10-11 15:22:13,882 INFO L226 Difference]: Without dead ends: 133207 [2020-10-11 15:22:13,882 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:15,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133207 states. [2020-10-11 15:22:16,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133207 to 40430. [2020-10-11 15:22:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40430 states. [2020-10-11 15:22:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40430 states to 40430 states and 212865 transitions. [2020-10-11 15:22:16,823 INFO L78 Accepts]: Start accepts. Automaton has 40430 states and 212865 transitions. Word has length 29 [2020-10-11 15:22:16,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:16,824 INFO L481 AbstractCegarLoop]: Abstraction has 40430 states and 212865 transitions. [2020-10-11 15:22:16,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:16,824 INFO L276 IsEmpty]: Start isEmpty. Operand 40430 states and 212865 transitions. [2020-10-11 15:22:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:16,832 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:16,832 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:16,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2020-10-11 15:22:16,832 INFO L429 AbstractCegarLoop]: === Iteration 95 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:22:16,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:16,832 INFO L82 PathProgramCache]: Analyzing trace with hash -527451848, now seen corresponding path program 3 times [2020-10-11 15:22:16,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:16,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771290578] [2020-10-11 15:22:16,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:16,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771290578] [2020-10-11 15:22:16,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:16,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:16,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751827782] [2020-10-11 15:22:16,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:16,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:16,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:16,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:16,882 INFO L87 Difference]: Start difference. First operand 40430 states and 212865 transitions. Second operand 9 states. [2020-10-11 15:22:18,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:18,324 INFO L93 Difference]: Finished difference Result 132509 states and 612908 transitions. [2020-10-11 15:22:18,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:18,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:18,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:18,702 INFO L225 Difference]: With dead ends: 132509 [2020-10-11 15:22:18,703 INFO L226 Difference]: Without dead ends: 132465 [2020-10-11 15:22:18,703 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:20,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132465 states. [2020-10-11 15:22:22,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132465 to 39940. [2020-10-11 15:22:22,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39940 states. [2020-10-11 15:22:22,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39940 states to 39940 states and 210218 transitions. [2020-10-11 15:22:22,548 INFO L78 Accepts]: Start accepts. Automaton has 39940 states and 210218 transitions. Word has length 29 [2020-10-11 15:22:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:22,548 INFO L481 AbstractCegarLoop]: Abstraction has 39940 states and 210218 transitions. [2020-10-11 15:22:22,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 39940 states and 210218 transitions. [2020-10-11 15:22:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:22,556 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:22,556 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:22,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2020-10-11 15:22:22,557 INFO L429 AbstractCegarLoop]: === Iteration 96 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:22:22,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:22,557 INFO L82 PathProgramCache]: Analyzing trace with hash -526134720, now seen corresponding path program 6 times [2020-10-11 15:22:22,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:22,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239511278] [2020-10-11 15:22:22,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:22,606 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:22,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239511278] [2020-10-11 15:22:22,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:22,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:22,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150058502] [2020-10-11 15:22:22,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:22,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:22,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:22,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:22,608 INFO L87 Difference]: Start difference. First operand 39940 states and 210218 transitions. Second operand 9 states. [2020-10-11 15:22:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:23,920 INFO L93 Difference]: Finished difference Result 130945 states and 603941 transitions. [2020-10-11 15:22:23,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:23,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:24,297 INFO L225 Difference]: With dead ends: 130945 [2020-10-11 15:22:24,297 INFO L226 Difference]: Without dead ends: 130886 [2020-10-11 15:22:24,298 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130886 states. [2020-10-11 15:22:27,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130886 to 39086. [2020-10-11 15:22:27,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39086 states. [2020-10-11 15:22:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39086 states to 39086 states and 205652 transitions. [2020-10-11 15:22:27,282 INFO L78 Accepts]: Start accepts. Automaton has 39086 states and 205652 transitions. Word has length 29 [2020-10-11 15:22:27,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:27,283 INFO L481 AbstractCegarLoop]: Abstraction has 39086 states and 205652 transitions. [2020-10-11 15:22:27,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 39086 states and 205652 transitions. [2020-10-11 15:22:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:27,291 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:27,291 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:27,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2020-10-11 15:22:27,291 INFO L429 AbstractCegarLoop]: === Iteration 97 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:22:27,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:27,291 INFO L82 PathProgramCache]: Analyzing trace with hash -526148794, now seen corresponding path program 5 times [2020-10-11 15:22:27,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:27,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809535887] [2020-10-11 15:22:27,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:27,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809535887] [2020-10-11 15:22:27,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:27,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:27,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417223096] [2020-10-11 15:22:27,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:27,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:27,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:27,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:27,344 INFO L87 Difference]: Start difference. First operand 39086 states and 205652 transitions. Second operand 9 states. [2020-10-11 15:22:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:28,680 INFO L93 Difference]: Finished difference Result 130414 states and 601082 transitions. [2020-10-11 15:22:28,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:28,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:29,060 INFO L225 Difference]: With dead ends: 130414 [2020-10-11 15:22:29,060 INFO L226 Difference]: Without dead ends: 130370 [2020-10-11 15:22:29,060 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130370 states. [2020-10-11 15:22:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130370 to 38758. [2020-10-11 15:22:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38758 states. [2020-10-11 15:22:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38758 states to 38758 states and 203866 transitions. [2020-10-11 15:22:32,624 INFO L78 Accepts]: Start accepts. Automaton has 38758 states and 203866 transitions. Word has length 29 [2020-10-11 15:22:32,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:32,624 INFO L481 AbstractCegarLoop]: Abstraction has 38758 states and 203866 transitions. [2020-10-11 15:22:32,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 38758 states and 203866 transitions. [2020-10-11 15:22:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:32,633 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:32,633 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:32,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2020-10-11 15:22:32,633 INFO L429 AbstractCegarLoop]: === Iteration 98 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:22:32,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:32,633 INFO L82 PathProgramCache]: Analyzing trace with hash -526111253, now seen corresponding path program 3 times [2020-10-11 15:22:32,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:32,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297546562] [2020-10-11 15:22:32,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:32,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297546562] [2020-10-11 15:22:32,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:32,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:32,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995775121] [2020-10-11 15:22:32,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:32,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:32,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:32,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:32,686 INFO L87 Difference]: Start difference. First operand 38758 states and 203866 transitions. Second operand 9 states. [2020-10-11 15:22:34,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:34,016 INFO L93 Difference]: Finished difference Result 129953 states and 599494 transitions. [2020-10-11 15:22:34,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:34,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:34,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:34,405 INFO L225 Difference]: With dead ends: 129953 [2020-10-11 15:22:34,405 INFO L226 Difference]: Without dead ends: 129909 [2020-10-11 15:22:34,405 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:35,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129909 states. [2020-10-11 15:22:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129909 to 38350. [2020-10-11 15:22:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38350 states. [2020-10-11 15:22:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38350 states to 38350 states and 201720 transitions. [2020-10-11 15:22:37,220 INFO L78 Accepts]: Start accepts. Automaton has 38350 states and 201720 transitions. Word has length 29 [2020-10-11 15:22:37,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:37,220 INFO L481 AbstractCegarLoop]: Abstraction has 38350 states and 201720 transitions. [2020-10-11 15:22:37,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 38350 states and 201720 transitions. [2020-10-11 15:22:37,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:37,228 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:37,228 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:37,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2020-10-11 15:22:37,228 INFO L429 AbstractCegarLoop]: === Iteration 99 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:22:37,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:37,228 INFO L82 PathProgramCache]: Analyzing trace with hash -541000429, now seen corresponding path program 6 times [2020-10-11 15:22:37,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:37,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883662565] [2020-10-11 15:22:37,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:37,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883662565] [2020-10-11 15:22:37,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:37,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:37,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512987904] [2020-10-11 15:22:37,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:37,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:37,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:37,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:37,281 INFO L87 Difference]: Start difference. First operand 38350 states and 201720 transitions. Second operand 9 states. [2020-10-11 15:22:38,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:38,577 INFO L93 Difference]: Finished difference Result 128408 states and 591144 transitions. [2020-10-11 15:22:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:38,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:38,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:38,950 INFO L225 Difference]: With dead ends: 128408 [2020-10-11 15:22:38,951 INFO L226 Difference]: Without dead ends: 128349 [2020-10-11 15:22:38,951 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:40,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128349 states. [2020-10-11 15:22:42,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128349 to 37756. [2020-10-11 15:22:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37756 states. [2020-10-11 15:22:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37756 states to 37756 states and 198597 transitions. [2020-10-11 15:22:42,390 INFO L78 Accepts]: Start accepts. Automaton has 37756 states and 198597 transitions. Word has length 29 [2020-10-11 15:22:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:42,391 INFO L481 AbstractCegarLoop]: Abstraction has 37756 states and 198597 transitions. [2020-10-11 15:22:42,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 37756 states and 198597 transitions. [2020-10-11 15:22:42,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:42,399 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:42,399 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:42,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2020-10-11 15:22:42,399 INFO L429 AbstractCegarLoop]: === Iteration 100 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:22:42,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:42,399 INFO L82 PathProgramCache]: Analyzing trace with hash -540999034, now seen corresponding path program 6 times [2020-10-11 15:22:42,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:42,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85591458] [2020-10-11 15:22:42,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:42,451 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:42,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85591458] [2020-10-11 15:22:42,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:42,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:42,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982454091] [2020-10-11 15:22:42,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:42,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:42,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:42,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:42,453 INFO L87 Difference]: Start difference. First operand 37756 states and 198597 transitions. Second operand 9 states. [2020-10-11 15:22:43,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:43,858 INFO L93 Difference]: Finished difference Result 127321 states and 585958 transitions. [2020-10-11 15:22:43,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:43,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:43,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:44,228 INFO L225 Difference]: With dead ends: 127321 [2020-10-11 15:22:44,229 INFO L226 Difference]: Without dead ends: 127262 [2020-10-11 15:22:44,229 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:45,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127262 states. [2020-10-11 15:22:46,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127262 to 36966. [2020-10-11 15:22:46,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36966 states. [2020-10-11 15:22:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36966 states to 36966 states and 194506 transitions. [2020-10-11 15:22:47,043 INFO L78 Accepts]: Start accepts. Automaton has 36966 states and 194506 transitions. Word has length 29 [2020-10-11 15:22:47,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:47,043 INFO L481 AbstractCegarLoop]: Abstraction has 36966 states and 194506 transitions. [2020-10-11 15:22:47,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:47,043 INFO L276 IsEmpty]: Start isEmpty. Operand 36966 states and 194506 transitions. [2020-10-11 15:22:47,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:47,051 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:47,051 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:47,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2020-10-11 15:22:47,051 INFO L429 AbstractCegarLoop]: === Iteration 101 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:22:47,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:47,051 INFO L82 PathProgramCache]: Analyzing trace with hash -540976962, now seen corresponding path program 3 times [2020-10-11 15:22:47,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:47,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117721445] [2020-10-11 15:22:47,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:47,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117721445] [2020-10-11 15:22:47,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:47,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:47,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544926121] [2020-10-11 15:22:47,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:47,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:47,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:47,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:47,102 INFO L87 Difference]: Start difference. First operand 36966 states and 194506 transitions. Second operand 9 states. [2020-10-11 15:22:48,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:48,447 INFO L93 Difference]: Finished difference Result 127898 states and 589602 transitions. [2020-10-11 15:22:48,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:48,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:48,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:48,830 INFO L225 Difference]: With dead ends: 127898 [2020-10-11 15:22:48,830 INFO L226 Difference]: Without dead ends: 127854 [2020-10-11 15:22:48,831 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:50,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127854 states. [2020-10-11 15:22:52,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127854 to 36674. [2020-10-11 15:22:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36674 states. [2020-10-11 15:22:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36674 states to 36674 states and 193006 transitions. [2020-10-11 15:22:52,204 INFO L78 Accepts]: Start accepts. Automaton has 36674 states and 193006 transitions. Word has length 29 [2020-10-11 15:22:52,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:52,204 INFO L481 AbstractCegarLoop]: Abstraction has 36674 states and 193006 transitions. [2020-10-11 15:22:52,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 36674 states and 193006 transitions. [2020-10-11 15:22:52,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:52,212 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:52,212 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:52,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2020-10-11 15:22:52,213 INFO L429 AbstractCegarLoop]: === Iteration 102 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:22:52,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:52,213 INFO L82 PathProgramCache]: Analyzing trace with hash -504923528, now seen corresponding path program 4 times [2020-10-11 15:22:52,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:52,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484727605] [2020-10-11 15:22:52,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:52,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484727605] [2020-10-11 15:22:52,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:52,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:52,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523508856] [2020-10-11 15:22:52,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:52,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:52,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:52,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:52,268 INFO L87 Difference]: Start difference. First operand 36674 states and 193006 transitions. Second operand 9 states. [2020-10-11 15:22:53,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:53,585 INFO L93 Difference]: Finished difference Result 128860 states and 594173 transitions. [2020-10-11 15:22:53,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:53,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:53,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:53,957 INFO L225 Difference]: With dead ends: 128860 [2020-10-11 15:22:53,957 INFO L226 Difference]: Without dead ends: 128801 [2020-10-11 15:22:53,957 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:55,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128801 states. [2020-10-11 15:22:56,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128801 to 36922. [2020-10-11 15:22:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36922 states. [2020-10-11 15:22:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36922 states to 36922 states and 194255 transitions. [2020-10-11 15:22:56,686 INFO L78 Accepts]: Start accepts. Automaton has 36922 states and 194255 transitions. Word has length 29 [2020-10-11 15:22:56,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:22:56,687 INFO L481 AbstractCegarLoop]: Abstraction has 36922 states and 194255 transitions. [2020-10-11 15:22:56,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:22:56,687 INFO L276 IsEmpty]: Start isEmpty. Operand 36922 states and 194255 transitions. [2020-10-11 15:22:56,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:22:56,694 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:22:56,694 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:22:56,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2020-10-11 15:22:56,694 INFO L429 AbstractCegarLoop]: === Iteration 103 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:22:56,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:22:56,695 INFO L82 PathProgramCache]: Analyzing trace with hash -504922133, now seen corresponding path program 4 times [2020-10-11 15:22:56,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:22:56,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551257377] [2020-10-11 15:22:56,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:22:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:22:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:22:56,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551257377] [2020-10-11 15:22:56,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:22:56,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:22:56,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642617538] [2020-10-11 15:22:56,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:22:56,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:22:56,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:22:56,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:22:56,744 INFO L87 Difference]: Start difference. First operand 36922 states and 194255 transitions. Second operand 9 states. [2020-10-11 15:22:58,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:22:58,064 INFO L93 Difference]: Finished difference Result 127746 states and 588973 transitions. [2020-10-11 15:22:58,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:22:58,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:22:58,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:22:58,446 INFO L225 Difference]: With dead ends: 127746 [2020-10-11 15:22:58,446 INFO L226 Difference]: Without dead ends: 127687 [2020-10-11 15:22:58,447 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:22:59,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127687 states. [2020-10-11 15:23:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127687 to 36885. [2020-10-11 15:23:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36885 states. [2020-10-11 15:23:01,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36885 states to 36885 states and 194028 transitions. [2020-10-11 15:23:01,734 INFO L78 Accepts]: Start accepts. Automaton has 36885 states and 194028 transitions. Word has length 29 [2020-10-11 15:23:01,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:23:01,734 INFO L481 AbstractCegarLoop]: Abstraction has 36885 states and 194028 transitions. [2020-10-11 15:23:01,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:23:01,734 INFO L276 IsEmpty]: Start isEmpty. Operand 36885 states and 194028 transitions. [2020-10-11 15:23:01,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:23:01,742 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:01,742 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:23:01,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2020-10-11 15:23:01,742 INFO L429 AbstractCegarLoop]: === Iteration 104 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:23:01,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:01,743 INFO L82 PathProgramCache]: Analyzing trace with hash -504937602, now seen corresponding path program 4 times [2020-10-11 15:23:01,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:01,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238415020] [2020-10-11 15:23:01,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:23:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:23:01,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238415020] [2020-10-11 15:23:01,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:23:01,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:23:01,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064126002] [2020-10-11 15:23:01,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:23:01,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:23:01,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:23:01,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:23:01,797 INFO L87 Difference]: Start difference. First operand 36885 states and 194028 transitions. Second operand 9 states. [2020-10-11 15:23:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:23:03,241 INFO L93 Difference]: Finished difference Result 126643 states and 584111 transitions. [2020-10-11 15:23:03,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:23:03,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:23:03,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:03,620 INFO L225 Difference]: With dead ends: 126643 [2020-10-11 15:23:03,620 INFO L226 Difference]: Without dead ends: 126584 [2020-10-11 15:23:03,620 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:23:04,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126584 states. [2020-10-11 15:23:06,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126584 to 36688. [2020-10-11 15:23:06,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36688 states. [2020-10-11 15:23:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36688 states to 36688 states and 192991 transitions. [2020-10-11 15:23:06,381 INFO L78 Accepts]: Start accepts. Automaton has 36688 states and 192991 transitions. Word has length 29 [2020-10-11 15:23:06,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:23:06,381 INFO L481 AbstractCegarLoop]: Abstraction has 36688 states and 192991 transitions. [2020-10-11 15:23:06,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:23:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 36688 states and 192991 transitions. [2020-10-11 15:23:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:23:06,389 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:06,389 INFO L421 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:23:06,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2020-10-11 15:23:06,389 INFO L429 AbstractCegarLoop]: === Iteration 105 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:23:06,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:06,389 INFO L82 PathProgramCache]: Analyzing trace with hash -413562361, now seen corresponding path program 1 times [2020-10-11 15:23:06,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:06,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437036741] [2020-10-11 15:23:06,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:23:06,409 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-10-11 15:23:06,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437036741] [2020-10-11 15:23:06,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:23:06,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:23:06,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029723580] [2020-10-11 15:23:06,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:23:06,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:23:06,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:23:06,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:23:06,411 INFO L87 Difference]: Start difference. First operand 36688 states and 192991 transitions. Second operand 5 states. [2020-10-11 15:23:06,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:23:06,853 INFO L93 Difference]: Finished difference Result 61979 states and 317658 transitions. [2020-10-11 15:23:06,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:23:06,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-10-11 15:23:06,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:07,047 INFO L225 Difference]: With dead ends: 61979 [2020-10-11 15:23:07,047 INFO L226 Difference]: Without dead ends: 61915 [2020-10-11 15:23:07,048 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:23:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61915 states. [2020-10-11 15:23:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61915 to 45529. [2020-10-11 15:23:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45529 states. [2020-10-11 15:23:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45529 states to 45529 states and 238865 transitions. [2020-10-11 15:23:08,835 INFO L78 Accepts]: Start accepts. Automaton has 45529 states and 238865 transitions. Word has length 29 [2020-10-11 15:23:08,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:23:08,835 INFO L481 AbstractCegarLoop]: Abstraction has 45529 states and 238865 transitions. [2020-10-11 15:23:08,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:23:08,835 INFO L276 IsEmpty]: Start isEmpty. Operand 45529 states and 238865 transitions. [2020-10-11 15:23:08,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:23:08,842 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:08,842 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:23:08,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2020-10-11 15:23:08,843 INFO L429 AbstractCegarLoop]: === Iteration 106 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:23:08,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:08,843 INFO L82 PathProgramCache]: Analyzing trace with hash 613734392, now seen corresponding path program 5 times [2020-10-11 15:23:08,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:08,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903712576] [2020-10-11 15:23:08,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:23:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:23:09,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903712576] [2020-10-11 15:23:09,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:23:09,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:23:09,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243163327] [2020-10-11 15:23:09,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:23:09,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:23:09,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:23:09,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:23:09,496 INFO L87 Difference]: Start difference. First operand 45529 states and 238865 transitions. Second operand 9 states. [2020-10-11 15:23:10,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:23:10,922 INFO L93 Difference]: Finished difference Result 150731 states and 702613 transitions. [2020-10-11 15:23:10,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:23:10,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:23:10,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:11,365 INFO L225 Difference]: With dead ends: 150731 [2020-10-11 15:23:11,365 INFO L226 Difference]: Without dead ends: 150675 [2020-10-11 15:23:11,366 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:23:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150675 states. [2020-10-11 15:23:14,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150675 to 46190. [2020-10-11 15:23:14,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46190 states. [2020-10-11 15:23:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46190 states to 46190 states and 242332 transitions. [2020-10-11 15:23:14,605 INFO L78 Accepts]: Start accepts. Automaton has 46190 states and 242332 transitions. Word has length 29 [2020-10-11 15:23:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:23:14,605 INFO L481 AbstractCegarLoop]: Abstraction has 46190 states and 242332 transitions. [2020-10-11 15:23:14,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:23:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 46190 states and 242332 transitions. [2020-10-11 15:23:14,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:23:14,614 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:14,614 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:23:14,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2020-10-11 15:23:14,614 INFO L429 AbstractCegarLoop]: === Iteration 107 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:23:14,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:14,614 INFO L82 PathProgramCache]: Analyzing trace with hash 613735787, now seen corresponding path program 5 times [2020-10-11 15:23:14,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:14,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210858207] [2020-10-11 15:23:14,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:23:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:23:14,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210858207] [2020-10-11 15:23:14,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:23:14,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:23:14,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69033283] [2020-10-11 15:23:14,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:23:14,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:23:14,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:23:14,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:23:14,667 INFO L87 Difference]: Start difference. First operand 46190 states and 242332 transitions. Second operand 9 states. [2020-10-11 15:23:16,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:23:16,085 INFO L93 Difference]: Finished difference Result 149511 states and 696801 transitions. [2020-10-11 15:23:16,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:23:16,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:23:16,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:16,533 INFO L225 Difference]: With dead ends: 149511 [2020-10-11 15:23:16,533 INFO L226 Difference]: Without dead ends: 149455 [2020-10-11 15:23:16,534 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:23:17,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149455 states. [2020-10-11 15:23:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149455 to 46554. [2020-10-11 15:23:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46554 states. [2020-10-11 15:23:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46554 states to 46554 states and 244235 transitions. [2020-10-11 15:23:20,581 INFO L78 Accepts]: Start accepts. Automaton has 46554 states and 244235 transitions. Word has length 29 [2020-10-11 15:23:20,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:23:20,581 INFO L481 AbstractCegarLoop]: Abstraction has 46554 states and 244235 transitions. [2020-10-11 15:23:20,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:23:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 46554 states and 244235 transitions. [2020-10-11 15:23:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:23:20,590 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:20,590 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:23:20,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2020-10-11 15:23:20,590 INFO L429 AbstractCegarLoop]: === Iteration 108 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:23:20,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:20,590 INFO L82 PathProgramCache]: Analyzing trace with hash 613720318, now seen corresponding path program 5 times [2020-10-11 15:23:20,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:20,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269486601] [2020-10-11 15:23:20,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:23:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:23:20,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269486601] [2020-10-11 15:23:20,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:23:20,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:23:20,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81765953] [2020-10-11 15:23:20,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:23:20,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:23:20,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:23:20,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:23:20,641 INFO L87 Difference]: Start difference. First operand 46554 states and 244235 transitions. Second operand 9 states. [2020-10-11 15:23:22,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:23:22,104 INFO L93 Difference]: Finished difference Result 148338 states and 691501 transitions. [2020-10-11 15:23:22,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:23:22,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:23:22,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:22,543 INFO L225 Difference]: With dead ends: 148338 [2020-10-11 15:23:22,544 INFO L226 Difference]: Without dead ends: 148282 [2020-10-11 15:23:22,544 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:23:24,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148282 states. [2020-10-11 15:23:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148282 to 46429. [2020-10-11 15:23:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46429 states. [2020-10-11 15:23:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46429 states to 46429 states and 243498 transitions. [2020-10-11 15:23:25,827 INFO L78 Accepts]: Start accepts. Automaton has 46429 states and 243498 transitions. Word has length 29 [2020-10-11 15:23:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:23:25,828 INFO L481 AbstractCegarLoop]: Abstraction has 46429 states and 243498 transitions. [2020-10-11 15:23:25,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:23:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 46429 states and 243498 transitions. [2020-10-11 15:23:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:23:25,836 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:25,836 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:23:25,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2020-10-11 15:23:25,836 INFO L429 AbstractCegarLoop]: === Iteration 109 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:23:25,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:25,836 INFO L82 PathProgramCache]: Analyzing trace with hash 614716472, now seen corresponding path program 6 times [2020-10-11 15:23:25,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:25,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260267275] [2020-10-11 15:23:25,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:23:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:23:25,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260267275] [2020-10-11 15:23:25,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:23:25,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:23:25,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653956348] [2020-10-11 15:23:25,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:23:25,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:23:25,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:23:25,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:23:25,890 INFO L87 Difference]: Start difference. First operand 46429 states and 243498 transitions. Second operand 9 states. [2020-10-11 15:23:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:23:27,354 INFO L93 Difference]: Finished difference Result 148415 states and 691326 transitions. [2020-10-11 15:23:27,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:23:27,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:23:27,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:27,802 INFO L225 Difference]: With dead ends: 148415 [2020-10-11 15:23:27,802 INFO L226 Difference]: Without dead ends: 148344 [2020-10-11 15:23:27,803 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:23:30,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148344 states. [2020-10-11 15:23:31,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148344 to 45169. [2020-10-11 15:23:31,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45169 states. [2020-10-11 15:23:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45169 states to 45169 states and 236894 transitions. [2020-10-11 15:23:31,681 INFO L78 Accepts]: Start accepts. Automaton has 45169 states and 236894 transitions. Word has length 29 [2020-10-11 15:23:31,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:23:31,682 INFO L481 AbstractCegarLoop]: Abstraction has 45169 states and 236894 transitions. [2020-10-11 15:23:31,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:23:31,682 INFO L276 IsEmpty]: Start isEmpty. Operand 45169 states and 236894 transitions. [2020-10-11 15:23:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:23:31,690 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:31,690 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:23:31,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2020-10-11 15:23:31,690 INFO L429 AbstractCegarLoop]: === Iteration 110 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:23:31,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:31,690 INFO L82 PathProgramCache]: Analyzing trace with hash 616057067, now seen corresponding path program 6 times [2020-10-11 15:23:31,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:31,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591002029] [2020-10-11 15:23:31,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:23:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:23:31,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591002029] [2020-10-11 15:23:31,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:23:31,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:23:31,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763669275] [2020-10-11 15:23:31,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:23:31,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:23:31,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:23:31,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:23:31,742 INFO L87 Difference]: Start difference. First operand 45169 states and 236894 transitions. Second operand 9 states. [2020-10-11 15:23:33,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:23:33,265 INFO L93 Difference]: Finished difference Result 147425 states and 686023 transitions. [2020-10-11 15:23:33,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:23:33,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:23:33,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:33,698 INFO L225 Difference]: With dead ends: 147425 [2020-10-11 15:23:33,698 INFO L226 Difference]: Without dead ends: 147354 [2020-10-11 15:23:33,698 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:23:35,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147354 states. [2020-10-11 15:23:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147354 to 43980. [2020-10-11 15:23:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43980 states. [2020-10-11 15:23:36,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43980 states to 43980 states and 230752 transitions. [2020-10-11 15:23:36,966 INFO L78 Accepts]: Start accepts. Automaton has 43980 states and 230752 transitions. Word has length 29 [2020-10-11 15:23:36,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:23:36,966 INFO L481 AbstractCegarLoop]: Abstraction has 43980 states and 230752 transitions. [2020-10-11 15:23:36,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:23:36,966 INFO L276 IsEmpty]: Start isEmpty. Operand 43980 states and 230752 transitions. [2020-10-11 15:23:36,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 15:23:36,974 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:36,974 INFO L421 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:23:36,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2020-10-11 15:23:36,974 INFO L429 AbstractCegarLoop]: === Iteration 111 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:23:36,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:36,975 INFO L82 PathProgramCache]: Analyzing trace with hash 601191358, now seen corresponding path program 6 times [2020-10-11 15:23:36,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:36,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862832901] [2020-10-11 15:23:36,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:23:37,025 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-11 15:23:37,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862832901] [2020-10-11 15:23:37,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:23:37,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:23:37,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693267206] [2020-10-11 15:23:37,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:23:37,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:23:37,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:23:37,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:23:37,027 INFO L87 Difference]: Start difference. First operand 43980 states and 230752 transitions. Second operand 9 states. [2020-10-11 15:23:39,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:23:39,045 INFO L93 Difference]: Finished difference Result 146606 states and 682087 transitions. [2020-10-11 15:23:39,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-11 15:23:39,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-11 15:23:39,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:39,484 INFO L225 Difference]: With dead ends: 146606 [2020-10-11 15:23:39,484 INFO L226 Difference]: Without dead ends: 146535 [2020-10-11 15:23:39,484 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-11 15:23:41,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146535 states. [2020-10-11 15:23:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146535 to 42813. [2020-10-11 15:23:42,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42813 states. [2020-10-11 15:23:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42813 states to 42813 states and 224792 transitions. [2020-10-11 15:23:42,701 INFO L78 Accepts]: Start accepts. Automaton has 42813 states and 224792 transitions. Word has length 29 [2020-10-11 15:23:42,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:23:42,702 INFO L481 AbstractCegarLoop]: Abstraction has 42813 states and 224792 transitions. [2020-10-11 15:23:42,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:23:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 42813 states and 224792 transitions. [2020-10-11 15:23:42,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-11 15:23:42,711 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:42,711 INFO L421 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:23:42,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2020-10-11 15:23:42,712 INFO L429 AbstractCegarLoop]: === Iteration 112 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:23:42,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:42,712 INFO L82 PathProgramCache]: Analyzing trace with hash 58023263, now seen corresponding path program 1 times [2020-10-11 15:23:42,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:42,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962784689] [2020-10-11 15:23:42,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:23:42,717 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:23:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:23:42,722 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:23:42,739 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 15:23:42,739 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 15:23:42,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2020-10-11 15:23:42,742 WARN L371 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-11 15:23:42,742 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2020-10-11 15:23:42,760 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,760 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,760 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,760 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,760 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,760 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,761 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,761 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,761 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,761 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,762 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,762 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,762 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,762 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,763 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,763 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,763 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,763 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,763 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,763 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,763 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,763 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,763 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,764 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,764 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,764 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,764 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,764 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread7of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,764 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread7of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,764 WARN L313 ript$VariableManager]: TermVariabe thr2Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,764 WARN L313 ript$VariableManager]: TermVariabe thr2Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,765 WARN L313 ript$VariableManager]: TermVariabe thr2Thread7of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,765 WARN L313 ript$VariableManager]: TermVariabe thr2Thread7of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,765 WARN L313 ript$VariableManager]: TermVariabe thr2Thread7of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,765 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,765 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,765 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,765 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,765 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,765 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,766 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,766 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,766 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,766 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,766 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,766 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,766 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,766 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,767 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,767 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,767 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,767 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,767 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,767 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,778 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,778 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,778 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,778 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,778 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,780 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,781 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,781 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,781 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,781 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,784 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,785 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,785 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,785 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,785 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,789 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,790 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,790 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,790 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,790 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,791 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,791 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,792 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,792 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,792 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,794 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,794 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,794 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,794 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,794 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,795 WARN L313 ript$VariableManager]: TermVariabe thr2Thread7of7ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,796 WARN L313 ript$VariableManager]: TermVariabe thr2Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,796 WARN L313 ript$VariableManager]: TermVariabe thr2Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,796 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,796 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,802 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,803 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,803 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,804 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,804 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,805 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,806 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,806 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,807 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,808 WARN L313 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,808 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:23:42,809 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-10-11 15:23:42,810 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:23:42,810 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:23:42,810 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:23:42,810 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:23:42,810 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:23:42,810 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:23:42,810 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:23:42,810 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:23:42,812 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:23:42,812 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 159 transitions, 472 flow [2020-10-11 15:23:42,812 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 181 places, 159 transitions, 472 flow [2020-10-11 15:23:42,812 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 181 places, 159 transitions, 472 flow [2020-10-11 15:23:42,833 INFO L129 PetriNetUnfolder]: 9/193 cut-off events. [2020-10-11 15:23:42,833 INFO L130 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2020-10-11 15:23:42,835 INFO L80 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 193 events. 9/193 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 334 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 237. Up to 16 conditions per place. [2020-10-11 15:23:42,842 INFO L117 LiptonReduction]: Number of co-enabled transitions 4448 [2020-10-11 15:23:45,512 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-10-11 15:23:45,631 INFO L132 LiptonReduction]: Checked pairs total: 7296 [2020-10-11 15:23:45,631 INFO L134 LiptonReduction]: Total number of compositions: 148 [2020-10-11 15:23:45,632 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 51 transitions, 256 flow [2020-10-11 15:23:55,637 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 55763 states. [2020-10-11 15:23:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 55763 states. [2020-10-11 15:23:55,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-11 15:23:55,637 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:23:55,638 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-11 15:23:55,638 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:23:55,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:23:55,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1622843, now seen corresponding path program 1 times [2020-10-11 15:23:55,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:23:55,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261976096] [2020-10-11 15:23:55,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:23:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:23:55,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:23:55,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261976096] [2020-10-11 15:23:55,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:23:55,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:23:55,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687789720] [2020-10-11 15:23:55,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:23:55,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:23:55,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:23:55,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:23:55,646 INFO L87 Difference]: Start difference. First operand 55763 states. Second operand 3 states. [2020-10-11 15:23:56,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:23:56,045 INFO L93 Difference]: Finished difference Result 54360 states and 318970 transitions. [2020-10-11 15:23:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:23:56,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-11 15:23:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:23:56,228 INFO L225 Difference]: With dead ends: 54360 [2020-10-11 15:23:56,228 INFO L226 Difference]: Without dead ends: 51079 [2020-10-11 15:23:56,229 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:23:59,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51079 states. [2020-10-11 15:24:00,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51079 to 51079. [2020-10-11 15:24:00,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51079 states. [2020-10-11 15:24:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51079 states to 51079 states and 298193 transitions. [2020-10-11 15:24:00,460 INFO L78 Accepts]: Start accepts. Automaton has 51079 states and 298193 transitions. Word has length 3 [2020-10-11 15:24:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:24:00,460 INFO L481 AbstractCegarLoop]: Abstraction has 51079 states and 298193 transitions. [2020-10-11 15:24:00,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:24:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 51079 states and 298193 transitions. [2020-10-11 15:24:00,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 15:24:00,461 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:24:00,461 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:24:00,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2020-10-11 15:24:00,461 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:24:00,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:24:00,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1940021698, now seen corresponding path program 1 times [2020-10-11 15:24:00,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:24:00,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323141761] [2020-10-11 15:24:00,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:24:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:24:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:24:00,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323141761] [2020-10-11 15:24:00,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:24:00,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:24:00,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021663412] [2020-10-11 15:24:00,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:24:00,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:24:00,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:24:00,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:24:00,479 INFO L87 Difference]: Start difference. First operand 51079 states and 298193 transitions. Second operand 5 states. [2020-10-11 15:24:01,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:24:01,130 INFO L93 Difference]: Finished difference Result 96937 states and 538177 transitions. [2020-10-11 15:24:01,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:24:01,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-11 15:24:01,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:24:01,437 INFO L225 Difference]: With dead ends: 96937 [2020-10-11 15:24:01,437 INFO L226 Difference]: Without dead ends: 96928 [2020-10-11 15:24:01,438 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:24:10,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96928 states. [2020-10-11 15:24:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96928 to 61361. [2020-10-11 15:24:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61361 states. [2020-10-11 15:24:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61361 states to 61361 states and 361700 transitions. [2020-10-11 15:24:11,841 INFO L78 Accepts]: Start accepts. Automaton has 61361 states and 361700 transitions. Word has length 9 [2020-10-11 15:24:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:24:11,841 INFO L481 AbstractCegarLoop]: Abstraction has 61361 states and 361700 transitions. [2020-10-11 15:24:11,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:24:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 61361 states and 361700 transitions. [2020-10-11 15:24:11,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 15:24:11,841 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:24:11,841 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:24:11,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2020-10-11 15:24:11,841 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:24:11,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:24:11,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1408430290, now seen corresponding path program 1 times [2020-10-11 15:24:11,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:24:11,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993402694] [2020-10-11 15:24:11,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:24:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:24:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:24:11,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993402694] [2020-10-11 15:24:11,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:24:11,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:24:11,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234502058] [2020-10-11 15:24:11,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:24:11,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:24:11,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:24:11,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:24:11,860 INFO L87 Difference]: Start difference. First operand 61361 states and 361700 transitions. Second operand 5 states. [2020-10-11 15:24:12,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:24:12,660 INFO L93 Difference]: Finished difference Result 115105 states and 647870 transitions. [2020-10-11 15:24:12,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:24:12,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-11 15:24:12,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:24:13,093 INFO L225 Difference]: With dead ends: 115105 [2020-10-11 15:24:13,093 INFO L226 Difference]: Without dead ends: 115086 [2020-10-11 15:24:13,093 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:24:18,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115086 states. [2020-10-11 15:24:20,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115086 to 74729. [2020-10-11 15:24:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74729 states. [2020-10-11 15:24:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74729 states to 74729 states and 446528 transitions. [2020-10-11 15:24:20,421 INFO L78 Accepts]: Start accepts. Automaton has 74729 states and 446528 transitions. Word has length 13 [2020-10-11 15:24:20,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:24:20,421 INFO L481 AbstractCegarLoop]: Abstraction has 74729 states and 446528 transitions. [2020-10-11 15:24:20,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:24:20,422 INFO L276 IsEmpty]: Start isEmpty. Operand 74729 states and 446528 transitions. [2020-10-11 15:24:20,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:24:20,422 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:24:20,422 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:24:20,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2020-10-11 15:24:20,422 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:24:20,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:24:20,422 INFO L82 PathProgramCache]: Analyzing trace with hash 586807343, now seen corresponding path program 1 times [2020-10-11 15:24:20,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:24:20,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492951001] [2020-10-11 15:24:20,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:24:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:24:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:24:20,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492951001] [2020-10-11 15:24:20,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:24:20,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:24:20,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371568861] [2020-10-11 15:24:20,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:24:20,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:24:20,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:24:20,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:24:20,455 INFO L87 Difference]: Start difference. First operand 74729 states and 446528 transitions. Second operand 7 states. [2020-10-11 15:24:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:24:21,891 INFO L93 Difference]: Finished difference Result 183405 states and 977356 transitions. [2020-10-11 15:24:21,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:24:21,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-11 15:24:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:24:22,549 INFO L225 Difference]: With dead ends: 183405 [2020-10-11 15:24:22,549 INFO L226 Difference]: Without dead ends: 183386 [2020-10-11 15:24:22,549 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:24:34,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183386 states. [2020-10-11 15:24:36,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183386 to 74375. [2020-10-11 15:24:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74375 states. [2020-10-11 15:24:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74375 states to 74375 states and 444112 transitions. [2020-10-11 15:24:36,986 INFO L78 Accepts]: Start accepts. Automaton has 74375 states and 444112 transitions. Word has length 15 [2020-10-11 15:24:36,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:24:36,986 INFO L481 AbstractCegarLoop]: Abstraction has 74375 states and 444112 transitions. [2020-10-11 15:24:36,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:24:36,986 INFO L276 IsEmpty]: Start isEmpty. Operand 74375 states and 444112 transitions. [2020-10-11 15:24:36,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:24:36,987 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:24:36,987 INFO L421 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:24:36,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2020-10-11 15:24:36,987 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:24:36,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:24:36,987 INFO L82 PathProgramCache]: Analyzing trace with hash 576093743, now seen corresponding path program 2 times [2020-10-11 15:24:36,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:24:36,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121629793] [2020-10-11 15:24:36,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:24:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:24:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:24:37,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121629793] [2020-10-11 15:24:37,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:24:37,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:24:37,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262723135] [2020-10-11 15:24:37,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:24:37,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:24:37,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:24:37,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:24:37,020 INFO L87 Difference]: Start difference. First operand 74375 states and 444112 transitions. Second operand 7 states. [2020-10-11 15:24:38,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:24:38,381 INFO L93 Difference]: Finished difference Result 188187 states and 1003599 transitions. [2020-10-11 15:24:38,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:24:38,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-11 15:24:38,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:24:40,630 INFO L225 Difference]: With dead ends: 188187 [2020-10-11 15:24:40,631 INFO L226 Difference]: Without dead ends: 188167 [2020-10-11 15:24:40,631 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:24:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188167 states. [2020-10-11 15:24:55,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188167 to 73326. [2020-10-11 15:24:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73326 states. [2020-10-11 15:24:55,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73326 states to 73326 states and 437534 transitions. [2020-10-11 15:24:55,441 INFO L78 Accepts]: Start accepts. Automaton has 73326 states and 437534 transitions. Word has length 15 [2020-10-11 15:24:55,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:24:55,441 INFO L481 AbstractCegarLoop]: Abstraction has 73326 states and 437534 transitions. [2020-10-11 15:24:55,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:24:55,442 INFO L276 IsEmpty]: Start isEmpty. Operand 73326 states and 437534 transitions. [2020-10-11 15:24:55,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-11 15:24:55,442 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:24:55,442 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:24:55,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2020-10-11 15:24:55,442 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:24:55,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:24:55,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1852086090, now seen corresponding path program 1 times [2020-10-11 15:24:55,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:24:55,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000776830] [2020-10-11 15:24:55,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:24:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:24:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:24:55,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000776830] [2020-10-11 15:24:55,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:24:55,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:24:55,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863582618] [2020-10-11 15:24:55,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:24:55,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:24:55,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:24:55,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:24:55,463 INFO L87 Difference]: Start difference. First operand 73326 states and 437534 transitions. Second operand 5 states. [2020-10-11 15:24:56,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:24:56,483 INFO L93 Difference]: Finished difference Result 136306 states and 779274 transitions. [2020-10-11 15:24:56,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:24:56,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-11 15:24:56,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:24:57,016 INFO L225 Difference]: With dead ends: 136306 [2020-10-11 15:24:57,016 INFO L226 Difference]: Without dead ends: 136270 [2020-10-11 15:24:57,016 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:25:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136270 states. [2020-10-11 15:25:04,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136270 to 91328. [2020-10-11 15:25:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91328 states. [2020-10-11 15:25:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91328 states to 91328 states and 551878 transitions. [2020-10-11 15:25:05,420 INFO L78 Accepts]: Start accepts. Automaton has 91328 states and 551878 transitions. Word has length 17 [2020-10-11 15:25:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:25:05,420 INFO L481 AbstractCegarLoop]: Abstraction has 91328 states and 551878 transitions. [2020-10-11 15:25:05,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:25:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 91328 states and 551878 transitions. [2020-10-11 15:25:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:25:05,421 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:25:05,421 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:25:05,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2020-10-11 15:25:05,421 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:25:05,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:25:05,421 INFO L82 PathProgramCache]: Analyzing trace with hash 805259199, now seen corresponding path program 1 times [2020-10-11 15:25:05,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:25:05,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039107837] [2020-10-11 15:25:05,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:25:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:25:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:25:05,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039107837] [2020-10-11 15:25:05,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149113817] [2020-10-11 15:25:05,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:25:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:25:05,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-11 15:25:05,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-11 15:25:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-11 15:25:05,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-11 15:25:05,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-10-11 15:25:05,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804636051] [2020-10-11 15:25:05,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:25:05,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:25:05,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:25:05,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:25:05,551 INFO L87 Difference]: Start difference. First operand 91328 states and 551878 transitions. Second operand 7 states. [2020-10-11 15:25:07,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:25:07,144 INFO L93 Difference]: Finished difference Result 220702 states and 1196059 transitions. [2020-10-11 15:25:07,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:25:07,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:25:07,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:25:10,049 INFO L225 Difference]: With dead ends: 220702 [2020-10-11 15:25:10,049 INFO L226 Difference]: Without dead ends: 220672 [2020-10-11 15:25:10,049 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:25:15,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220672 states. [2020-10-11 15:25:26,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220672 to 92876. [2020-10-11 15:25:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92876 states. [2020-10-11 15:25:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92876 states to 92876 states and 560664 transitions. [2020-10-11 15:25:26,489 INFO L78 Accepts]: Start accepts. Automaton has 92876 states and 560664 transitions. Word has length 19 [2020-10-11 15:25:26,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:25:26,489 INFO L481 AbstractCegarLoop]: Abstraction has 92876 states and 560664 transitions. [2020-10-11 15:25:26,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 15:25:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 92876 states and 560664 transitions. [2020-10-11 15:25:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 15:25:26,490 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:25:26,490 INFO L421 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:25:26,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193,79 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-11 15:25:26,690 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:25:26,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:25:26,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1738279999, now seen corresponding path program 2 times [2020-10-11 15:25:26,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:25:26,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494646092] [2020-10-11 15:25:26,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:25:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:25:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-11 15:25:26,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494646092] [2020-10-11 15:25:26,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:25:26,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:25:26,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938448804] [2020-10-11 15:25:26,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 15:25:26,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:25:26,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 15:25:26,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:25:26,729 INFO L87 Difference]: Start difference. First operand 92876 states and 560664 transitions. Second operand 7 states. [2020-10-11 15:25:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:25:28,358 INFO L93 Difference]: Finished difference Result 226856 states and 1230554 transitions. [2020-10-11 15:25:28,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 15:25:28,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 15:25:28,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:25:31,142 INFO L225 Difference]: With dead ends: 226856 [2020-10-11 15:25:31,142 INFO L226 Difference]: Without dead ends: 226815 [2020-10-11 15:25:31,142 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-11 15:25:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226815 states. Received shutdown request... [2020-10-11 15:25:44,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2020-10-11 15:25:44,844 WARN L546 AbstractCegarLoop]: Verification canceled [2020-10-11 15:25:44,846 WARN L235 ceAbstractionStarter]: Timeout [2020-10-11 15:25:44,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:25:44 BasicIcfg [2020-10-11 15:25:44,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 15:25:44,848 INFO L168 Benchmark]: Toolchain (without parser) took 772835.60 ms. Allocated memory was 252.7 MB in the beginning and 5.4 GB in the end (delta: 5.1 GB). Free memory was 207.9 MB in the beginning and 3.9 GB in the end (delta: -3.7 GB). Peak memory consumption was 6.2 GB. Max. memory is 14.2 GB. [2020-10-11 15:25:44,848 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 15:25:44,848 INFO L168 Benchmark]: CACSL2BoogieTranslator took 649.99 ms. Allocated memory was 252.7 MB in the beginning and 317.2 MB in the end (delta: 64.5 MB). Free memory was 207.9 MB in the beginning and 272.6 MB in the end (delta: -64.7 MB). Peak memory consumption was 32.9 MB. Max. memory is 14.2 GB. [2020-10-11 15:25:44,849 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.89 ms. Allocated memory is still 317.2 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 15:25:44,849 INFO L168 Benchmark]: Boogie Preprocessor took 53.89 ms. Allocated memory is still 317.2 MB. Free memory was 272.6 MB in the beginning and 270.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 15:25:44,849 INFO L168 Benchmark]: RCFGBuilder took 446.91 ms. Allocated memory is still 317.2 MB. Free memory was 270.1 MB in the beginning and 250.8 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 14.2 GB. [2020-10-11 15:25:44,849 INFO L168 Benchmark]: TraceAbstraction took 771631.00 ms. Allocated memory was 317.2 MB in the beginning and 5.4 GB in the end (delta: 5.1 GB). Free memory was 250.8 MB in the beginning and 3.9 GB in the end (delta: -3.6 GB). Peak memory consumption was 6.2 GB. Max. memory is 14.2 GB. [2020-10-11 15:25:44,850 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 649.99 ms. Allocated memory was 252.7 MB in the beginning and 317.2 MB in the end (delta: 64.5 MB). Free memory was 207.9 MB in the beginning and 272.6 MB in the end (delta: -64.7 MB). Peak memory consumption was 32.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 48.89 ms. Allocated memory is still 317.2 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * Boogie Preprocessor took 53.89 ms. Allocated memory is still 317.2 MB. Free memory was 272.6 MB in the beginning and 270.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 446.91 ms. Allocated memory is still 317.2 MB. Free memory was 270.1 MB in the beginning and 250.8 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 771631.00 ms. Allocated memory was 317.2 MB in the beginning and 5.4 GB in the end (delta: 5.1 GB). Free memory was 250.8 MB in the beginning and 3.9 GB in the end (delta: -3.6 GB). Peak memory consumption was 6.2 GB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 484 VarBasedMoverChecksPositive, 4 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 4 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 3 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 1.2s, 55 PlacesBefore, 18 PlacesAfterwards, 51 TransitionsBefore, 12 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 5 FixpointIterations, 13 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 47 TotalNumberOfCompositions, 670 MoverChecksTotal - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 726 VarBasedMoverChecksPositive, 8 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 8 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 32 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 1.2s, 76 PlacesBefore, 31 PlacesAfterwards, 69 TransitionsBefore, 21 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 5 FixpointIterations, 25 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 5 ConcurrentYvCompositions, 3 ChoiceCompositions, 62 TotalNumberOfCompositions, 1240 MoverChecksTotal - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 945 VarBasedMoverChecksPositive, 18 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 18 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 39 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 1.4s, 97 PlacesBefore, 41 PlacesAfterwards, 87 TransitionsBefore, 27 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 5 FixpointIterations, 32 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 77 TotalNumberOfCompositions, 2157 MoverChecksTotal - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1337 VarBasedMoverChecksPositive, 21 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 21 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 76 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 1.6s, 118 PlacesBefore, 51 PlacesAfterwards, 105 TransitionsBefore, 33 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 5 FixpointIterations, 43 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 5 ConcurrentYvCompositions, 5 ChoiceCompositions, 97 TotalNumberOfCompositions, 2978 MoverChecksTotal - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1675 VarBasedMoverChecksPositive, 29 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 29 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 63 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 1.7s, 139 PlacesBefore, 61 PlacesAfterwards, 123 TransitionsBefore, 39 TransitionsAfterwards, 2860 CoEnabledTransitionPairs, 5 FixpointIterations, 59 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 5 ConcurrentYvCompositions, 6 ChoiceCompositions, 121 TotalNumberOfCompositions, 4168 MoverChecksTotal - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2181 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 36 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 113 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.0s, 160 PlacesBefore, 71 PlacesAfterwards, 141 TransitionsBefore, 45 TransitionsAfterwards, 3612 CoEnabledTransitionPairs, 5 FixpointIterations, 66 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 4 ConcurrentYvCompositions, 7 ChoiceCompositions, 134 TotalNumberOfCompositions, 5372 MoverChecksTotal - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2735 VarBasedMoverChecksPositive, 40 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 127 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.8s, 181 PlacesBefore, 81 PlacesAfterwards, 159 TransitionsBefore, 51 TransitionsAfterwards, 4448 CoEnabledTransitionPairs, 5 FixpointIterations, 74 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 14 TrivialYvCompositions, 3 ConcurrentYvCompositions, 8 ChoiceCompositions, 148 TotalNumberOfCompositions, 7296 MoverChecksTotal - TimeoutResultAtElement [Line: 679]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 679). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 1 error locations. Started 7 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 771.2s, OverallIterations: 195, TraceHistogramMax: 7, AutomataDifference: 254.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 24.2s, HoareTripleCheckerStatistics: 15762 SDtfs, 49020 SDslu, 58008 SDs, 0 SdLazy, 65279 SolverSat, 5062 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6852 GetRequests, 1694 SyntacticMatches, 0 SemanticMatches, 5158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60629 ImplicationChecksByTransitivity, 52.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92876occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 453.7s AutomataMinimizationTime, 189 MinimizatonAttempts, 11135395 StatesRemovedByMinimization, 180 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 6309 NumberOfCodeBlocks, 6233 NumberOfCodeBlocksAsserted, 328 NumberOfCheckSat, 5924 ConstructedInterpolants, 0 QuantifiedInterpolants, 422232 SizeOfPredicates, 456 NumberOfNonLiveVariables, 9748 ConjunctsInSsa, 612 ConjunctsInUnsatCore, 267 InterpolantComputations, 111 PerfectInterpolantSequences, 3228/4674 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown