/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread/fib_bench_longest-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:25:27,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:25:27,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:25:27,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:25:27,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:25:27,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:25:27,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:25:27,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:25:27,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:25:27,959 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:25:27,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:25:27,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:25:27,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:25:27,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:25:27,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:25:27,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:25:27,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:25:27,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:25:27,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:25:27,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:25:27,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:25:27,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:25:27,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:25:27,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:25:27,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:25:27,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:25:27,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:25:27,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:25:27,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:25:27,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:25:27,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:25:27,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:25:27,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:25:28,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:25:28,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:25:28,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:25:28,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:25:28,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:25:28,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:25:28,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:25:28,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:25:28,005 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-MCR.epf [2019-12-27 23:25:28,032 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:25:28,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:25:28,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:25:28,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:25:28,041 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:25:28,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:25:28,041 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:25:28,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:25:28,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:25:28,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:25:28,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:25:28,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:25:28,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:25:28,043 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:25:28,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:25:28,043 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:25:28,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:25:28,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:25:28,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:25:28,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:25:28,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:25:28,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:25:28,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:25:28,046 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:25:28,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:25:28,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:25:28,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:25:28,048 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:25:28,049 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 23:25:28,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:25:28,049 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:25:28,049 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:25:28,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:25:28,347 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:25:28,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:25:28,352 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:25:28,354 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:25:28,355 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_bench_longest-1.i [2019-12-27 23:25:28,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9b2abff6/3d0fb8e27c00474a977dc324ca8c6690/FLAG059427423 [2019-12-27 23:25:29,007 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:25:29,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_bench_longest-1.i [2019-12-27 23:25:29,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9b2abff6/3d0fb8e27c00474a977dc324ca8c6690/FLAG059427423 [2019-12-27 23:25:29,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9b2abff6/3d0fb8e27c00474a977dc324ca8c6690 [2019-12-27 23:25:29,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:25:29,266 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:25:29,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:25:29,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:25:29,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:25:29,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:25:29" (1/1) ... [2019-12-27 23:25:29,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a34fe12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:25:29, skipping insertion in model container [2019-12-27 23:25:29,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:25:29" (1/1) ... [2019-12-27 23:25:29,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:25:29,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:25:29,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:25:29,850 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:25:29,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:25:29,976 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:25:29,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:25:29 WrapperNode [2019-12-27 23:25:29,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:25:29,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:25:29,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:25:29,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:25:29,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:25:29" (1/1) ... [2019-12-27 23:25:30,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:25:29" (1/1) ... [2019-12-27 23:25:30,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:25:30,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:25:30,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:25:30,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:25:30,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:25:29" (1/1) ... [2019-12-27 23:25:30,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:25:29" (1/1) ... [2019-12-27 23:25:30,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:25:29" (1/1) ... [2019-12-27 23:25:30,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:25:29" (1/1) ... [2019-12-27 23:25:30,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:25:29" (1/1) ... [2019-12-27 23:25:30,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:25:29" (1/1) ... [2019-12-27 23:25:30,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:25:29" (1/1) ... [2019-12-27 23:25:30,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:25:30,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:25:30,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:25:30,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:25:30,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:25:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:25:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 23:25:30,145 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 23:25:30,145 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 23:25:30,146 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 23:25:30,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:25:30,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 23:25:30,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:25:30,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:25:30,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 23:25:30,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:25:30,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:25:30,149 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 23:25:30,491 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:25:30,492 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 23:25:30,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:25:30 BoogieIcfgContainer [2019-12-27 23:25:30,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:25:30,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:25:30,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:25:30,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:25:30,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:25:29" (1/3) ... [2019-12-27 23:25:30,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aab0965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:25:30, skipping insertion in model container [2019-12-27 23:25:30,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:25:29" (2/3) ... [2019-12-27 23:25:30,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aab0965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:25:30, skipping insertion in model container [2019-12-27 23:25:30,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:25:30" (3/3) ... [2019-12-27 23:25:30,503 INFO L109 eAbstractionObserver]: Analyzing ICFG fib_bench_longest-1.i [2019-12-27 23:25:30,513 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:25:30,514 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:25:30,519 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 23:25:30,520 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:25:30,544 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,544 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,544 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,545 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,545 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,546 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,546 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,546 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,546 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,547 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,547 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,547 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,547 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,547 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,548 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,548 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,548 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,549 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,549 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,549 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,549 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,549 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,550 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,550 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,550 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,550 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,551 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,551 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,551 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,551 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,555 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,556 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,556 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,556 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,556 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,557 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,567 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,567 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,568 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,568 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,568 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,568 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,581 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-27 23:25:30,598 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:25:30,599 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:25:30,599 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:25:30,599 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:25:30,599 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:25:30,599 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:25:30,599 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:25:30,599 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:25:30,608 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 53 transitions [2019-12-27 23:25:30,691 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1244 states. [2019-12-27 23:25:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states. [2019-12-27 23:25:30,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 23:25:30,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:30,703 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:30,704 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:30,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:30,710 INFO L82 PathProgramCache]: Analyzing trace with hash -54944204, now seen corresponding path program 1 times [2019-12-27 23:25:30,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:30,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855023003] [2019-12-27 23:25:30,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:31,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:31,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855023003] [2019-12-27 23:25:31,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:25:31,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:25:31,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1074000759] [2019-12-27 23:25:31,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:31,087 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:31,108 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 20 transitions. [2019-12-27 23:25:31,108 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:31,113 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:25:31,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:25:31,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:31,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:25:31,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:25:31,132 INFO L87 Difference]: Start difference. First operand 1244 states. Second operand 5 states. [2019-12-27 23:25:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:31,346 INFO L93 Difference]: Finished difference Result 2093 states and 6041 transitions. [2019-12-27 23:25:31,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 23:25:31,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 23:25:31,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:31,379 INFO L225 Difference]: With dead ends: 2093 [2019-12-27 23:25:31,379 INFO L226 Difference]: Without dead ends: 572 [2019-12-27 23:25:31,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:25:31,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-12-27 23:25:31,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 460. [2019-12-27 23:25:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-12-27 23:25:31,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1179 transitions. [2019-12-27 23:25:31,492 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1179 transitions. Word has length 20 [2019-12-27 23:25:31,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:31,493 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 1179 transitions. [2019-12-27 23:25:31,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:25:31,493 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1179 transitions. [2019-12-27 23:25:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 23:25:31,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:31,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:31,498 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:31,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:31,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1539658704, now seen corresponding path program 1 times [2019-12-27 23:25:31,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:31,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671686584] [2019-12-27 23:25:31,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:31,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671686584] [2019-12-27 23:25:31,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:25:31,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:25:31,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [526961292] [2019-12-27 23:25:31,687 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:31,689 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:31,693 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 24 transitions. [2019-12-27 23:25:31,693 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:31,693 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:25:31,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:25:31,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:31,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:25:31,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:25:31,696 INFO L87 Difference]: Start difference. First operand 460 states and 1179 transitions. Second operand 6 states. [2019-12-27 23:25:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:31,794 INFO L93 Difference]: Finished difference Result 768 states and 1928 transitions. [2019-12-27 23:25:31,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:25:31,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 23:25:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:31,799 INFO L225 Difference]: With dead ends: 768 [2019-12-27 23:25:31,799 INFO L226 Difference]: Without dead ends: 612 [2019-12-27 23:25:31,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:25:31,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-12-27 23:25:31,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 488. [2019-12-27 23:25:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-12-27 23:25:31,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1239 transitions. [2019-12-27 23:25:31,832 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1239 transitions. Word has length 24 [2019-12-27 23:25:31,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:31,832 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 1239 transitions. [2019-12-27 23:25:31,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:25:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1239 transitions. [2019-12-27 23:25:31,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 23:25:31,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:31,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:31,837 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:31,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:31,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1257295600, now seen corresponding path program 1 times [2019-12-27 23:25:31,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:31,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12879234] [2019-12-27 23:25:31,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:32,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12879234] [2019-12-27 23:25:32,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:25:32,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:25:32,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [609647192] [2019-12-27 23:25:32,035 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:32,039 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:32,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 48 transitions. [2019-12-27 23:25:32,047 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:32,081 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:25:32,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:25:32,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:32,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:25:32,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:25:32,085 INFO L87 Difference]: Start difference. First operand 488 states and 1239 transitions. Second operand 6 states. [2019-12-27 23:25:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:32,209 INFO L93 Difference]: Finished difference Result 801 states and 1994 transitions. [2019-12-27 23:25:32,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:25:32,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 23:25:32,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:32,216 INFO L225 Difference]: With dead ends: 801 [2019-12-27 23:25:32,216 INFO L226 Difference]: Without dead ends: 673 [2019-12-27 23:25:32,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:25:32,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-12-27 23:25:32,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 554. [2019-12-27 23:25:32,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-12-27 23:25:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1367 transitions. [2019-12-27 23:25:32,252 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1367 transitions. Word has length 24 [2019-12-27 23:25:32,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:32,254 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 1367 transitions. [2019-12-27 23:25:32,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:25:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1367 transitions. [2019-12-27 23:25:32,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 23:25:32,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:32,261 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:32,261 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:32,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:32,262 INFO L82 PathProgramCache]: Analyzing trace with hash -391152653, now seen corresponding path program 1 times [2019-12-27 23:25:32,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:32,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79618091] [2019-12-27 23:25:32,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:32,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79618091] [2019-12-27 23:25:32,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182345104] [2019-12-27 23:25:32,464 INFO L94 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 [2019-12-27 23:25:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:32,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 23:25:32,576 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:32,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:32,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:32,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:32,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:32,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-12-27 23:25:32,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [870882425] [2019-12-27 23:25:32,674 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:32,677 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:32,681 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 23:25:32,681 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:32,682 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:25:32,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:25:32,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:32,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:25:32,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:25:32,683 INFO L87 Difference]: Start difference. First operand 554 states and 1367 transitions. Second operand 7 states. [2019-12-27 23:25:32,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:32,799 INFO L93 Difference]: Finished difference Result 869 states and 2130 transitions. [2019-12-27 23:25:32,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:25:32,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 23:25:32,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:32,805 INFO L225 Difference]: With dead ends: 869 [2019-12-27 23:25:32,805 INFO L226 Difference]: Without dead ends: 713 [2019-12-27 23:25:32,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:25:32,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-12-27 23:25:32,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 582. [2019-12-27 23:25:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-12-27 23:25:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1427 transitions. [2019-12-27 23:25:32,830 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1427 transitions. Word has length 28 [2019-12-27 23:25:32,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:32,834 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 1427 transitions. [2019-12-27 23:25:32,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:25:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1427 transitions. [2019-12-27 23:25:32,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 23:25:32,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:32,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:33,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:33,040 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:33,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:33,040 INFO L82 PathProgramCache]: Analyzing trace with hash 251821804, now seen corresponding path program 1 times [2019-12-27 23:25:33,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:33,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873377428] [2019-12-27 23:25:33,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:33,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873377428] [2019-12-27 23:25:33,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:25:33,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:25:33,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [208576197] [2019-12-27 23:25:33,173 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:33,176 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:33,183 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 70 transitions. [2019-12-27 23:25:33,184 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:33,184 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:25:33,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:25:33,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:33,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:25:33,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:25:33,186 INFO L87 Difference]: Start difference. First operand 582 states and 1427 transitions. Second operand 7 states. [2019-12-27 23:25:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:33,322 INFO L93 Difference]: Finished difference Result 860 states and 2112 transitions. [2019-12-27 23:25:33,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:25:33,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 23:25:33,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:33,329 INFO L225 Difference]: With dead ends: 860 [2019-12-27 23:25:33,329 INFO L226 Difference]: Without dead ends: 753 [2019-12-27 23:25:33,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:25:33,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-12-27 23:25:33,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 591. [2019-12-27 23:25:33,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-12-27 23:25:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1445 transitions. [2019-12-27 23:25:33,353 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1445 transitions. Word has length 28 [2019-12-27 23:25:33,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:33,353 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 1445 transitions. [2019-12-27 23:25:33,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:25:33,354 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1445 transitions. [2019-12-27 23:25:33,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 23:25:33,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:33,355 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:33,355 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:33,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:33,356 INFO L82 PathProgramCache]: Analyzing trace with hash -944108684, now seen corresponding path program 2 times [2019-12-27 23:25:33,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:33,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950679035] [2019-12-27 23:25:33,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:33,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950679035] [2019-12-27 23:25:33,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:25:33,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:25:33,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [527058276] [2019-12-27 23:25:33,456 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:33,460 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:33,468 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 76 transitions. [2019-12-27 23:25:33,469 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:33,472 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:25:33,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:25:33,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:33,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:25:33,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:25:33,473 INFO L87 Difference]: Start difference. First operand 591 states and 1445 transitions. Second operand 7 states. [2019-12-27 23:25:33,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:33,634 INFO L93 Difference]: Finished difference Result 900 states and 2192 transitions. [2019-12-27 23:25:33,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:25:33,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 23:25:33,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:33,640 INFO L225 Difference]: With dead ends: 900 [2019-12-27 23:25:33,641 INFO L226 Difference]: Without dead ends: 793 [2019-12-27 23:25:33,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:25:33,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2019-12-27 23:25:33,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 595. [2019-12-27 23:25:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-12-27 23:25:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 1458 transitions. [2019-12-27 23:25:33,665 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 1458 transitions. Word has length 28 [2019-12-27 23:25:33,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:33,666 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 1458 transitions. [2019-12-27 23:25:33,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:25:33,666 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1458 transitions. [2019-12-27 23:25:33,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 23:25:33,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:33,668 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:33,668 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:33,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:33,668 INFO L82 PathProgramCache]: Analyzing trace with hash -724803213, now seen corresponding path program 1 times [2019-12-27 23:25:33,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:33,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625438688] [2019-12-27 23:25:33,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:33,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625438688] [2019-12-27 23:25:33,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222948336] [2019-12-27 23:25:33,817 INFO L94 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 [2019-12-27 23:25:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:33,905 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 23:25:33,907 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:33,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:33,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:33,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:33,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-12-27 23:25:33,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [935348913] [2019-12-27 23:25:33,974 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:33,978 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:33,985 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 76 transitions. [2019-12-27 23:25:33,986 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:33,991 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:25:33,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:25:33,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:33,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:25:33,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:25:33,993 INFO L87 Difference]: Start difference. First operand 595 states and 1458 transitions. Second operand 7 states. [2019-12-27 23:25:34,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:34,135 INFO L93 Difference]: Finished difference Result 942 states and 2276 transitions. [2019-12-27 23:25:34,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:25:34,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 23:25:34,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:34,141 INFO L225 Difference]: With dead ends: 942 [2019-12-27 23:25:34,141 INFO L226 Difference]: Without dead ends: 814 [2019-12-27 23:25:34,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:25:34,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-12-27 23:25:34,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 657. [2019-12-27 23:25:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-12-27 23:25:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1573 transitions. [2019-12-27 23:25:34,164 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1573 transitions. Word has length 28 [2019-12-27 23:25:34,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:34,165 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1573 transitions. [2019-12-27 23:25:34,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:25:34,165 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1573 transitions. [2019-12-27 23:25:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:25:34,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:34,167 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:34,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:34,370 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:34,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:34,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1122021942, now seen corresponding path program 2 times [2019-12-27 23:25:34,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:34,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775959609] [2019-12-27 23:25:34,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:34,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:34,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775959609] [2019-12-27 23:25:34,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341698504] [2019-12-27 23:25:34,531 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-12-27 23:25:34,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:25:34,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:34,585 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:25:34,587 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:34,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:34,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:34,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:34,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:34,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-12-27 23:25:34,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [273812164] [2019-12-27 23:25:34,659 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:34,663 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:34,667 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 32 transitions. [2019-12-27 23:25:34,667 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:34,667 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:25:34,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:25:34,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:34,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:25:34,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:25:34,669 INFO L87 Difference]: Start difference. First operand 657 states and 1573 transitions. Second operand 8 states. [2019-12-27 23:25:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:34,798 INFO L93 Difference]: Finished difference Result 991 states and 2374 transitions. [2019-12-27 23:25:34,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:25:34,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 23:25:34,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:34,804 INFO L225 Difference]: With dead ends: 991 [2019-12-27 23:25:34,804 INFO L226 Difference]: Without dead ends: 835 [2019-12-27 23:25:34,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:25:34,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-12-27 23:25:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 686. [2019-12-27 23:25:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-12-27 23:25:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1637 transitions. [2019-12-27 23:25:34,826 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1637 transitions. Word has length 32 [2019-12-27 23:25:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:34,826 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 1637 transitions. [2019-12-27 23:25:34,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:25:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1637 transitions. [2019-12-27 23:25:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:25:34,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:34,828 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:35,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:35,032 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:35,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:35,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1764996399, now seen corresponding path program 1 times [2019-12-27 23:25:35,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:35,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68606132] [2019-12-27 23:25:35,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:35,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68606132] [2019-12-27 23:25:35,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532191881] [2019-12-27 23:25:35,202 INFO L94 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 [2019-12-27 23:25:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:35,277 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:25:35,282 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:35,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:35,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:35,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:35,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:35,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:35,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-12-27 23:25:35,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1308638456] [2019-12-27 23:25:35,386 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:35,389 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:35,399 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 98 transitions. [2019-12-27 23:25:35,399 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:35,400 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:25:35,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:25:35,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:35,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:25:35,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:25:35,401 INFO L87 Difference]: Start difference. First operand 686 states and 1637 transitions. Second operand 8 states. [2019-12-27 23:25:35,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:35,577 INFO L93 Difference]: Finished difference Result 1022 states and 2436 transitions. [2019-12-27 23:25:35,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:25:35,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 23:25:35,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:35,584 INFO L225 Difference]: With dead ends: 1022 [2019-12-27 23:25:35,584 INFO L226 Difference]: Without dead ends: 915 [2019-12-27 23:25:35,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:25:35,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-12-27 23:25:35,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 685. [2019-12-27 23:25:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-12-27 23:25:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1633 transitions. [2019-12-27 23:25:35,659 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1633 transitions. Word has length 32 [2019-12-27 23:25:35,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:35,659 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 1633 transitions. [2019-12-27 23:25:35,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:25:35,659 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1633 transitions. [2019-12-27 23:25:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:25:35,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:35,661 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:35,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:35,865 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:35,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:35,865 INFO L82 PathProgramCache]: Analyzing trace with hash 569065911, now seen corresponding path program 2 times [2019-12-27 23:25:35,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:35,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043005170] [2019-12-27 23:25:35,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:35,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043005170] [2019-12-27 23:25:35,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046111444] [2019-12-27 23:25:35,995 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-12-27 23:25:36,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:25:36,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:36,052 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:25:36,054 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:36,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:36,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:36,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:36,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:36,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-12-27 23:25:36,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1082669524] [2019-12-27 23:25:36,143 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:36,148 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:36,157 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 98 transitions. [2019-12-27 23:25:36,157 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:36,159 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:25:36,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:25:36,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:36,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:25:36,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:25:36,161 INFO L87 Difference]: Start difference. First operand 685 states and 1633 transitions. Second operand 8 states. [2019-12-27 23:25:36,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:36,325 INFO L93 Difference]: Finished difference Result 1062 states and 2516 transitions. [2019-12-27 23:25:36,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:25:36,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 23:25:36,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:36,331 INFO L225 Difference]: With dead ends: 1062 [2019-12-27 23:25:36,332 INFO L226 Difference]: Without dead ends: 955 [2019-12-27 23:25:36,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:25:36,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-12-27 23:25:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 701. [2019-12-27 23:25:36,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-12-27 23:25:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1673 transitions. [2019-12-27 23:25:36,353 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1673 transitions. Word has length 32 [2019-12-27 23:25:36,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:36,354 INFO L462 AbstractCegarLoop]: Abstraction has 701 states and 1673 transitions. [2019-12-27 23:25:36,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:25:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1673 transitions. [2019-12-27 23:25:36,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:25:36,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:36,355 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:36,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:36,558 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:36,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:36,559 INFO L82 PathProgramCache]: Analyzing trace with hash -665996433, now seen corresponding path program 1 times [2019-12-27 23:25:36,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:36,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889647470] [2019-12-27 23:25:36,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:36,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889647470] [2019-12-27 23:25:36,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367189699] [2019-12-27 23:25:36,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-12-27 23:25:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:36,725 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:25:36,727 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:36,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:36,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:36,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:36,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-12-27 23:25:36,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1296604034] [2019-12-27 23:25:36,813 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:36,816 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:36,823 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 74 transitions. [2019-12-27 23:25:36,823 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:36,823 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:25:36,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:25:36,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:36,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:25:36,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:25:36,825 INFO L87 Difference]: Start difference. First operand 701 states and 1673 transitions. Second operand 8 states. [2019-12-27 23:25:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:37,034 INFO L93 Difference]: Finished difference Result 1019 states and 2431 transitions. [2019-12-27 23:25:37,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:25:37,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 23:25:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:37,040 INFO L225 Difference]: With dead ends: 1019 [2019-12-27 23:25:37,040 INFO L226 Difference]: Without dead ends: 912 [2019-12-27 23:25:37,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:25:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-12-27 23:25:37,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 694. [2019-12-27 23:25:37,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-12-27 23:25:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1651 transitions. [2019-12-27 23:25:37,059 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1651 transitions. Word has length 32 [2019-12-27 23:25:37,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:37,060 INFO L462 AbstractCegarLoop]: Abstraction has 694 states and 1651 transitions. [2019-12-27 23:25:37,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:25:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1651 transitions. [2019-12-27 23:25:37,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:25:37,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:37,061 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:37,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:37,269 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:37,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:37,270 INFO L82 PathProgramCache]: Analyzing trace with hash -567213615, now seen corresponding path program 2 times [2019-12-27 23:25:37,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:37,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140218454] [2019-12-27 23:25:37,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:37,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:37,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140218454] [2019-12-27 23:25:37,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168223912] [2019-12-27 23:25:37,376 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-12-27 23:25:37,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:25:37,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:37,425 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:25:37,431 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:37,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:37,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:37,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:37,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:37,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-12-27 23:25:37,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1010232602] [2019-12-27 23:25:37,520 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:37,523 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:37,535 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 128 transitions. [2019-12-27 23:25:37,536 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:37,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:25:37,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:25:37,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:37,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:25:37,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:25:37,546 INFO L87 Difference]: Start difference. First operand 694 states and 1651 transitions. Second operand 8 states. [2019-12-27 23:25:37,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:37,703 INFO L93 Difference]: Finished difference Result 1081 states and 2554 transitions. [2019-12-27 23:25:37,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:25:37,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 23:25:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:37,709 INFO L225 Difference]: With dead ends: 1081 [2019-12-27 23:25:37,709 INFO L226 Difference]: Without dead ends: 974 [2019-12-27 23:25:37,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:25:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-12-27 23:25:37,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 684. [2019-12-27 23:25:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-12-27 23:25:37,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1647 transitions. [2019-12-27 23:25:37,730 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1647 transitions. Word has length 32 [2019-12-27 23:25:37,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:37,731 INFO L462 AbstractCegarLoop]: Abstraction has 684 states and 1647 transitions. [2019-12-27 23:25:37,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:25:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1647 transitions. [2019-12-27 23:25:37,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:25:37,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:37,732 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:37,935 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:37,936 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:37,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:37,936 INFO L82 PathProgramCache]: Analyzing trace with hash -557382585, now seen corresponding path program 3 times [2019-12-27 23:25:37,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:37,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827088441] [2019-12-27 23:25:37,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:38,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:38,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827088441] [2019-12-27 23:25:38,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660167050] [2019-12-27 23:25:38,035 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-12-27 23:25:38,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 23:25:38,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:38,087 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:25:38,089 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:38,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:38,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:38,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:38,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:38,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-12-27 23:25:38,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [112063625] [2019-12-27 23:25:38,166 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:38,170 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:38,181 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 122 transitions. [2019-12-27 23:25:38,181 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:38,187 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:25:38,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:25:38,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:38,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:25:38,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:25:38,188 INFO L87 Difference]: Start difference. First operand 684 states and 1647 transitions. Second operand 8 states. [2019-12-27 23:25:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:38,405 INFO L93 Difference]: Finished difference Result 1106 states and 2609 transitions. [2019-12-27 23:25:38,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:25:38,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 23:25:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:38,411 INFO L225 Difference]: With dead ends: 1106 [2019-12-27 23:25:38,411 INFO L226 Difference]: Without dead ends: 999 [2019-12-27 23:25:38,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:25:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-12-27 23:25:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 702. [2019-12-27 23:25:38,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-12-27 23:25:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1677 transitions. [2019-12-27 23:25:38,433 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1677 transitions. Word has length 32 [2019-12-27 23:25:38,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:38,434 INFO L462 AbstractCegarLoop]: Abstraction has 702 states and 1677 transitions. [2019-12-27 23:25:38,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:25:38,434 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1677 transitions. [2019-12-27 23:25:38,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:25:38,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:38,435 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:38,638 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:38,638 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:38,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:38,639 INFO L82 PathProgramCache]: Analyzing trace with hash 163904118, now seen corresponding path program 2 times [2019-12-27 23:25:38,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:38,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877764581] [2019-12-27 23:25:38,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:38,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877764581] [2019-12-27 23:25:38,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74395393] [2019-12-27 23:25:38,762 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-12-27 23:25:38,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:25:38,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:38,804 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:25:38,806 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:38,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:38,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:38,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:38,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-12-27 23:25:38,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1701170497] [2019-12-27 23:25:38,873 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:38,876 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:38,884 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 104 transitions. [2019-12-27 23:25:38,884 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:38,886 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:25:38,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:25:38,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:38,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:25:38,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:25:38,888 INFO L87 Difference]: Start difference. First operand 702 states and 1677 transitions. Second operand 8 states. [2019-12-27 23:25:39,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:39,026 INFO L93 Difference]: Finished difference Result 1123 states and 2638 transitions. [2019-12-27 23:25:39,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:25:39,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 23:25:39,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:39,032 INFO L225 Difference]: With dead ends: 1123 [2019-12-27 23:25:39,032 INFO L226 Difference]: Without dead ends: 995 [2019-12-27 23:25:39,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:25:39,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2019-12-27 23:25:39,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 760. [2019-12-27 23:25:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-12-27 23:25:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1779 transitions. [2019-12-27 23:25:39,057 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1779 transitions. Word has length 32 [2019-12-27 23:25:39,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:39,057 INFO L462 AbstractCegarLoop]: Abstraction has 760 states and 1779 transitions. [2019-12-27 23:25:39,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:25:39,057 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1779 transitions. [2019-12-27 23:25:39,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 23:25:39,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:39,059 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:39,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:39,270 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:39,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:39,271 INFO L82 PathProgramCache]: Analyzing trace with hash 423038713, now seen corresponding path program 3 times [2019-12-27 23:25:39,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:39,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154326515] [2019-12-27 23:25:39,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:39,399 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:39,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154326515] [2019-12-27 23:25:39,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577503353] [2019-12-27 23:25:39,400 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-12-27 23:25:39,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:25:39,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:39,450 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:25:39,452 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:39,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:39,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:39,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:39,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:39,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-12-27 23:25:39,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [618272451] [2019-12-27 23:25:39,531 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:39,534 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:39,539 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 36 transitions. [2019-12-27 23:25:39,539 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:39,539 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:25:39,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:25:39,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:39,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:25:39,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:25:39,541 INFO L87 Difference]: Start difference. First operand 760 states and 1779 transitions. Second operand 9 states. [2019-12-27 23:25:39,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:39,691 INFO L93 Difference]: Finished difference Result 1113 states and 2618 transitions. [2019-12-27 23:25:39,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:25:39,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-27 23:25:39,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:39,697 INFO L225 Difference]: With dead ends: 1113 [2019-12-27 23:25:39,697 INFO L226 Difference]: Without dead ends: 957 [2019-12-27 23:25:39,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:25:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-12-27 23:25:39,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 793. [2019-12-27 23:25:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-12-27 23:25:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1856 transitions. [2019-12-27 23:25:39,718 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1856 transitions. Word has length 36 [2019-12-27 23:25:39,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:39,718 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1856 transitions. [2019-12-27 23:25:39,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:25:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1856 transitions. [2019-12-27 23:25:39,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 23:25:39,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:39,720 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:39,926 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:39,927 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:39,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:39,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1066013170, now seen corresponding path program 3 times [2019-12-27 23:25:39,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:39,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987458458] [2019-12-27 23:25:39,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:40,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987458458] [2019-12-27 23:25:40,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436783399] [2019-12-27 23:25:40,044 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-12-27 23:25:40,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 23:25:40,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:40,093 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:25:40,094 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:40,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:40,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:40,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:40,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:40,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-12-27 23:25:40,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [26201415] [2019-12-27 23:25:40,195 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:40,199 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:40,212 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 126 transitions. [2019-12-27 23:25:40,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:40,213 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:25:40,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:25:40,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:40,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:25:40,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:25:40,215 INFO L87 Difference]: Start difference. First operand 793 states and 1856 transitions. Second operand 9 states. [2019-12-27 23:25:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:40,389 INFO L93 Difference]: Finished difference Result 1184 states and 2760 transitions. [2019-12-27 23:25:40,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:25:40,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-27 23:25:40,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:40,395 INFO L225 Difference]: With dead ends: 1184 [2019-12-27 23:25:40,395 INFO L226 Difference]: Without dead ends: 1077 [2019-12-27 23:25:40,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:25:40,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-12-27 23:25:40,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 789. [2019-12-27 23:25:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-27 23:25:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1843 transitions. [2019-12-27 23:25:40,415 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1843 transitions. Word has length 36 [2019-12-27 23:25:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:40,415 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1843 transitions. [2019-12-27 23:25:40,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:25:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1843 transitions. [2019-12-27 23:25:40,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 23:25:40,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:40,417 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:40,627 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:40,627 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:40,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:40,627 INFO L82 PathProgramCache]: Analyzing trace with hash -129917318, now seen corresponding path program 4 times [2019-12-27 23:25:40,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:40,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796709743] [2019-12-27 23:25:40,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:40,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796709743] [2019-12-27 23:25:40,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393344006] [2019-12-27 23:25:40,755 INFO L92 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 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 [2019-12-27 23:25:40,820 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:25:40,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:40,821 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:25:40,830 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:41,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:41,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:41,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:41,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:41,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-12-27 23:25:41,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1687592386] [2019-12-27 23:25:41,062 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:41,067 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:41,084 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 126 transitions. [2019-12-27 23:25:41,084 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:41,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:25:41,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:25:41,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:41,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:25:41,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:25:41,087 INFO L87 Difference]: Start difference. First operand 789 states and 1843 transitions. Second operand 9 states. [2019-12-27 23:25:41,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:41,367 INFO L93 Difference]: Finished difference Result 1224 states and 2840 transitions. [2019-12-27 23:25:41,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:25:41,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-27 23:25:41,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:41,374 INFO L225 Difference]: With dead ends: 1224 [2019-12-27 23:25:41,374 INFO L226 Difference]: Without dead ends: 1117 [2019-12-27 23:25:41,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:25:41,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2019-12-27 23:25:41,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 788. [2019-12-27 23:25:41,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-12-27 23:25:41,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1839 transitions. [2019-12-27 23:25:41,396 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1839 transitions. Word has length 36 [2019-12-27 23:25:41,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:41,396 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1839 transitions. [2019-12-27 23:25:41,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:25:41,396 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1839 transitions. [2019-12-27 23:25:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 23:25:41,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:41,398 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:41,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:41,602 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:41,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:41,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1266196844, now seen corresponding path program 1 times [2019-12-27 23:25:41,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:41,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822544381] [2019-12-27 23:25:41,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:41,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822544381] [2019-12-27 23:25:41,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312743377] [2019-12-27 23:25:41,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-12-27 23:25:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:41,795 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:25:41,796 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:41,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:41,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:41,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:41,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:41,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:41,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-12-27 23:25:41,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1227140883] [2019-12-27 23:25:41,905 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:41,909 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:41,922 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 126 transitions. [2019-12-27 23:25:41,922 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:41,924 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:25:41,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:25:41,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:41,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:25:41,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:25:41,926 INFO L87 Difference]: Start difference. First operand 788 states and 1839 transitions. Second operand 9 states. [2019-12-27 23:25:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:42,161 INFO L93 Difference]: Finished difference Result 1264 states and 2920 transitions. [2019-12-27 23:25:42,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:25:42,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-27 23:25:42,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:42,168 INFO L225 Difference]: With dead ends: 1264 [2019-12-27 23:25:42,169 INFO L226 Difference]: Without dead ends: 1157 [2019-12-27 23:25:42,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:25:42,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2019-12-27 23:25:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 804. [2019-12-27 23:25:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2019-12-27 23:25:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1879 transitions. [2019-12-27 23:25:42,190 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1879 transitions. Word has length 36 [2019-12-27 23:25:42,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:42,190 INFO L462 AbstractCegarLoop]: Abstraction has 804 states and 1879 transitions. [2019-12-27 23:25:42,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:25:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1879 transitions. [2019-12-27 23:25:42,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 23:25:42,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:42,192 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:42,394 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:42,395 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:42,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:42,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1256365814, now seen corresponding path program 2 times [2019-12-27 23:25:42,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:42,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479507900] [2019-12-27 23:25:42,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:42,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479507900] [2019-12-27 23:25:42,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453085978] [2019-12-27 23:25:42,504 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-12-27 23:25:42,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:25:42,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:42,552 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:25:42,553 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:42,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:42,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:42,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:42,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-12-27 23:25:42,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1195902460] [2019-12-27 23:25:42,692 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:42,694 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:42,703 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 126 transitions. [2019-12-27 23:25:42,703 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:42,704 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:25:42,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:25:42,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:42,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:25:42,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:25:42,705 INFO L87 Difference]: Start difference. First operand 804 states and 1879 transitions. Second operand 9 states. [2019-12-27 23:25:42,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:42,962 INFO L93 Difference]: Finished difference Result 1252 states and 2900 transitions. [2019-12-27 23:25:42,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:25:42,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-27 23:25:42,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:42,968 INFO L225 Difference]: With dead ends: 1252 [2019-12-27 23:25:42,968 INFO L226 Difference]: Without dead ends: 1145 [2019-12-27 23:25:42,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:25:42,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2019-12-27 23:25:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 797. [2019-12-27 23:25:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-27 23:25:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1857 transitions. [2019-12-27 23:25:42,988 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1857 transitions. Word has length 36 [2019-12-27 23:25:42,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:42,989 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1857 transitions. [2019-12-27 23:25:42,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:25:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1857 transitions. [2019-12-27 23:25:42,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 23:25:42,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:42,990 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:43,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:43,194 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:43,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:43,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1499169198, now seen corresponding path program 4 times [2019-12-27 23:25:43,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:43,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298252678] [2019-12-27 23:25:43,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:43,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298252678] [2019-12-27 23:25:43,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672446569] [2019-12-27 23:25:43,306 INFO L92 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 [2019-12-27 23:25:43,352 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:25:43,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:43,353 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:25:43,354 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:43,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:43,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:43,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:43,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:43,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-12-27 23:25:43,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1842162195] [2019-12-27 23:25:43,440 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:43,442 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:43,452 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 109 states and 180 transitions. [2019-12-27 23:25:43,453 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:43,456 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 23:25:43,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:25:43,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:43,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:25:43,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:25:43,457 INFO L87 Difference]: Start difference. First operand 797 states and 1857 transitions. Second operand 9 states. [2019-12-27 23:25:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:43,697 INFO L93 Difference]: Finished difference Result 1306 states and 3025 transitions. [2019-12-27 23:25:43,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:25:43,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-27 23:25:43,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:43,709 INFO L225 Difference]: With dead ends: 1306 [2019-12-27 23:25:43,709 INFO L226 Difference]: Without dead ends: 1157 [2019-12-27 23:25:43,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:25:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2019-12-27 23:25:43,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 850. [2019-12-27 23:25:43,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-12-27 23:25:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1972 transitions. [2019-12-27 23:25:43,728 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1972 transitions. Word has length 36 [2019-12-27 23:25:43,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:43,728 INFO L462 AbstractCegarLoop]: Abstraction has 850 states and 1972 transitions. [2019-12-27 23:25:43,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:25:43,728 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1972 transitions. [2019-12-27 23:25:43,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 23:25:43,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:43,730 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:43,941 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:43,942 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:43,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:43,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1509000228, now seen corresponding path program 5 times [2019-12-27 23:25:43,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:43,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48199805] [2019-12-27 23:25:43,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:44,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48199805] [2019-12-27 23:25:44,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031305986] [2019-12-27 23:25:44,053 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2019-12-27 23:25:44,112 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 23:25:44,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:44,113 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:25:44,114 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:44,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:44,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:44,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:44,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:44,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-12-27 23:25:44,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1155165396] [2019-12-27 23:25:44,245 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:44,249 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:44,288 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 174 transitions. [2019-12-27 23:25:44,288 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:44,291 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:25:44,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:25:44,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:44,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:25:44,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:25:44,292 INFO L87 Difference]: Start difference. First operand 850 states and 1972 transitions. Second operand 9 states. [2019-12-27 23:25:44,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:44,538 INFO L93 Difference]: Finished difference Result 1365 states and 3122 transitions. [2019-12-27 23:25:44,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:25:44,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-27 23:25:44,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:44,545 INFO L225 Difference]: With dead ends: 1365 [2019-12-27 23:25:44,545 INFO L226 Difference]: Without dead ends: 1258 [2019-12-27 23:25:44,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:25:44,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-12-27 23:25:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 846. [2019-12-27 23:25:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-12-27 23:25:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1959 transitions. [2019-12-27 23:25:44,564 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1959 transitions. Word has length 36 [2019-12-27 23:25:44,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:44,564 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1959 transitions. [2019-12-27 23:25:44,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:25:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1959 transitions. [2019-12-27 23:25:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 23:25:44,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:44,566 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:44,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:44,769 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:44,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:44,770 INFO L82 PathProgramCache]: Analyzing trace with hash -2019356946, now seen corresponding path program 3 times [2019-12-27 23:25:44,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:44,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172833461] [2019-12-27 23:25:44,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:44,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:44,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172833461] [2019-12-27 23:25:44,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941150896] [2019-12-27 23:25:44,875 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-12-27 23:25:44,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 23:25:44,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:44,947 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:25:44,949 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:45,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:45,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:45,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:45,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:45,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-12-27 23:25:45,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1191233514] [2019-12-27 23:25:45,059 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:45,064 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:45,083 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 150 transitions. [2019-12-27 23:25:45,083 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:45,085 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:25:45,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:25:45,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:45,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:25:45,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:25:45,086 INFO L87 Difference]: Start difference. First operand 846 states and 1959 transitions. Second operand 9 states. [2019-12-27 23:25:45,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:45,343 INFO L93 Difference]: Finished difference Result 1405 states and 3202 transitions. [2019-12-27 23:25:45,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:25:45,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-27 23:25:45,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:45,347 INFO L225 Difference]: With dead ends: 1405 [2019-12-27 23:25:45,347 INFO L226 Difference]: Without dead ends: 1298 [2019-12-27 23:25:45,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:25:45,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2019-12-27 23:25:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 862. [2019-12-27 23:25:45,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2019-12-27 23:25:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1999 transitions. [2019-12-27 23:25:45,369 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1999 transitions. Word has length 36 [2019-12-27 23:25:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:45,370 INFO L462 AbstractCegarLoop]: Abstraction has 862 states and 1999 transitions. [2019-12-27 23:25:45,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:25:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1999 transitions. [2019-12-27 23:25:45,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 23:25:45,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:45,371 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:45,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:45,574 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:45,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:45,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2009525916, now seen corresponding path program 4 times [2019-12-27 23:25:45,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:45,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969126882] [2019-12-27 23:25:45,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:45,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969126882] [2019-12-27 23:25:45,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306276501] [2019-12-27 23:25:45,680 INFO L92 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 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 [2019-12-27 23:25:45,729 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:25:45,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:45,730 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:25:45,731 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:45,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:45,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:45,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:45,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:45,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:45,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-12-27 23:25:45,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [880764027] [2019-12-27 23:25:45,821 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:45,825 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:45,857 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 150 transitions. [2019-12-27 23:25:45,857 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:45,861 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:25:45,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:25:45,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:45,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:25:45,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:25:45,864 INFO L87 Difference]: Start difference. First operand 862 states and 1999 transitions. Second operand 9 states. [2019-12-27 23:25:46,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:46,110 INFO L93 Difference]: Finished difference Result 1346 states and 3084 transitions. [2019-12-27 23:25:46,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:25:46,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-27 23:25:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:46,112 INFO L225 Difference]: With dead ends: 1346 [2019-12-27 23:25:46,113 INFO L226 Difference]: Without dead ends: 1239 [2019-12-27 23:25:46,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:25:46,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2019-12-27 23:25:46,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 863. [2019-12-27 23:25:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-12-27 23:25:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1985 transitions. [2019-12-27 23:25:46,131 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1985 transitions. Word has length 36 [2019-12-27 23:25:46,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:46,132 INFO L462 AbstractCegarLoop]: Abstraction has 863 states and 1985 transitions. [2019-12-27 23:25:46,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:25:46,132 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1985 transitions. [2019-12-27 23:25:46,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:46,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:46,134 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:46,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:46,337 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:46,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:46,337 INFO L82 PathProgramCache]: Analyzing trace with hash -272936388, now seen corresponding path program 4 times [2019-12-27 23:25:46,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:46,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668930177] [2019-12-27 23:25:46,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:46,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668930177] [2019-12-27 23:25:46,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834129595] [2019-12-27 23:25:46,486 INFO L92 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 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 [2019-12-27 23:25:46,528 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:25:46,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:46,529 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:46,530 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:46,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:46,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:46,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:46,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:46,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:46,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [660839745] [2019-12-27 23:25:46,637 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:46,641 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:46,645 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 40 transitions. [2019-12-27 23:25:46,645 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:46,645 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:25:46,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:46,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:46,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:46,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:46,646 INFO L87 Difference]: Start difference. First operand 863 states and 1985 transitions. Second operand 10 states. [2019-12-27 23:25:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:46,829 INFO L93 Difference]: Finished difference Result 1235 states and 2862 transitions. [2019-12-27 23:25:46,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:25:46,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:46,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:46,833 INFO L225 Difference]: With dead ends: 1235 [2019-12-27 23:25:46,833 INFO L226 Difference]: Without dead ends: 1079 [2019-12-27 23:25:46,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:25:46,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-12-27 23:25:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 900. [2019-12-27 23:25:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-12-27 23:25:46,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 2075 transitions. [2019-12-27 23:25:46,852 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 2075 transitions. Word has length 40 [2019-12-27 23:25:46,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:46,853 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 2075 transitions. [2019-12-27 23:25:46,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:46,853 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 2075 transitions. [2019-12-27 23:25:46,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:46,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:46,855 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:47,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:47,058 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:47,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:47,059 INFO L82 PathProgramCache]: Analyzing trace with hash 370038069, now seen corresponding path program 5 times [2019-12-27 23:25:47,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:47,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011866269] [2019-12-27 23:25:47,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:47,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011866269] [2019-12-27 23:25:47,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146503771] [2019-12-27 23:25:47,192 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2019-12-27 23:25:47,248 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 23:25:47,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:47,249 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:47,250 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:47,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:47,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:47,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:47,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:47,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:47,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1113206128] [2019-12-27 23:25:47,363 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:47,368 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:47,384 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 154 transitions. [2019-12-27 23:25:47,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:47,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:25:47,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:47,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:47,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:47,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:47,386 INFO L87 Difference]: Start difference. First operand 900 states and 2075 transitions. Second operand 10 states. [2019-12-27 23:25:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:47,651 INFO L93 Difference]: Finished difference Result 1346 states and 3084 transitions. [2019-12-27 23:25:47,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:25:47,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:47,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:47,654 INFO L225 Difference]: With dead ends: 1346 [2019-12-27 23:25:47,655 INFO L226 Difference]: Without dead ends: 1239 [2019-12-27 23:25:47,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:25:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2019-12-27 23:25:47,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 896. [2019-12-27 23:25:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-12-27 23:25:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2062 transitions. [2019-12-27 23:25:47,674 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2062 transitions. Word has length 40 [2019-12-27 23:25:47,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:47,675 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 2062 transitions. [2019-12-27 23:25:47,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:47,675 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2062 transitions. [2019-12-27 23:25:47,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:47,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:47,676 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:47,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:47,880 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:47,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:47,880 INFO L82 PathProgramCache]: Analyzing trace with hash -825892419, now seen corresponding path program 6 times [2019-12-27 23:25:47,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:47,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104504264] [2019-12-27 23:25:47,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:48,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104504264] [2019-12-27 23:25:48,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34649874] [2019-12-27 23:25:48,008 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2019-12-27 23:25:48,056 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 23:25:48,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:48,057 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:48,057 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:50,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:50,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:50,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:50,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:50,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:50,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1840633821] [2019-12-27 23:25:50,234 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:50,237 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:50,249 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 154 transitions. [2019-12-27 23:25:50,250 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:50,250 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:25:50,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:50,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:50,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:50,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=183, Unknown=1, NotChecked=0, Total=240 [2019-12-27 23:25:50,252 INFO L87 Difference]: Start difference. First operand 896 states and 2062 transitions. Second operand 10 states. [2019-12-27 23:25:51,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:51,037 INFO L93 Difference]: Finished difference Result 1426 states and 3244 transitions. [2019-12-27 23:25:51,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:25:51,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:51,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:51,041 INFO L225 Difference]: With dead ends: 1426 [2019-12-27 23:25:51,041 INFO L226 Difference]: Without dead ends: 1319 [2019-12-27 23:25:51,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=146, Invalid=404, Unknown=2, NotChecked=0, Total=552 [2019-12-27 23:25:51,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-12-27 23:25:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 892. [2019-12-27 23:25:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-12-27 23:25:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 2049 transitions. [2019-12-27 23:25:51,061 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 2049 transitions. Word has length 40 [2019-12-27 23:25:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:51,062 INFO L462 AbstractCegarLoop]: Abstraction has 892 states and 2049 transitions. [2019-12-27 23:25:51,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 2049 transitions. [2019-12-27 23:25:51,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:51,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:51,063 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:51,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:51,267 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:51,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:51,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1962171945, now seen corresponding path program 5 times [2019-12-27 23:25:51,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:51,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499630089] [2019-12-27 23:25:51,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:51,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499630089] [2019-12-27 23:25:51,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31108490] [2019-12-27 23:25:51,403 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_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 [2019-12-27 23:25:51,449 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 23:25:51,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:51,450 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:51,451 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:51,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:51,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:51,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:51,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:51,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:51,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [505754980] [2019-12-27 23:25:51,589 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:51,593 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:51,606 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 154 transitions. [2019-12-27 23:25:51,606 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:51,607 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:25:51,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:51,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:51,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:51,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:51,608 INFO L87 Difference]: Start difference. First operand 892 states and 2049 transitions. Second operand 10 states. [2019-12-27 23:25:51,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:51,948 INFO L93 Difference]: Finished difference Result 1485 states and 3362 transitions. [2019-12-27 23:25:51,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:25:51,949 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:51,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:51,952 INFO L225 Difference]: With dead ends: 1485 [2019-12-27 23:25:51,953 INFO L226 Difference]: Without dead ends: 1378 [2019-12-27 23:25:51,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:25:51,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2019-12-27 23:25:51,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 908. [2019-12-27 23:25:51,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2019-12-27 23:25:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 2089 transitions. [2019-12-27 23:25:51,972 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 2089 transitions. Word has length 40 [2019-12-27 23:25:51,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:51,972 INFO L462 AbstractCegarLoop]: Abstraction has 908 states and 2089 transitions. [2019-12-27 23:25:51,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 2089 transitions. [2019-12-27 23:25:51,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:51,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:51,974 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:52,177 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:52,177 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:52,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:52,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1952340915, now seen corresponding path program 6 times [2019-12-27 23:25:52,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:52,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750201965] [2019-12-27 23:25:52,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:52,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750201965] [2019-12-27 23:25:52,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034521066] [2019-12-27 23:25:52,298 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2019-12-27 23:25:52,343 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 23:25:52,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:52,344 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:52,345 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:52,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:52,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:52,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:52,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:52,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:52,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1451512648] [2019-12-27 23:25:52,493 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:52,498 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:52,516 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 154 transitions. [2019-12-27 23:25:52,516 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:52,517 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:25:52,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:52,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:52,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:52,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:52,518 INFO L87 Difference]: Start difference. First operand 908 states and 2089 transitions. Second operand 10 states. [2019-12-27 23:25:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:52,853 INFO L93 Difference]: Finished difference Result 1473 states and 3342 transitions. [2019-12-27 23:25:52,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:25:52,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:52,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:52,856 INFO L225 Difference]: With dead ends: 1473 [2019-12-27 23:25:52,856 INFO L226 Difference]: Without dead ends: 1366 [2019-12-27 23:25:52,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:25:52,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-12-27 23:25:52,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 891. [2019-12-27 23:25:52,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-12-27 23:25:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 2045 transitions. [2019-12-27 23:25:52,876 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 2045 transitions. Word has length 40 [2019-12-27 23:25:52,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:52,876 INFO L462 AbstractCegarLoop]: Abstraction has 891 states and 2045 transitions. [2019-12-27 23:25:52,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:52,876 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 2045 transitions. [2019-12-27 23:25:52,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:52,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:52,878 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:53,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:53,081 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:53,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:53,081 INFO L82 PathProgramCache]: Analyzing trace with hash 803194097, now seen corresponding path program 7 times [2019-12-27 23:25:53,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:53,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147683174] [2019-12-27 23:25:53,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:53,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147683174] [2019-12-27 23:25:53,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597466332] [2019-12-27 23:25:53,212 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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 [2019-12-27 23:25:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:53,259 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:53,259 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:53,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:53,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:53,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:53,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:53,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:53,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [952734233] [2019-12-27 23:25:53,378 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:53,383 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:53,398 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 154 transitions. [2019-12-27 23:25:53,398 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:53,400 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:25:53,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:53,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:53,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:53,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:53,401 INFO L87 Difference]: Start difference. First operand 891 states and 2045 transitions. Second operand 10 states. [2019-12-27 23:25:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:53,717 INFO L93 Difference]: Finished difference Result 1504 states and 3400 transitions. [2019-12-27 23:25:53,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:25:53,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:53,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:53,720 INFO L225 Difference]: With dead ends: 1504 [2019-12-27 23:25:53,720 INFO L226 Difference]: Without dead ends: 1397 [2019-12-27 23:25:53,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:25:53,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2019-12-27 23:25:53,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 923. [2019-12-27 23:25:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-12-27 23:25:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 2125 transitions. [2019-12-27 23:25:53,744 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 2125 transitions. Word has length 40 [2019-12-27 23:25:53,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:53,744 INFO L462 AbstractCegarLoop]: Abstraction has 923 states and 2125 transitions. [2019-12-27 23:25:53,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:53,744 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 2125 transitions. [2019-12-27 23:25:53,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:53,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:53,746 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:53,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:53,949 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:53,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:53,949 INFO L82 PathProgramCache]: Analyzing trace with hash 813025127, now seen corresponding path program 8 times [2019-12-27 23:25:53,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:53,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059296569] [2019-12-27 23:25:53,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:54,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059296569] [2019-12-27 23:25:54,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640853995] [2019-12-27 23:25:54,077 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-12-27 23:25:54,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:25:54,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:54,123 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:54,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:54,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:54,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:54,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:54,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:54,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:54,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [819655394] [2019-12-27 23:25:54,670 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:54,675 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:54,691 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 154 transitions. [2019-12-27 23:25:54,692 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:54,693 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:25:54,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:54,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:54,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:54,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=184, Unknown=1, NotChecked=0, Total=240 [2019-12-27 23:25:54,694 INFO L87 Difference]: Start difference. First operand 923 states and 2125 transitions. Second operand 10 states. [2019-12-27 23:25:56,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:56,130 INFO L93 Difference]: Finished difference Result 1442 states and 3284 transitions. [2019-12-27 23:25:56,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:25:56,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:56,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:56,133 INFO L225 Difference]: With dead ends: 1442 [2019-12-27 23:25:56,133 INFO L226 Difference]: Without dead ends: 1335 [2019-12-27 23:25:56,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=166, Invalid=481, Unknown=3, NotChecked=0, Total=650 [2019-12-27 23:25:56,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-12-27 23:25:56,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 907. [2019-12-27 23:25:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-12-27 23:25:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 2085 transitions. [2019-12-27 23:25:56,152 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 2085 transitions. Word has length 40 [2019-12-27 23:25:56,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:56,152 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 2085 transitions. [2019-12-27 23:25:56,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:56,153 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 2085 transitions. [2019-12-27 23:25:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:56,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:56,154 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:56,357 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:56,357 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:56,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:56,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1579635249, now seen corresponding path program 9 times [2019-12-27 23:25:56,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:56,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687394372] [2019-12-27 23:25:56,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:56,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687394372] [2019-12-27 23:25:56,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469984047] [2019-12-27 23:25:56,501 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-12-27 23:25:56,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 23:25:56,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:56,548 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:56,549 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:56,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:56,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:56,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:56,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:56,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:56,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1588183142] [2019-12-27 23:25:56,654 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:56,657 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:56,669 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 154 transitions. [2019-12-27 23:25:56,670 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:56,671 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:25:56,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:56,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:56,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:56,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:56,672 INFO L87 Difference]: Start difference. First operand 907 states and 2085 transitions. Second operand 10 states. [2019-12-27 23:25:57,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:57,023 INFO L93 Difference]: Finished difference Result 1534 states and 3464 transitions. [2019-12-27 23:25:57,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:25:57,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:57,024 INFO L225 Difference]: With dead ends: 1534 [2019-12-27 23:25:57,025 INFO L226 Difference]: Without dead ends: 1427 [2019-12-27 23:25:57,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:25:57,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-12-27 23:25:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 923. [2019-12-27 23:25:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-12-27 23:25:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 2125 transitions. [2019-12-27 23:25:57,046 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 2125 transitions. Word has length 40 [2019-12-27 23:25:57,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:57,046 INFO L462 AbstractCegarLoop]: Abstraction has 923 states and 2125 transitions. [2019-12-27 23:25:57,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 2125 transitions. [2019-12-27 23:25:57,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:57,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:57,049 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:57,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:57,252 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:57,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:57,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1589466279, now seen corresponding path program 10 times [2019-12-27 23:25:57,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:57,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026599265] [2019-12-27 23:25:57,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:57,379 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:57,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026599265] [2019-12-27 23:25:57,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773270980] [2019-12-27 23:25:57,380 INFO L92 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 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 [2019-12-27 23:25:57,429 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:25:57,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:57,430 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:57,431 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:57,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:57,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:57,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:57,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:57,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:57,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [74133837] [2019-12-27 23:25:57,532 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:57,535 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:57,546 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 154 transitions. [2019-12-27 23:25:57,547 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:57,548 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:25:57,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:57,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:57,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:57,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:57,549 INFO L87 Difference]: Start difference. First operand 923 states and 2125 transitions. Second operand 10 states. [2019-12-27 23:25:57,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:57,914 INFO L93 Difference]: Finished difference Result 1482 states and 3364 transitions. [2019-12-27 23:25:57,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:25:57,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:57,916 INFO L225 Difference]: With dead ends: 1482 [2019-12-27 23:25:57,916 INFO L226 Difference]: Without dead ends: 1375 [2019-12-27 23:25:57,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:25:57,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2019-12-27 23:25:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 900. [2019-12-27 23:25:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-12-27 23:25:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 2063 transitions. [2019-12-27 23:25:57,935 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 2063 transitions. Word has length 40 [2019-12-27 23:25:57,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:57,935 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 2063 transitions. [2019-12-27 23:25:57,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 2063 transitions. [2019-12-27 23:25:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:57,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:57,937 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:58,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:58,140 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:58,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:58,141 INFO L82 PathProgramCache]: Analyzing trace with hash 962120459, now seen corresponding path program 6 times [2019-12-27 23:25:58,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:58,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685641196] [2019-12-27 23:25:58,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:58,272 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:58,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685641196] [2019-12-27 23:25:58,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789702945] [2019-12-27 23:25:58,273 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2019-12-27 23:25:58,319 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 23:25:58,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:58,320 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:58,321 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:58,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:58,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:58,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:58,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:58,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:58,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1311052687] [2019-12-27 23:25:58,432 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:58,435 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:58,451 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 232 transitions. [2019-12-27 23:25:58,451 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:58,455 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 23:25:58,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:58,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:58,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:58,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:58,456 INFO L87 Difference]: Start difference. First operand 900 states and 2063 transitions. Second operand 10 states. [2019-12-27 23:25:58,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:58,761 INFO L93 Difference]: Finished difference Result 1487 states and 3387 transitions. [2019-12-27 23:25:58,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:25:58,762 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:58,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:58,763 INFO L225 Difference]: With dead ends: 1487 [2019-12-27 23:25:58,763 INFO L226 Difference]: Without dead ends: 1338 [2019-12-27 23:25:58,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:25:58,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2019-12-27 23:25:58,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 957. [2019-12-27 23:25:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-12-27 23:25:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 2191 transitions. [2019-12-27 23:25:58,782 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 2191 transitions. Word has length 40 [2019-12-27 23:25:58,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:58,783 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 2191 transitions. [2019-12-27 23:25:58,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:58,783 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 2191 transitions. [2019-12-27 23:25:58,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:58,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:58,785 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:58,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:58,988 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:58,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:58,988 INFO L82 PathProgramCache]: Analyzing trace with hash 971951489, now seen corresponding path program 7 times [2019-12-27 23:25:58,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:58,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062490307] [2019-12-27 23:25:58,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:59,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062490307] [2019-12-27 23:25:59,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359898813] [2019-12-27 23:25:59,129 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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 [2019-12-27 23:25:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:59,173 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:59,174 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:59,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:59,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:59,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:59,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:59,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:59,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [922737475] [2019-12-27 23:25:59,302 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:59,304 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:59,320 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 226 transitions. [2019-12-27 23:25:59,320 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:59,322 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 23:25:59,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:59,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:59,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:59,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:59,323 INFO L87 Difference]: Start difference. First operand 957 states and 2191 transitions. Second operand 10 states. [2019-12-27 23:25:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:59,647 INFO L93 Difference]: Finished difference Result 1546 states and 3484 transitions. [2019-12-27 23:25:59,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:25:59,647 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:59,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:59,649 INFO L225 Difference]: With dead ends: 1546 [2019-12-27 23:25:59,649 INFO L226 Difference]: Without dead ends: 1439 [2019-12-27 23:25:59,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:25:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2019-12-27 23:25:59,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 953. [2019-12-27 23:25:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-12-27 23:25:59,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 2178 transitions. [2019-12-27 23:25:59,665 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 2178 transitions. Word has length 40 [2019-12-27 23:25:59,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:59,666 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 2178 transitions. [2019-12-27 23:25:59,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:59,666 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 2178 transitions. [2019-12-27 23:25:59,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:59,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:59,667 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:25:59,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:59,871 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:59,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:59,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1738561611, now seen corresponding path program 11 times [2019-12-27 23:25:59,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:59,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144108122] [2019-12-27 23:25:59,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:59,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:25:59,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144108122] [2019-12-27 23:25:59,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005992667] [2019-12-27 23:25:59,989 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2019-12-27 23:26:00,032 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 23:26:00,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:00,032 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:26:00,033 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:00,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:00,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:00,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:00,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:00,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:00,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:26:00,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2059943383] [2019-12-27 23:26:00,193 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:00,197 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:00,218 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 202 transitions. [2019-12-27 23:26:00,219 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:00,222 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 23:26:00,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:26:00,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:00,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:26:00,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:26:00,223 INFO L87 Difference]: Start difference. First operand 953 states and 2178 transitions. Second operand 10 states. [2019-12-27 23:26:00,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:00,700 INFO L93 Difference]: Finished difference Result 1607 states and 3606 transitions. [2019-12-27 23:26:00,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:26:00,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:26:00,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:00,704 INFO L225 Difference]: With dead ends: 1607 [2019-12-27 23:26:00,704 INFO L226 Difference]: Without dead ends: 1500 [2019-12-27 23:26:00,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:26:00,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2019-12-27 23:26:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 969. [2019-12-27 23:26:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-12-27 23:26:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 2218 transitions. [2019-12-27 23:26:00,728 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 2218 transitions. Word has length 40 [2019-12-27 23:26:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:00,729 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 2218 transitions. [2019-12-27 23:26:00,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:26:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 2218 transitions. [2019-12-27 23:26:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:26:00,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:00,732 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:00,935 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:00,936 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:00,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:00,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1748392641, now seen corresponding path program 12 times [2019-12-27 23:26:00,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:00,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327812218] [2019-12-27 23:26:00,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:01,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327812218] [2019-12-27 23:26:01,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640261872] [2019-12-27 23:26:01,142 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2019-12-27 23:26:01,247 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 23:26:01,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:01,248 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:26:01,249 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:01,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:01,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:01,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:01,482 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:01,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:01,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:26:01,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [190975663] [2019-12-27 23:26:01,483 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:01,487 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:01,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 202 transitions. [2019-12-27 23:26:01,512 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:01,515 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 23:26:01,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:26:01,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:01,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:26:01,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:26:01,516 INFO L87 Difference]: Start difference. First operand 969 states and 2218 transitions. Second operand 10 states. [2019-12-27 23:26:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:01,835 INFO L93 Difference]: Finished difference Result 1595 states and 3586 transitions. [2019-12-27 23:26:01,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:26:01,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:26:01,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:01,837 INFO L225 Difference]: With dead ends: 1595 [2019-12-27 23:26:01,837 INFO L226 Difference]: Without dead ends: 1488 [2019-12-27 23:26:01,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:26:01,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-12-27 23:26:01,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 949. [2019-12-27 23:26:01,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-12-27 23:26:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2165 transitions. [2019-12-27 23:26:01,853 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2165 transitions. Word has length 40 [2019-12-27 23:26:01,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:01,853 INFO L462 AbstractCegarLoop]: Abstraction has 949 states and 2165 transitions. [2019-12-27 23:26:01,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:26:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2165 transitions. [2019-12-27 23:26:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:26:01,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:01,855 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:02,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:02,060 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:02,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:02,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1298679733, now seen corresponding path program 13 times [2019-12-27 23:26:02,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:02,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371029824] [2019-12-27 23:26:02,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:02,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371029824] [2019-12-27 23:26:02,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323522391] [2019-12-27 23:26:02,189 INFO L92 rtionOrderModulation]: Changing assertion order to 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 [2019-12-27 23:26:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:02,232 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:26:02,233 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:02,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:02,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:02,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:02,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:02,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:02,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:26:02,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1798503573] [2019-12-27 23:26:02,325 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:02,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:02,341 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 178 transitions. [2019-12-27 23:26:02,341 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:02,343 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:26:02,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:26:02,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:02,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:26:02,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:26:02,344 INFO L87 Difference]: Start difference. First operand 949 states and 2165 transitions. Second operand 10 states. [2019-12-27 23:26:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:02,710 INFO L93 Difference]: Finished difference Result 1647 states and 3686 transitions. [2019-12-27 23:26:02,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:02,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:26:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:02,714 INFO L225 Difference]: With dead ends: 1647 [2019-12-27 23:26:02,714 INFO L226 Difference]: Without dead ends: 1540 [2019-12-27 23:26:02,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2019-12-27 23:26:02,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2019-12-27 23:26:02,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 981. [2019-12-27 23:26:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-12-27 23:26:02,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 2245 transitions. [2019-12-27 23:26:02,727 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 2245 transitions. Word has length 40 [2019-12-27 23:26:02,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:02,727 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 2245 transitions. [2019-12-27 23:26:02,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:26:02,727 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 2245 transitions. [2019-12-27 23:26:02,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:26:02,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:02,728 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:02,931 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:02,932 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:02,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:02,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1288848703, now seen corresponding path program 14 times [2019-12-27 23:26:02,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:02,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011930900] [2019-12-27 23:26:02,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:03,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011930900] [2019-12-27 23:26:03,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31142233] [2019-12-27 23:26:03,050 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-12-27 23:26:03,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:26:03,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:03,096 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:26:03,097 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:03,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:03,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:03,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:03,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:03,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:26:03,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1957158203] [2019-12-27 23:26:03,202 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:03,215 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:03,228 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 178 transitions. [2019-12-27 23:26:03,228 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:03,230 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:26:03,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:26:03,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:03,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:26:03,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:26:03,231 INFO L87 Difference]: Start difference. First operand 981 states and 2245 transitions. Second operand 10 states. [2019-12-27 23:26:03,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:03,589 INFO L93 Difference]: Finished difference Result 1675 states and 3746 transitions. [2019-12-27 23:26:03,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:03,590 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:26:03,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:03,592 INFO L225 Difference]: With dead ends: 1675 [2019-12-27 23:26:03,592 INFO L226 Difference]: Without dead ends: 1568 [2019-12-27 23:26:03,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2019-12-27 23:26:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2019-12-27 23:26:03,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 965. [2019-12-27 23:26:03,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-12-27 23:26:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 2205 transitions. [2019-12-27 23:26:03,610 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 2205 transitions. Word has length 40 [2019-12-27 23:26:03,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:03,611 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 2205 transitions. [2019-12-27 23:26:03,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:26:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 2205 transitions. [2019-12-27 23:26:03,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:26:03,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:03,612 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:03,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:03,816 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:03,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:03,816 INFO L82 PathProgramCache]: Analyzing trace with hash -522238581, now seen corresponding path program 15 times [2019-12-27 23:26:03,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:03,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83096531] [2019-12-27 23:26:03,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:03,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83096531] [2019-12-27 23:26:03,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674449965] [2019-12-27 23:26:03,949 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-12-27 23:26:04,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 23:26:04,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:04,004 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:26:04,005 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:04,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:04,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:04,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:04,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:04,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:26:04,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1224978543] [2019-12-27 23:26:04,149 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:04,151 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:04,165 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 178 transitions. [2019-12-27 23:26:04,165 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:04,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:26:04,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:26:04,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:04,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:26:04,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:26:04,168 INFO L87 Difference]: Start difference. First operand 965 states and 2205 transitions. Second operand 10 states. [2019-12-27 23:26:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:04,547 INFO L93 Difference]: Finished difference Result 1647 states and 3686 transitions. [2019-12-27 23:26:04,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:04,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:26:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:04,549 INFO L225 Difference]: With dead ends: 1647 [2019-12-27 23:26:04,549 INFO L226 Difference]: Without dead ends: 1540 [2019-12-27 23:26:04,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2019-12-27 23:26:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2019-12-27 23:26:04,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 981. [2019-12-27 23:26:04,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-12-27 23:26:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 2245 transitions. [2019-12-27 23:26:04,564 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 2245 transitions. Word has length 40 [2019-12-27 23:26:04,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:04,565 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 2245 transitions. [2019-12-27 23:26:04,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:26:04,565 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 2245 transitions. [2019-12-27 23:26:04,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:26:04,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:04,566 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:04,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:04,769 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:04,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:04,770 INFO L82 PathProgramCache]: Analyzing trace with hash -512407551, now seen corresponding path program 16 times [2019-12-27 23:26:04,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:04,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708324578] [2019-12-27 23:26:04,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:04,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708324578] [2019-12-27 23:26:04,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790933544] [2019-12-27 23:26:04,894 INFO L92 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 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 [2019-12-27 23:26:04,960 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:26:04,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:04,963 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:26:04,964 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:05,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:05,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:05,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:05,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:05,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:26:05,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [615676038] [2019-12-27 23:26:05,142 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:05,149 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:05,177 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 178 transitions. [2019-12-27 23:26:05,177 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:05,181 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:26:05,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:26:05,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:05,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:26:05,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:26:05,182 INFO L87 Difference]: Start difference. First operand 981 states and 2245 transitions. Second operand 10 states. [2019-12-27 23:26:05,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:05,539 INFO L93 Difference]: Finished difference Result 1548 states and 3488 transitions. [2019-12-27 23:26:05,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:05,539 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:26:05,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:05,541 INFO L225 Difference]: With dead ends: 1548 [2019-12-27 23:26:05,541 INFO L226 Difference]: Without dead ends: 1441 [2019-12-27 23:26:05,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2019-12-27 23:26:05,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2019-12-27 23:26:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 966. [2019-12-27 23:26:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2019-12-27 23:26:05,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2191 transitions. [2019-12-27 23:26:05,553 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2191 transitions. Word has length 40 [2019-12-27 23:26:05,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:05,553 INFO L462 AbstractCegarLoop]: Abstraction has 966 states and 2191 transitions. [2019-12-27 23:26:05,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:26:05,554 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2191 transitions. [2019-12-27 23:26:05,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:05,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:05,555 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:05,755 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:05,755 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:05,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:05,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1743373313, now seen corresponding path program 5 times [2019-12-27 23:26:05,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:05,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552712277] [2019-12-27 23:26:05,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:05,914 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:05,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552712277] [2019-12-27 23:26:05,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006668507] [2019-12-27 23:26:05,914 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2019-12-27 23:26:05,961 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-12-27 23:26:05,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:05,962 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:05,962 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:06,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:06,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:06,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:06,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:06,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:06,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1723069858] [2019-12-27 23:26:06,070 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:06,075 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:06,083 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 44 transitions. [2019-12-27 23:26:06,083 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:06,084 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:26:06,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:06,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:06,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:06,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:06,085 INFO L87 Difference]: Start difference. First operand 966 states and 2191 transitions. Second operand 11 states. [2019-12-27 23:26:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:06,415 INFO L93 Difference]: Finished difference Result 1357 states and 3106 transitions. [2019-12-27 23:26:06,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:26:06,416 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:06,418 INFO L225 Difference]: With dead ends: 1357 [2019-12-27 23:26:06,419 INFO L226 Difference]: Without dead ends: 1201 [2019-12-27 23:26:06,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:26:06,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-12-27 23:26:06,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1007. [2019-12-27 23:26:06,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-12-27 23:26:06,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 2294 transitions. [2019-12-27 23:26:06,439 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 2294 transitions. Word has length 44 [2019-12-27 23:26:06,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:06,440 INFO L462 AbstractCegarLoop]: Abstraction has 1007 states and 2294 transitions. [2019-12-27 23:26:06,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:06,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 2294 transitions. [2019-12-27 23:26:06,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:06,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:06,443 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:06,647 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:06,647 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:06,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:06,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1100398856, now seen corresponding path program 7 times [2019-12-27 23:26:06,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:06,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254834589] [2019-12-27 23:26:06,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:06,854 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:06,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254834589] [2019-12-27 23:26:06,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760485956] [2019-12-27 23:26:06,855 INFO L92 rtionOrderModulation]: Changing assertion order to 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 [2019-12-27 23:26:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:06,927 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:06,928 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:07,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:07,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:07,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:07,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:07,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:07,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [365207182] [2019-12-27 23:26:07,105 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:07,111 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:07,136 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:07,137 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:07,137 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:26:07,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:07,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:07,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:07,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:07,138 INFO L87 Difference]: Start difference. First operand 1007 states and 2294 transitions. Second operand 11 states. [2019-12-27 23:26:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:07,457 INFO L93 Difference]: Finished difference Result 1508 states and 3408 transitions. [2019-12-27 23:26:07,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:26:07,457 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:07,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:07,459 INFO L225 Difference]: With dead ends: 1508 [2019-12-27 23:26:07,459 INFO L226 Difference]: Without dead ends: 1401 [2019-12-27 23:26:07,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:26:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2019-12-27 23:26:07,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1003. [2019-12-27 23:26:07,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2019-12-27 23:26:07,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 2281 transitions. [2019-12-27 23:26:07,473 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 2281 transitions. Word has length 44 [2019-12-27 23:26:07,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:07,473 INFO L462 AbstractCegarLoop]: Abstraction has 1003 states and 2281 transitions. [2019-12-27 23:26:07,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 2281 transitions. [2019-12-27 23:26:07,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:07,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:07,475 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:07,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:07,684 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:07,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:07,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1998637952, now seen corresponding path program 8 times [2019-12-27 23:26:07,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:07,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275587416] [2019-12-27 23:26:07,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:07,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275587416] [2019-12-27 23:26:07,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487153547] [2019-12-27 23:26:07,816 INFO L92 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 [2019-12-27 23:26:07,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:26:07,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:07,860 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:07,861 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:09,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:09,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:09,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:09,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:09,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:09,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2135906006] [2019-12-27 23:26:09,029 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:09,034 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:09,060 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:09,060 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:09,061 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:26:09,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:09,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:09,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:09,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=236, Unknown=2, NotChecked=0, Total=306 [2019-12-27 23:26:09,062 INFO L87 Difference]: Start difference. First operand 1003 states and 2281 transitions. Second operand 11 states. [2019-12-27 23:26:10,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:10,074 INFO L93 Difference]: Finished difference Result 1647 states and 3686 transitions. [2019-12-27 23:26:10,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:26:10,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:10,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:10,076 INFO L225 Difference]: With dead ends: 1647 [2019-12-27 23:26:10,076 INFO L226 Difference]: Without dead ends: 1540 [2019-12-27 23:26:10,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=183, Invalid=516, Unknown=3, NotChecked=0, Total=702 [2019-12-27 23:26:10,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2019-12-27 23:26:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1019. [2019-12-27 23:26:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-12-27 23:26:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 2321 transitions. [2019-12-27 23:26:10,094 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 2321 transitions. Word has length 44 [2019-12-27 23:26:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:10,094 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 2321 transitions. [2019-12-27 23:26:10,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 2321 transitions. [2019-12-27 23:26:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:10,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:10,096 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:10,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:10,299 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:10,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:10,300 INFO L82 PathProgramCache]: Analyzing trace with hash 763575608, now seen corresponding path program 17 times [2019-12-27 23:26:10,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:10,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559292726] [2019-12-27 23:26:10,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:10,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559292726] [2019-12-27 23:26:10,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862648365] [2019-12-27 23:26:10,523 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2019-12-27 23:26:10,585 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 23:26:10,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:10,586 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:10,587 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:10,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:10,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:10,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:10,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:10,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:10,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2079521052] [2019-12-27 23:26:10,725 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:10,728 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:10,742 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 158 transitions. [2019-12-27 23:26:10,743 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:10,743 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:26:10,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:10,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:10,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:10,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:10,744 INFO L87 Difference]: Start difference. First operand 1019 states and 2321 transitions. Second operand 11 states. [2019-12-27 23:26:11,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:11,091 INFO L93 Difference]: Finished difference Result 1616 states and 3628 transitions. [2019-12-27 23:26:11,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:26:11,091 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:11,092 INFO L225 Difference]: With dead ends: 1616 [2019-12-27 23:26:11,093 INFO L226 Difference]: Without dead ends: 1509 [2019-12-27 23:26:11,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2019-12-27 23:26:11,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2019-12-27 23:26:11,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 999. [2019-12-27 23:26:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-12-27 23:26:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 2268 transitions. [2019-12-27 23:26:11,104 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 2268 transitions. Word has length 44 [2019-12-27 23:26:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:11,104 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 2268 transitions. [2019-12-27 23:26:11,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 2268 transitions. [2019-12-27 23:26:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:11,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:11,106 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:11,306 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:11,306 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:11,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:11,307 INFO L82 PathProgramCache]: Analyzing trace with hash 862358426, now seen corresponding path program 18 times [2019-12-27 23:26:11,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:11,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297930061] [2019-12-27 23:26:11,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:11,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297930061] [2019-12-27 23:26:11,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9213975] [2019-12-27 23:26:11,441 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2019-12-27 23:26:11,490 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 23:26:11,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:11,494 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:11,495 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:11,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:11,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:11,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:11,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:11,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:11,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [379444631] [2019-12-27 23:26:11,738 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:11,740 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:11,756 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:11,757 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:11,757 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:26:11,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:11,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:11,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:11,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:11,758 INFO L87 Difference]: Start difference. First operand 999 states and 2268 transitions. Second operand 11 states. [2019-12-27 23:26:12,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:12,137 INFO L93 Difference]: Finished difference Result 1727 states and 3846 transitions. [2019-12-27 23:26:12,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:26:12,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:12,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:12,140 INFO L225 Difference]: With dead ends: 1727 [2019-12-27 23:26:12,140 INFO L226 Difference]: Without dead ends: 1620 [2019-12-27 23:26:12,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2019-12-27 23:26:12,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2019-12-27 23:26:12,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1031. [2019-12-27 23:26:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2019-12-27 23:26:12,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2348 transitions. [2019-12-27 23:26:12,158 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2348 transitions. Word has length 44 [2019-12-27 23:26:12,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:12,159 INFO L462 AbstractCegarLoop]: Abstraction has 1031 states and 2348 transitions. [2019-12-27 23:26:12,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2348 transitions. [2019-12-27 23:26:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:12,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:12,160 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:12,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:12,364 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:12,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:12,364 INFO L82 PathProgramCache]: Analyzing trace with hash 872189456, now seen corresponding path program 19 times [2019-12-27 23:26:12,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:12,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116051433] [2019-12-27 23:26:12,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:12,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116051433] [2019-12-27 23:26:12,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519314959] [2019-12-27 23:26:12,515 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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 [2019-12-27 23:26:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:12,558 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:12,559 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:13,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:13,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:13,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:13,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:13,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:13,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1744439763] [2019-12-27 23:26:13,362 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:13,364 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:13,380 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:13,381 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:13,382 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:26:13,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:13,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:13,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:13,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:13,382 INFO L87 Difference]: Start difference. First operand 1031 states and 2348 transitions. Second operand 11 states. [2019-12-27 23:26:14,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:14,726 INFO L93 Difference]: Finished difference Result 1743 states and 3886 transitions. [2019-12-27 23:26:14,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:26:14,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:14,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:14,729 INFO L225 Difference]: With dead ends: 1743 [2019-12-27 23:26:14,729 INFO L226 Difference]: Without dead ends: 1636 [2019-12-27 23:26:14,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=197, Invalid=557, Unknown=2, NotChecked=0, Total=756 [2019-12-27 23:26:14,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2019-12-27 23:26:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1031. [2019-12-27 23:26:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2019-12-27 23:26:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2348 transitions. [2019-12-27 23:26:14,744 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2348 transitions. Word has length 44 [2019-12-27 23:26:14,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:14,744 INFO L462 AbstractCegarLoop]: Abstraction has 1031 states and 2348 transitions. [2019-12-27 23:26:14,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2348 transitions. [2019-12-27 23:26:14,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:14,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:14,745 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:14,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:14,946 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:14,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:14,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1727273848, now seen corresponding path program 20 times [2019-12-27 23:26:14,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:14,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189662055] [2019-12-27 23:26:14,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:15,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189662055] [2019-12-27 23:26:15,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120879889] [2019-12-27 23:26:15,106 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-12-27 23:26:15,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:26:15,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:15,154 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:15,156 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:15,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:15,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:15,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:15,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:15,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:15,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [475253158] [2019-12-27 23:26:15,329 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:15,332 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:15,345 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 134 transitions. [2019-12-27 23:26:15,345 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:15,346 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:26:15,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:15,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:15,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:15,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:15,347 INFO L87 Difference]: Start difference. First operand 1031 states and 2348 transitions. Second operand 11 states. [2019-12-27 23:26:15,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:15,684 INFO L93 Difference]: Finished difference Result 1703 states and 3806 transitions. [2019-12-27 23:26:15,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:26:15,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:15,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:15,686 INFO L225 Difference]: With dead ends: 1703 [2019-12-27 23:26:15,686 INFO L226 Difference]: Without dead ends: 1596 [2019-12-27 23:26:15,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=563, Unknown=0, NotChecked=0, Total=756 [2019-12-27 23:26:15,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2019-12-27 23:26:15,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 995. [2019-12-27 23:26:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-12-27 23:26:15,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 2255 transitions. [2019-12-27 23:26:15,698 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 2255 transitions. Word has length 44 [2019-12-27 23:26:15,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:15,698 INFO L462 AbstractCegarLoop]: Abstraction has 995 states and 2255 transitions. [2019-12-27 23:26:15,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:15,699 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 2255 transitions. [2019-12-27 23:26:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:15,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:15,700 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:15,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:15,904 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:15,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:15,904 INFO L82 PathProgramCache]: Analyzing trace with hash -667242828, now seen corresponding path program 21 times [2019-12-27 23:26:15,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:15,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124176413] [2019-12-27 23:26:15,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:16,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124176413] [2019-12-27 23:26:16,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725990939] [2019-12-27 23:26:16,042 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-12-27 23:26:16,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:26:16,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:16,089 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:16,090 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:16,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:16,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:16,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:16,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:16,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:16,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:16,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [548818733] [2019-12-27 23:26:16,260 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:16,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:16,280 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:16,280 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:16,281 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:26:16,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:16,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:16,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:16,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:16,282 INFO L87 Difference]: Start difference. First operand 995 states and 2255 transitions. Second operand 11 states. [2019-12-27 23:26:16,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:16,694 INFO L93 Difference]: Finished difference Result 1746 states and 3884 transitions. [2019-12-27 23:26:16,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:16,694 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:16,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:16,696 INFO L225 Difference]: With dead ends: 1746 [2019-12-27 23:26:16,696 INFO L226 Difference]: Without dead ends: 1639 [2019-12-27 23:26:16,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=606, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:26:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-12-27 23:26:16,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1043. [2019-12-27 23:26:16,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-12-27 23:26:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 2375 transitions. [2019-12-27 23:26:16,710 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 2375 transitions. Word has length 44 [2019-12-27 23:26:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:16,710 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 2375 transitions. [2019-12-27 23:26:16,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 2375 transitions. [2019-12-27 23:26:16,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:16,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:16,711 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:16,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:16,912 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:16,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:16,913 INFO L82 PathProgramCache]: Analyzing trace with hash -657411798, now seen corresponding path program 22 times [2019-12-27 23:26:16,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:16,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935462408] [2019-12-27 23:26:16,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:17,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935462408] [2019-12-27 23:26:17,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215223730] [2019-12-27 23:26:17,045 INFO L92 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 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 [2019-12-27 23:26:17,089 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:26:17,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:17,090 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:17,091 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:17,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:17,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:17,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:17,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:17,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:17,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [592458820] [2019-12-27 23:26:17,295 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:17,298 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:17,332 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:17,332 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:17,333 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:26:17,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:17,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:17,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:17,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:17,334 INFO L87 Difference]: Start difference. First operand 1043 states and 2375 transitions. Second operand 11 states. [2019-12-27 23:26:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:17,786 INFO L93 Difference]: Finished difference Result 1743 states and 3886 transitions. [2019-12-27 23:26:17,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:17,787 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:17,788 INFO L225 Difference]: With dead ends: 1743 [2019-12-27 23:26:17,788 INFO L226 Difference]: Without dead ends: 1636 [2019-12-27 23:26:17,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:26:17,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2019-12-27 23:26:17,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1043. [2019-12-27 23:26:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-12-27 23:26:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 2375 transitions. [2019-12-27 23:26:17,800 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 2375 transitions. Word has length 44 [2019-12-27 23:26:17,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:17,800 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 2375 transitions. [2019-12-27 23:26:17,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:17,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 2375 transitions. [2019-12-27 23:26:17,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:17,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:17,802 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:18,003 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:18,003 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:18,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:18,004 INFO L82 PathProgramCache]: Analyzing trace with hash 109198324, now seen corresponding path program 23 times [2019-12-27 23:26:18,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:18,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680087845] [2019-12-27 23:26:18,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:18,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680087845] [2019-12-27 23:26:18,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632676106] [2019-12-27 23:26:18,137 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2019-12-27 23:26:18,182 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 23:26:18,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:18,183 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:18,183 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:18,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:18,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:18,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:18,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:18,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:18,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2010450698] [2019-12-27 23:26:18,391 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:18,394 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:18,411 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:18,411 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:18,412 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:26:18,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:18,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:18,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:18,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:18,413 INFO L87 Difference]: Start difference. First operand 1043 states and 2375 transitions. Second operand 11 states. [2019-12-27 23:26:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:18,894 INFO L93 Difference]: Finished difference Result 1799 states and 4006 transitions. [2019-12-27 23:26:18,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:18,894 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:18,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:18,896 INFO L225 Difference]: With dead ends: 1799 [2019-12-27 23:26:18,896 INFO L226 Difference]: Without dead ends: 1692 [2019-12-27 23:26:18,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:26:18,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2019-12-27 23:26:18,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1059. [2019-12-27 23:26:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2019-12-27 23:26:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 2415 transitions. [2019-12-27 23:26:18,910 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 2415 transitions. Word has length 44 [2019-12-27 23:26:18,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:18,910 INFO L462 AbstractCegarLoop]: Abstraction has 1059 states and 2415 transitions. [2019-12-27 23:26:18,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:18,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 2415 transitions. [2019-12-27 23:26:18,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:18,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:18,911 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:19,112 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:19,112 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:19,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:19,113 INFO L82 PathProgramCache]: Analyzing trace with hash 119029354, now seen corresponding path program 24 times [2019-12-27 23:26:19,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:19,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645963052] [2019-12-27 23:26:19,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:19,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645963052] [2019-12-27 23:26:19,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276110599] [2019-12-27 23:26:19,248 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2019-12-27 23:26:19,292 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 23:26:19,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:19,293 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:19,294 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:25,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:25,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:25,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:25,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:25,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:25,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1660551050] [2019-12-27 23:26:25,634 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:25,636 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:25,654 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:25,654 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:25,656 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:26:25,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:25,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:25,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:25,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:25,657 INFO L87 Difference]: Start difference. First operand 1059 states and 2415 transitions. Second operand 11 states. [2019-12-27 23:26:32,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:32,142 INFO L93 Difference]: Finished difference Result 1815 states and 4046 transitions. [2019-12-27 23:26:32,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:32,143 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:32,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:32,145 INFO L225 Difference]: With dead ends: 1815 [2019-12-27 23:26:32,145 INFO L226 Difference]: Without dead ends: 1708 [2019-12-27 23:26:32,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=204, Invalid=605, Unknown=3, NotChecked=0, Total=812 [2019-12-27 23:26:32,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2019-12-27 23:26:32,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1043. [2019-12-27 23:26:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-12-27 23:26:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 2375 transitions. [2019-12-27 23:26:32,161 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 2375 transitions. Word has length 44 [2019-12-27 23:26:32,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:32,161 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 2375 transitions. [2019-12-27 23:26:32,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 2375 transitions. [2019-12-27 23:26:32,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:32,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:32,163 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:32,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:32,364 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:32,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:32,364 INFO L82 PathProgramCache]: Analyzing trace with hash -64405424, now seen corresponding path program 25 times [2019-12-27 23:26:32,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:32,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961359459] [2019-12-27 23:26:32,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:32,524 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:32,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961359459] [2019-12-27 23:26:32,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024574190] [2019-12-27 23:26:32,524 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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 [2019-12-27 23:26:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:32,579 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:32,580 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:32,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:32,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:32,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:32,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:32,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:32,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1872118106] [2019-12-27 23:26:32,889 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:32,891 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:32,906 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 158 transitions. [2019-12-27 23:26:32,907 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:32,908 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:26:32,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:32,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:32,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:32,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:32,908 INFO L87 Difference]: Start difference. First operand 1043 states and 2375 transitions. Second operand 11 states. [2019-12-27 23:26:33,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:33,324 INFO L93 Difference]: Finished difference Result 1763 states and 3946 transitions. [2019-12-27 23:26:33,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:33,325 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:33,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:33,327 INFO L225 Difference]: With dead ends: 1763 [2019-12-27 23:26:33,327 INFO L226 Difference]: Without dead ends: 1656 [2019-12-27 23:26:33,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:26:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2019-12-27 23:26:33,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1043. [2019-12-27 23:26:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-12-27 23:26:33,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 2375 transitions. [2019-12-27 23:26:33,341 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 2375 transitions. Word has length 44 [2019-12-27 23:26:33,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:33,342 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 2375 transitions. [2019-12-27 23:26:33,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:33,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 2375 transitions. [2019-12-27 23:26:33,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:33,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:33,343 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:33,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:33,544 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:33,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:33,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1538532936, now seen corresponding path program 26 times [2019-12-27 23:26:33,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:33,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296644623] [2019-12-27 23:26:33,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:33,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296644623] [2019-12-27 23:26:33,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35732939] [2019-12-27 23:26:33,724 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-12-27 23:26:33,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:26:33,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:33,800 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:33,801 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:33,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:33,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:33,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:34,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:34,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:34,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1990080815] [2019-12-27 23:26:34,002 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:34,006 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:34,019 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 110 transitions. [2019-12-27 23:26:34,019 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:34,020 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:26:34,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:34,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:34,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:34,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:34,021 INFO L87 Difference]: Start difference. First operand 1043 states and 2375 transitions. Second operand 11 states. [2019-12-27 23:26:34,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:34,375 INFO L93 Difference]: Finished difference Result 1710 states and 3824 transitions. [2019-12-27 23:26:34,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:34,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:34,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:34,377 INFO L225 Difference]: With dead ends: 1710 [2019-12-27 23:26:34,377 INFO L226 Difference]: Without dead ends: 1603 [2019-12-27 23:26:34,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=608, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:26:34,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-12-27 23:26:34,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 994. [2019-12-27 23:26:34,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-12-27 23:26:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 2251 transitions. [2019-12-27 23:26:34,390 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 2251 transitions. Word has length 44 [2019-12-27 23:26:34,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:34,390 INFO L462 AbstractCegarLoop]: Abstraction has 994 states and 2251 transitions. [2019-12-27 23:26:34,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:34,390 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 2251 transitions. [2019-12-27 23:26:34,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:34,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:34,391 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:34,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:34,592 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:34,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:34,593 INFO L82 PathProgramCache]: Analyzing trace with hash -508316466, now seen corresponding path program 27 times [2019-12-27 23:26:34,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:34,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333789243] [2019-12-27 23:26:34,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:34,715 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:34,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333789243] [2019-12-27 23:26:34,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058121423] [2019-12-27 23:26:34,715 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-12-27 23:26:34,763 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 23:26:34,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:34,764 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:34,765 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:34,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:34,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:34,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:34,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:34,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:34,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1443289586] [2019-12-27 23:26:34,886 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:34,888 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:34,905 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:34,906 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:34,907 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:26:34,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:34,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:34,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:34,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:34,908 INFO L87 Difference]: Start difference. First operand 994 states and 2251 transitions. Second operand 11 states. [2019-12-27 23:26:35,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:35,327 INFO L93 Difference]: Finished difference Result 1765 states and 3922 transitions. [2019-12-27 23:26:35,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:35,328 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:35,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:35,329 INFO L225 Difference]: With dead ends: 1765 [2019-12-27 23:26:35,329 INFO L226 Difference]: Without dead ends: 1658 [2019-12-27 23:26:35,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:26:35,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2019-12-27 23:26:35,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1058. [2019-12-27 23:26:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2019-12-27 23:26:35,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 2411 transitions. [2019-12-27 23:26:35,342 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 2411 transitions. Word has length 44 [2019-12-27 23:26:35,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:35,342 INFO L462 AbstractCegarLoop]: Abstraction has 1058 states and 2411 transitions. [2019-12-27 23:26:35,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 2411 transitions. [2019-12-27 23:26:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:35,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:35,344 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:35,545 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:35,546 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:35,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:35,546 INFO L82 PathProgramCache]: Analyzing trace with hash -498485436, now seen corresponding path program 28 times [2019-12-27 23:26:35,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:35,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928746525] [2019-12-27 23:26:35,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:35,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928746525] [2019-12-27 23:26:35,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95132942] [2019-12-27 23:26:35,695 INFO L92 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 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 [2019-12-27 23:26:35,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:26:35,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:35,769 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:35,770 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:37,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:37,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:37,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:37,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:37,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:37,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [794626617] [2019-12-27 23:26:37,126 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:37,128 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:37,146 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:37,146 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:37,148 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:26:37,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:37,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:37,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:37,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:37,149 INFO L87 Difference]: Start difference. First operand 1058 states and 2411 transitions. Second operand 11 states. [2019-12-27 23:26:37,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:37,984 INFO L93 Difference]: Finished difference Result 1762 states and 3924 transitions. [2019-12-27 23:26:37,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:37,985 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:37,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:37,987 INFO L225 Difference]: With dead ends: 1762 [2019-12-27 23:26:37,987 INFO L226 Difference]: Without dead ends: 1655 [2019-12-27 23:26:37,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=198, Invalid=613, Unknown=1, NotChecked=0, Total=812 [2019-12-27 23:26:37,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2019-12-27 23:26:37,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1058. [2019-12-27 23:26:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2019-12-27 23:26:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 2411 transitions. [2019-12-27 23:26:37,999 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 2411 transitions. Word has length 44 [2019-12-27 23:26:37,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:37,999 INFO L462 AbstractCegarLoop]: Abstraction has 1058 states and 2411 transitions. [2019-12-27 23:26:38,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 2411 transitions. [2019-12-27 23:26:38,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:38,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:38,001 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:38,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:38,202 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:38,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:38,202 INFO L82 PathProgramCache]: Analyzing trace with hash 268124686, now seen corresponding path program 29 times [2019-12-27 23:26:38,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:38,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258318996] [2019-12-27 23:26:38,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:38,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258318996] [2019-12-27 23:26:38,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579792480] [2019-12-27 23:26:38,356 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2019-12-27 23:26:38,402 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 23:26:38,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:38,403 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:38,404 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:40,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:40,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:40,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:40,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:40,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:40,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [547401812] [2019-12-27 23:26:40,067 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:40,071 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:40,091 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:40,091 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:40,093 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:26:40,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:40,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:40,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:40,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=237, Unknown=1, NotChecked=0, Total=306 [2019-12-27 23:26:40,094 INFO L87 Difference]: Start difference. First operand 1058 states and 2411 transitions. Second operand 11 states. [2019-12-27 23:26:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:42,722 INFO L93 Difference]: Finished difference Result 1839 states and 4086 transitions. [2019-12-27 23:26:42,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:26:42,722 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:42,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:42,724 INFO L225 Difference]: With dead ends: 1839 [2019-12-27 23:26:42,725 INFO L226 Difference]: Without dead ends: 1732 [2019-12-27 23:26:42,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=229, Invalid=696, Unknown=5, NotChecked=0, Total=930 [2019-12-27 23:26:42,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2019-12-27 23:26:42,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1074. [2019-12-27 23:26:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1074 states. [2019-12-27 23:26:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 2451 transitions. [2019-12-27 23:26:42,739 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 2451 transitions. Word has length 44 [2019-12-27 23:26:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:42,740 INFO L462 AbstractCegarLoop]: Abstraction has 1074 states and 2451 transitions. [2019-12-27 23:26:42,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 2451 transitions. [2019-12-27 23:26:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:42,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:42,741 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:42,941 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:42,942 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:42,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:42,943 INFO L82 PathProgramCache]: Analyzing trace with hash 277955716, now seen corresponding path program 30 times [2019-12-27 23:26:42,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:42,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228755633] [2019-12-27 23:26:42,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:43,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228755633] [2019-12-27 23:26:43,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056235038] [2019-12-27 23:26:43,085 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2019-12-27 23:26:43,131 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 23:26:43,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:43,133 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:43,134 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:43,629 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_~i~0_116 Int)) (and (<= c_~i~0 (+ v_~i~0_116 c_~j~0)) (<= c_~j~0 (+ (* 2 v_~i~0_116) 2)) (<= (div (+ (* v_~i~0_116 (- 1)) 1) (- 2)) 2))) is different from true [2019-12-27 23:26:43,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:43,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:43,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:43,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:43,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:43,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1349234504] [2019-12-27 23:26:43,639 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:43,641 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:43,659 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:43,659 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:43,660 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:26:43,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:43,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:43,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:43,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=212, Unknown=1, NotChecked=30, Total=306 [2019-12-27 23:26:43,661 INFO L87 Difference]: Start difference. First operand 1074 states and 2451 transitions. Second operand 11 states. [2019-12-27 23:26:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:44,070 INFO L93 Difference]: Finished difference Result 1796 states and 4008 transitions. [2019-12-27 23:26:44,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:26:44,070 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:44,072 INFO L225 Difference]: With dead ends: 1796 [2019-12-27 23:26:44,072 INFO L226 Difference]: Without dead ends: 1689 [2019-12-27 23:26:44,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=605, Unknown=1, NotChecked=54, Total=870 [2019-12-27 23:26:44,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2019-12-27 23:26:44,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1058. [2019-12-27 23:26:44,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2019-12-27 23:26:44,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 2411 transitions. [2019-12-27 23:26:44,084 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 2411 transitions. Word has length 44 [2019-12-27 23:26:44,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:44,084 INFO L462 AbstractCegarLoop]: Abstraction has 1058 states and 2411 transitions. [2019-12-27 23:26:44,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:44,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 2411 transitions. [2019-12-27 23:26:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:44,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:44,086 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:44,286 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:44,287 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:44,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:44,287 INFO L82 PathProgramCache]: Analyzing trace with hash 94520938, now seen corresponding path program 31 times [2019-12-27 23:26:44,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:44,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056625972] [2019-12-27 23:26:44,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:44,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056625972] [2019-12-27 23:26:44,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312627388] [2019-12-27 23:26:44,475 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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 [2019-12-27 23:26:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:44,546 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:44,554 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:47,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:47,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:47,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:47,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:47,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:47,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2122540801] [2019-12-27 23:26:47,260 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:47,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:47,276 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 158 transitions. [2019-12-27 23:26:47,276 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:47,277 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:26:47,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:47,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:47,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:47,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=238, Unknown=1, NotChecked=0, Total=306 [2019-12-27 23:26:47,277 INFO L87 Difference]: Start difference. First operand 1058 states and 2411 transitions. Second operand 11 states. [2019-12-27 23:26:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:49,665 INFO L93 Difference]: Finished difference Result 1744 states and 3908 transitions. [2019-12-27 23:26:49,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:26:49,666 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:49,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:49,667 INFO L225 Difference]: With dead ends: 1744 [2019-12-27 23:26:49,667 INFO L226 Difference]: Without dead ends: 1637 [2019-12-27 23:26:49,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=214, Invalid=652, Unknown=4, NotChecked=0, Total=870 [2019-12-27 23:26:49,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2019-12-27 23:26:49,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1058. [2019-12-27 23:26:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2019-12-27 23:26:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 2411 transitions. [2019-12-27 23:26:49,679 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 2411 transitions. Word has length 44 [2019-12-27 23:26:49,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:49,680 INFO L462 AbstractCegarLoop]: Abstraction has 1058 states and 2411 transitions. [2019-12-27 23:26:49,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:49,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 2411 transitions. [2019-12-27 23:26:49,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:49,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:49,681 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:49,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:49,881 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:49,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:49,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1525850638, now seen corresponding path program 32 times [2019-12-27 23:26:49,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:49,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477870123] [2019-12-27 23:26:49,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:50,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477870123] [2019-12-27 23:26:50,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398716669] [2019-12-27 23:26:50,033 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-12-27 23:26:50,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:26:50,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:50,078 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:50,080 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:50,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:50,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:50,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:50,220 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:50,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:50,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:50,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [267324985] [2019-12-27 23:26:50,221 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:50,223 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:50,240 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:50,240 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:50,241 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:26:50,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:50,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:50,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:50,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:50,242 INFO L87 Difference]: Start difference. First operand 1058 states and 2411 transitions. Second operand 11 states. [2019-12-27 23:26:50,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:50,673 INFO L93 Difference]: Finished difference Result 1852 states and 4114 transitions. [2019-12-27 23:26:50,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:26:50,674 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:50,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:50,675 INFO L225 Difference]: With dead ends: 1852 [2019-12-27 23:26:50,675 INFO L226 Difference]: Without dead ends: 1745 [2019-12-27 23:26:50,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:26:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2019-12-27 23:26:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1090. [2019-12-27 23:26:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-12-27 23:26:50,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 2491 transitions. [2019-12-27 23:26:50,688 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 2491 transitions. Word has length 44 [2019-12-27 23:26:50,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:50,688 INFO L462 AbstractCegarLoop]: Abstraction has 1090 states and 2491 transitions. [2019-12-27 23:26:50,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:50,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 2491 transitions. [2019-12-27 23:26:50,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:50,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:50,689 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:50,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:50,890 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:50,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:50,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1535681668, now seen corresponding path program 33 times [2019-12-27 23:26:50,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:50,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118539153] [2019-12-27 23:26:50,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:51,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118539153] [2019-12-27 23:26:51,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128852260] [2019-12-27 23:26:51,018 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-12-27 23:26:51,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 23:26:51,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:51,067 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:51,069 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:51,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:51,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:51,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:51,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:51,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:51,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [803217628] [2019-12-27 23:26:51,199 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:51,202 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:51,231 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:51,231 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:51,232 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:26:51,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:51,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:51,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:51,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:51,233 INFO L87 Difference]: Start difference. First operand 1090 states and 2491 transitions. Second operand 11 states. [2019-12-27 23:26:51,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:51,645 INFO L93 Difference]: Finished difference Result 1880 states and 4181 transitions. [2019-12-27 23:26:51,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:26:51,646 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:51,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:51,648 INFO L225 Difference]: With dead ends: 1880 [2019-12-27 23:26:51,648 INFO L226 Difference]: Without dead ends: 1773 [2019-12-27 23:26:51,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:26:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2019-12-27 23:26:51,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1074. [2019-12-27 23:26:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1074 states. [2019-12-27 23:26:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 2451 transitions. [2019-12-27 23:26:51,667 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 2451 transitions. Word has length 44 [2019-12-27 23:26:51,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:51,668 INFO L462 AbstractCegarLoop]: Abstraction has 1074 states and 2451 transitions. [2019-12-27 23:26:51,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 2451 transitions. [2019-12-27 23:26:51,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:51,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:51,670 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:51,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:51,873 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:51,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:51,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1992675506, now seen corresponding path program 34 times [2019-12-27 23:26:51,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:51,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247282018] [2019-12-27 23:26:51,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:52,008 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:52,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247282018] [2019-12-27 23:26:52,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821544703] [2019-12-27 23:26:52,008 INFO L92 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 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 [2019-12-27 23:26:52,055 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:26:52,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:52,056 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:52,057 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:52,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:52,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:52,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:52,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:52,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:52,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1207641934] [2019-12-27 23:26:52,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:52,774 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:52,791 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:52,791 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:52,792 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:26:52,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:52,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:52,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:52,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:52,793 INFO L87 Difference]: Start difference. First operand 1074 states and 2451 transitions. Second operand 11 states. [2019-12-27 23:26:53,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:53,599 INFO L93 Difference]: Finished difference Result 1864 states and 4141 transitions. [2019-12-27 23:26:53,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:26:53,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:53,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:53,602 INFO L225 Difference]: With dead ends: 1864 [2019-12-27 23:26:53,602 INFO L226 Difference]: Without dead ends: 1757 [2019-12-27 23:26:53,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=213, Invalid=656, Unknown=1, NotChecked=0, Total=870 [2019-12-27 23:26:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-12-27 23:26:53,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1090. [2019-12-27 23:26:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-12-27 23:26:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 2491 transitions. [2019-12-27 23:26:53,623 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 2491 transitions. Word has length 44 [2019-12-27 23:26:53,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:53,623 INFO L462 AbstractCegarLoop]: Abstraction has 1090 states and 2491 transitions. [2019-12-27 23:26:53,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:53,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 2491 transitions. [2019-12-27 23:26:53,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:53,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:53,625 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:53,828 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:53,828 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:53,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:53,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1982844476, now seen corresponding path program 35 times [2019-12-27 23:26:53,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:53,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018590244] [2019-12-27 23:26:53,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:54,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018590244] [2019-12-27 23:26:54,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690653924] [2019-12-27 23:26:54,019 INFO L92 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 [2019-12-27 23:26:54,088 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 23:26:54,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:54,089 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:54,091 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:54,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:54,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:54,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:54,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:54,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:54,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1975801813] [2019-12-27 23:26:54,304 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:54,309 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:54,344 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:54,344 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:54,347 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:26:54,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:54,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:54,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:54,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:54,348 INFO L87 Difference]: Start difference. First operand 1090 states and 2491 transitions. Second operand 11 states. [2019-12-27 23:26:54,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:54,755 INFO L93 Difference]: Finished difference Result 1828 states and 4088 transitions. [2019-12-27 23:26:54,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:26:54,755 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:54,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:54,757 INFO L225 Difference]: With dead ends: 1828 [2019-12-27 23:26:54,757 INFO L226 Difference]: Without dead ends: 1721 [2019-12-27 23:26:54,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:26:54,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-12-27 23:26:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1074. [2019-12-27 23:26:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1074 states. [2019-12-27 23:26:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 2451 transitions. [2019-12-27 23:26:54,770 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 2451 transitions. Word has length 44 [2019-12-27 23:26:54,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:54,770 INFO L462 AbstractCegarLoop]: Abstraction has 1074 states and 2451 transitions. [2019-12-27 23:26:54,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:54,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 2451 transitions. [2019-12-27 23:26:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:54,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:54,772 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:54,972 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:54,972 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:54,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:54,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2128688042, now seen corresponding path program 36 times [2019-12-27 23:26:54,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:54,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139902836] [2019-12-27 23:26:54,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:55,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139902836] [2019-12-27 23:26:55,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65984917] [2019-12-27 23:26:55,130 INFO L92 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 [2019-12-27 23:26:55,177 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 23:26:55,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:55,178 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:55,179 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:55,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:55,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:55,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:55,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:55,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:55,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [586614050] [2019-12-27 23:26:55,322 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:55,324 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:55,338 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 158 transitions. [2019-12-27 23:26:55,339 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:55,340 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:26:55,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:55,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:55,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:55,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:55,340 INFO L87 Difference]: Start difference. First operand 1074 states and 2451 transitions. Second operand 11 states. [2019-12-27 23:26:55,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:55,741 INFO L93 Difference]: Finished difference Result 1841 states and 4116 transitions. [2019-12-27 23:26:55,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:26:55,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:55,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:55,744 INFO L225 Difference]: With dead ends: 1841 [2019-12-27 23:26:55,744 INFO L226 Difference]: Without dead ends: 1734 [2019-12-27 23:26:55,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:26:55,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-12-27 23:26:55,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1058. [2019-12-27 23:26:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2019-12-27 23:26:55,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 2411 transitions. [2019-12-27 23:26:55,757 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 2411 transitions. Word has length 44 [2019-12-27 23:26:55,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:55,757 INFO L462 AbstractCegarLoop]: Abstraction has 1058 states and 2411 transitions. [2019-12-27 23:26:55,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 2411 transitions. [2019-12-27 23:26:55,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:55,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:55,758 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:55,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:55,959 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:55,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:55,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1640836464, now seen corresponding path program 37 times [2019-12-27 23:26:55,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:55,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559484838] [2019-12-27 23:26:55,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:56,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559484838] [2019-12-27 23:26:56,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048135769] [2019-12-27 23:26:56,104 INFO L92 rtionOrderModulation]: Changing assertion order to 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 [2019-12-27 23:26:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:56,149 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:56,151 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:56,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:56,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:56,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:56,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:56,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1235418679] [2019-12-27 23:26:56,270 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:56,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:56,284 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 134 transitions. [2019-12-27 23:26:56,284 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:56,285 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:26:56,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:56,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:56,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:56,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:56,286 INFO L87 Difference]: Start difference. First operand 1058 states and 2411 transitions. Second operand 11 states. [2019-12-27 23:26:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:56,691 INFO L93 Difference]: Finished difference Result 1825 states and 4076 transitions. [2019-12-27 23:26:56,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:26:56,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:56,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:56,704 INFO L225 Difference]: With dead ends: 1825 [2019-12-27 23:26:56,704 INFO L226 Difference]: Without dead ends: 1718 [2019-12-27 23:26:56,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=226, Invalid=704, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:26:56,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2019-12-27 23:26:56,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1058. [2019-12-27 23:26:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2019-12-27 23:26:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 2411 transitions. [2019-12-27 23:26:56,724 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 2411 transitions. Word has length 44 [2019-12-27 23:26:56,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:56,724 INFO L462 AbstractCegarLoop]: Abstraction has 1058 states and 2411 transitions. [2019-12-27 23:26:56,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:56,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 2411 transitions. [2019-12-27 23:26:56,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:56,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:56,726 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:56,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:56,929 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:56,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:56,930 INFO L82 PathProgramCache]: Analyzing trace with hash -686131208, now seen corresponding path program 8 times [2019-12-27 23:26:56,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:56,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883416459] [2019-12-27 23:26:56,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:57,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883416459] [2019-12-27 23:26:57,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637337777] [2019-12-27 23:26:57,088 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-12-27 23:26:57,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:26:57,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:57,134 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:57,135 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:57,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:57,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:57,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:57,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:57,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [591410732] [2019-12-27 23:26:57,251 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:57,254 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:57,262 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 86 transitions. [2019-12-27 23:26:57,263 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:57,263 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:26:57,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:57,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:57,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:57,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:57,264 INFO L87 Difference]: Start difference. First operand 1058 states and 2411 transitions. Second operand 11 states. [2019-12-27 23:26:57,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:57,603 INFO L93 Difference]: Finished difference Result 1753 states and 3902 transitions. [2019-12-27 23:26:57,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:57,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:57,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:57,606 INFO L225 Difference]: With dead ends: 1753 [2019-12-27 23:26:57,606 INFO L226 Difference]: Without dead ends: 1646 [2019-12-27 23:26:57,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:26:57,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-12-27 23:26:57,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1003. [2019-12-27 23:26:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2019-12-27 23:26:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 2269 transitions. [2019-12-27 23:26:57,617 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 2269 transitions. Word has length 44 [2019-12-27 23:26:57,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:57,617 INFO L462 AbstractCegarLoop]: Abstraction has 1003 states and 2269 transitions. [2019-12-27 23:26:57,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 2269 transitions. [2019-12-27 23:26:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:57,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:57,618 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:57,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:57,819 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:57,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:57,820 INFO L82 PathProgramCache]: Analyzing trace with hash -592962072, now seen corresponding path program 9 times [2019-12-27 23:26:57,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:57,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044945145] [2019-12-27 23:26:57,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:57,939 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:57,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044945145] [2019-12-27 23:26:57,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136588532] [2019-12-27 23:26:57,940 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-12-27 23:26:57,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 23:26:57,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:57,999 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:58,000 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:58,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:58,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:58,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:58,141 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:58,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:58,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:58,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [124172949] [2019-12-27 23:26:58,141 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:58,143 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:58,166 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 165 states and 284 transitions. [2019-12-27 23:26:58,166 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:58,170 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 23:26:58,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:58,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:58,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:58,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:58,171 INFO L87 Difference]: Start difference. First operand 1003 states and 2269 transitions. Second operand 11 states. [2019-12-27 23:26:58,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:58,523 INFO L93 Difference]: Finished difference Result 1624 states and 3640 transitions. [2019-12-27 23:26:58,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:58,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:58,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:58,525 INFO L225 Difference]: With dead ends: 1624 [2019-12-27 23:26:58,525 INFO L226 Difference]: Without dead ends: 1517 [2019-12-27 23:26:58,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=628, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:26:58,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-12-27 23:26:58,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1005. [2019-12-27 23:26:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2019-12-27 23:26:58,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 2304 transitions. [2019-12-27 23:26:58,537 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 2304 transitions. Word has length 44 [2019-12-27 23:26:58,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:58,537 INFO L462 AbstractCegarLoop]: Abstraction has 1005 states and 2304 transitions. [2019-12-27 23:26:58,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:58,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 2304 transitions. [2019-12-27 23:26:58,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:58,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:58,538 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:26:58,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:58,740 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:58,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:58,740 INFO L82 PathProgramCache]: Analyzing trace with hash -583131042, now seen corresponding path program 10 times [2019-12-27 23:26:58,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:58,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859336576] [2019-12-27 23:26:58,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:26:58,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859336576] [2019-12-27 23:26:58,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195090903] [2019-12-27 23:26:58,883 INFO L92 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 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 [2019-12-27 23:26:58,928 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:26:58,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:58,929 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:58,930 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:00,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:00,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:00,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:00,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:00,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:00,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [888574602] [2019-12-27 23:27:00,321 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:00,325 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:00,347 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 278 transitions. [2019-12-27 23:27:00,347 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:00,351 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 23:27:00,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:00,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:00,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:00,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=238, Unknown=2, NotChecked=0, Total=306 [2019-12-27 23:27:00,352 INFO L87 Difference]: Start difference. First operand 1005 states and 2304 transitions. Second operand 11 states. [2019-12-27 23:27:02,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:02,739 INFO L93 Difference]: Finished difference Result 1729 states and 3855 transitions. [2019-12-27 23:27:02,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:27:02,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:02,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:02,741 INFO L225 Difference]: With dead ends: 1729 [2019-12-27 23:27:02,741 INFO L226 Difference]: Without dead ends: 1622 [2019-12-27 23:27:02,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=188, Invalid=619, Unknown=5, NotChecked=0, Total=812 [2019-12-27 23:27:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2019-12-27 23:27:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1005. [2019-12-27 23:27:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2019-12-27 23:27:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 2304 transitions. [2019-12-27 23:27:02,753 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 2304 transitions. Word has length 44 [2019-12-27 23:27:02,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:02,753 INFO L462 AbstractCegarLoop]: Abstraction has 1005 states and 2304 transitions. [2019-12-27 23:27:02,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:02,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 2304 transitions. [2019-12-27 23:27:02,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:02,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:02,754 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:02,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:02,955 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:02,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:02,955 INFO L82 PathProgramCache]: Analyzing trace with hash 183479080, now seen corresponding path program 38 times [2019-12-27 23:27:02,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:02,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463344390] [2019-12-27 23:27:02,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:03,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463344390] [2019-12-27 23:27:03,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849992422] [2019-12-27 23:27:03,103 INFO L92 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 [2019-12-27 23:27:03,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:27:03,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:03,146 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:03,147 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:05,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:05,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:05,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:05,315 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:05,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:05,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:05,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [200957466] [2019-12-27 23:27:05,315 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:05,317 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:05,337 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 254 transitions. [2019-12-27 23:27:05,338 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:05,340 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 23:27:05,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:05,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:05,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:05,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=237, Unknown=3, NotChecked=0, Total=306 [2019-12-27 23:27:05,341 INFO L87 Difference]: Start difference. First operand 1005 states and 2304 transitions. Second operand 11 states. [2019-12-27 23:27:08,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:08,532 INFO L93 Difference]: Finished difference Result 1834 states and 4070 transitions. [2019-12-27 23:27:08,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:08,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:08,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:08,534 INFO L225 Difference]: With dead ends: 1834 [2019-12-27 23:27:08,534 INFO L226 Difference]: Without dead ends: 1727 [2019-12-27 23:27:08,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=216, Invalid=707, Unknown=7, NotChecked=0, Total=930 [2019-12-27 23:27:08,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2019-12-27 23:27:08,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1033. [2019-12-27 23:27:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2019-12-27 23:27:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 2371 transitions. [2019-12-27 23:27:08,550 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 2371 transitions. Word has length 44 [2019-12-27 23:27:08,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:08,550 INFO L462 AbstractCegarLoop]: Abstraction has 1033 states and 2371 transitions. [2019-12-27 23:27:08,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:08,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 2371 transitions. [2019-12-27 23:27:08,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:08,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:08,551 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:08,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:08,752 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:08,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:08,753 INFO L82 PathProgramCache]: Analyzing trace with hash 193310110, now seen corresponding path program 39 times [2019-12-27 23:27:08,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:08,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970473465] [2019-12-27 23:27:08,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:08,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970473465] [2019-12-27 23:27:08,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118105968] [2019-12-27 23:27:08,883 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-12-27 23:27:08,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:27:08,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:08,929 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:08,929 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:09,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:09,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:09,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:09,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:09,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:09,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1027065794] [2019-12-27 23:27:09,110 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:09,113 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:09,176 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 254 transitions. [2019-12-27 23:27:09,177 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:09,181 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 23:27:09,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:09,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:09,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:09,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:09,182 INFO L87 Difference]: Start difference. First operand 1033 states and 2371 transitions. Second operand 11 states. [2019-12-27 23:27:09,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:09,752 INFO L93 Difference]: Finished difference Result 1810 states and 4030 transitions. [2019-12-27 23:27:09,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:27:09,753 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:09,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:09,755 INFO L225 Difference]: With dead ends: 1810 [2019-12-27 23:27:09,755 INFO L226 Difference]: Without dead ends: 1703 [2019-12-27 23:27:09,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:27:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-12-27 23:27:09,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1029. [2019-12-27 23:27:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-12-27 23:27:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 2358 transitions. [2019-12-27 23:27:09,769 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 2358 transitions. Word has length 44 [2019-12-27 23:27:09,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:09,770 INFO L462 AbstractCegarLoop]: Abstraction has 1029 states and 2358 transitions. [2019-12-27 23:27:09,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 2358 transitions. [2019-12-27 23:27:09,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:09,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:09,771 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:09,971 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:09,972 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:09,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:09,972 INFO L82 PathProgramCache]: Analyzing trace with hash 9875332, now seen corresponding path program 11 times [2019-12-27 23:27:09,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:09,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994787067] [2019-12-27 23:27:09,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:10,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994787067] [2019-12-27 23:27:10,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38819135] [2019-12-27 23:27:10,141 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_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 [2019-12-27 23:27:10,210 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-27 23:27:10,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:10,212 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:10,214 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:12,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:12,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:12,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:12,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:12,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:12,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [161304324] [2019-12-27 23:27:12,326 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:12,328 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:12,346 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 230 transitions. [2019-12-27 23:27:12,346 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:12,349 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 23:27:12,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:12,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:12,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:12,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=236, Unknown=3, NotChecked=0, Total=306 [2019-12-27 23:27:12,350 INFO L87 Difference]: Start difference. First operand 1029 states and 2358 transitions. Second operand 11 states. [2019-12-27 23:27:14,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:14,383 INFO L93 Difference]: Finished difference Result 1810 states and 4030 transitions. [2019-12-27 23:27:14,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:27:14,383 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:14,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:14,386 INFO L225 Difference]: With dead ends: 1810 [2019-12-27 23:27:14,386 INFO L226 Difference]: Without dead ends: 1703 [2019-12-27 23:27:14,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=203, Invalid=661, Unknown=6, NotChecked=0, Total=870 [2019-12-27 23:27:14,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-12-27 23:27:14,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1005. [2019-12-27 23:27:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2019-12-27 23:27:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 2304 transitions. [2019-12-27 23:27:14,399 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 2304 transitions. Word has length 44 [2019-12-27 23:27:14,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:14,400 INFO L462 AbstractCegarLoop]: Abstraction has 1005 states and 2304 transitions. [2019-12-27 23:27:14,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:14,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 2304 transitions. [2019-12-27 23:27:14,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:14,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:14,401 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:14,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:14,602 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:14,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:14,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1441205032, now seen corresponding path program 40 times [2019-12-27 23:27:14,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:14,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27547915] [2019-12-27 23:27:14,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:14,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:14,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27547915] [2019-12-27 23:27:14,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558439740] [2019-12-27 23:27:14,785 INFO L92 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 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 [2019-12-27 23:27:14,855 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:27:14,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:14,856 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:14,858 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:15,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:15,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:15,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:15,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:15,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:15,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [875788409] [2019-12-27 23:27:15,243 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:15,247 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:15,275 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 230 transitions. [2019-12-27 23:27:15,276 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:15,279 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 23:27:15,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:15,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:15,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:15,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:15,280 INFO L87 Difference]: Start difference. First operand 1005 states and 2304 transitions. Second operand 11 states. [2019-12-27 23:27:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:15,866 INFO L93 Difference]: Finished difference Result 1902 states and 4210 transitions. [2019-12-27 23:27:15,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:27:15,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:15,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:15,868 INFO L225 Difference]: With dead ends: 1902 [2019-12-27 23:27:15,868 INFO L226 Difference]: Without dead ends: 1795 [2019-12-27 23:27:15,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:27:15,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2019-12-27 23:27:15,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1049. [2019-12-27 23:27:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2019-12-27 23:27:15,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 2411 transitions. [2019-12-27 23:27:15,882 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 2411 transitions. Word has length 44 [2019-12-27 23:27:15,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:15,882 INFO L462 AbstractCegarLoop]: Abstraction has 1049 states and 2411 transitions. [2019-12-27 23:27:15,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:15,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 2411 transitions. [2019-12-27 23:27:15,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:15,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:15,883 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:16,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:16,084 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:16,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:16,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1451036062, now seen corresponding path program 41 times [2019-12-27 23:27:16,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:16,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889156968] [2019-12-27 23:27:16,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:16,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889156968] [2019-12-27 23:27:16,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378781654] [2019-12-27 23:27:16,207 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2019-12-27 23:27:16,250 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 23:27:16,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:16,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:16,252 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:16,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:16,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:16,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:16,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:16,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:16,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1541335807] [2019-12-27 23:27:16,481 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:16,483 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:16,502 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 230 transitions. [2019-12-27 23:27:16,502 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:16,504 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 23:27:16,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:16,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:16,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:16,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:16,505 INFO L87 Difference]: Start difference. First operand 1049 states and 2411 transitions. Second operand 11 states. [2019-12-27 23:27:16,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:16,999 INFO L93 Difference]: Finished difference Result 1915 states and 4245 transitions. [2019-12-27 23:27:16,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:16,999 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:16,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:17,001 INFO L225 Difference]: With dead ends: 1915 [2019-12-27 23:27:17,001 INFO L226 Difference]: Without dead ends: 1808 [2019-12-27 23:27:17,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:27:17,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2019-12-27 23:27:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1045. [2019-12-27 23:27:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1045 states. [2019-12-27 23:27:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 2398 transitions. [2019-12-27 23:27:17,014 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 2398 transitions. Word has length 44 [2019-12-27 23:27:17,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:17,015 INFO L462 AbstractCegarLoop]: Abstraction has 1045 states and 2398 transitions. [2019-12-27 23:27:17,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 2398 transitions. [2019-12-27 23:27:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:17,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:17,016 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:17,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:17,216 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:17,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:17,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2077321112, now seen corresponding path program 42 times [2019-12-27 23:27:17,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:17,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942341607] [2019-12-27 23:27:17,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:17,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942341607] [2019-12-27 23:27:17,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772568292] [2019-12-27 23:27:17,347 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2019-12-27 23:27:17,392 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 23:27:17,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:17,393 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:17,395 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:17,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:17,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:17,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:17,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:17,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:17,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:17,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [389133808] [2019-12-27 23:27:17,589 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:17,591 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:17,610 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 230 transitions. [2019-12-27 23:27:17,611 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:17,613 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 23:27:17,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:17,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:17,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:17,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:17,613 INFO L87 Difference]: Start difference. First operand 1045 states and 2398 transitions. Second operand 11 states. [2019-12-27 23:27:18,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:18,085 INFO L93 Difference]: Finished difference Result 1923 states and 4259 transitions. [2019-12-27 23:27:18,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:18,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:18,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:18,087 INFO L225 Difference]: With dead ends: 1923 [2019-12-27 23:27:18,088 INFO L226 Difference]: Without dead ends: 1816 [2019-12-27 23:27:18,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:27:18,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2019-12-27 23:27:18,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1061. [2019-12-27 23:27:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2019-12-27 23:27:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 2438 transitions. [2019-12-27 23:27:18,100 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 2438 transitions. Word has length 44 [2019-12-27 23:27:18,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:18,100 INFO L462 AbstractCegarLoop]: Abstraction has 1061 states and 2438 transitions. [2019-12-27 23:27:18,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 2438 transitions. [2019-12-27 23:27:18,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:18,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:18,101 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:18,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:18,302 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:18,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:18,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2067490082, now seen corresponding path program 43 times [2019-12-27 23:27:18,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:18,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076420562] [2019-12-27 23:27:18,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:18,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076420562] [2019-12-27 23:27:18,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590918569] [2019-12-27 23:27:18,450 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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 [2019-12-27 23:27:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:18,492 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:18,497 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:18,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:18,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:18,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:18,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:18,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:18,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [103382966] [2019-12-27 23:27:18,658 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:18,661 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:18,680 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 230 transitions. [2019-12-27 23:27:18,680 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:18,682 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 23:27:18,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:18,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:18,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:18,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:18,683 INFO L87 Difference]: Start difference. First operand 1061 states and 2438 transitions. Second operand 11 states. [2019-12-27 23:27:19,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:19,122 INFO L93 Difference]: Finished difference Result 1863 states and 4152 transitions. [2019-12-27 23:27:19,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:19,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:19,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:19,124 INFO L225 Difference]: With dead ends: 1863 [2019-12-27 23:27:19,124 INFO L226 Difference]: Without dead ends: 1756 [2019-12-27 23:27:19,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:27:19,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-12-27 23:27:19,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1045. [2019-12-27 23:27:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1045 states. [2019-12-27 23:27:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 2398 transitions. [2019-12-27 23:27:19,136 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 2398 transitions. Word has length 44 [2019-12-27 23:27:19,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:19,136 INFO L462 AbstractCegarLoop]: Abstraction has 1045 states and 2398 transitions. [2019-12-27 23:27:19,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:19,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 2398 transitions. [2019-12-27 23:27:19,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:19,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:19,137 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:19,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:19,338 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:19,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:19,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2044042436, now seen corresponding path program 44 times [2019-12-27 23:27:19,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:19,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952082705] [2019-12-27 23:27:19,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:19,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952082705] [2019-12-27 23:27:19,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914227847] [2019-12-27 23:27:19,467 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-12-27 23:27:19,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:27:19,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:19,511 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:19,512 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:19,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:19,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:19,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:19,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:19,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:19,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1680206078] [2019-12-27 23:27:19,700 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:19,702 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:19,719 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 206 transitions. [2019-12-27 23:27:19,719 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:19,722 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 23:27:19,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:19,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:19,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:19,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:19,722 INFO L87 Difference]: Start difference. First operand 1045 states and 2398 transitions. Second operand 11 states. [2019-12-27 23:27:20,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:20,175 INFO L93 Difference]: Finished difference Result 1863 states and 4152 transitions. [2019-12-27 23:27:20,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:20,175 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:20,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:20,177 INFO L225 Difference]: With dead ends: 1863 [2019-12-27 23:27:20,177 INFO L226 Difference]: Without dead ends: 1756 [2019-12-27 23:27:20,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:27:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-12-27 23:27:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1041. [2019-12-27 23:27:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2019-12-27 23:27:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 2385 transitions. [2019-12-27 23:27:20,190 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 2385 transitions. Word has length 44 [2019-12-27 23:27:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:20,190 INFO L462 AbstractCegarLoop]: Abstraction has 1041 states and 2385 transitions. [2019-12-27 23:27:20,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 2385 transitions. [2019-12-27 23:27:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:20,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:20,191 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:20,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:20,392 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:20,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:20,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1725482070, now seen corresponding path program 12 times [2019-12-27 23:27:20,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:20,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712553518] [2019-12-27 23:27:20,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:20,541 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:20,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712553518] [2019-12-27 23:27:20,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624408516] [2019-12-27 23:27:20,541 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2019-12-27 23:27:20,589 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-27 23:27:20,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:20,590 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:20,591 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:20,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:20,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:20,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:20,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:20,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:20,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [459683509] [2019-12-27 23:27:20,827 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:20,829 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:20,844 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:27:20,844 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:20,846 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:27:20,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:20,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:20,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:20,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:20,846 INFO L87 Difference]: Start difference. First operand 1041 states and 2385 transitions. Second operand 11 states. [2019-12-27 23:27:21,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:21,276 INFO L93 Difference]: Finished difference Result 1863 states and 4145 transitions. [2019-12-27 23:27:21,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:21,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:21,278 INFO L225 Difference]: With dead ends: 1863 [2019-12-27 23:27:21,278 INFO L226 Difference]: Without dead ends: 1756 [2019-12-27 23:27:21,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:27:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-12-27 23:27:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1005. [2019-12-27 23:27:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2019-12-27 23:27:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 2304 transitions. [2019-12-27 23:27:21,292 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 2304 transitions. Word has length 44 [2019-12-27 23:27:21,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:21,292 INFO L462 AbstractCegarLoop]: Abstraction has 1005 states and 2304 transitions. [2019-12-27 23:27:21,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:21,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 2304 transitions. [2019-12-27 23:27:21,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:21,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:21,293 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:21,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:21,494 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:21,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:21,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1775342808, now seen corresponding path program 45 times [2019-12-27 23:27:21,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:21,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503548619] [2019-12-27 23:27:21,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:21,618 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:21,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503548619] [2019-12-27 23:27:21,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611567875] [2019-12-27 23:27:21,619 INFO L92 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 [2019-12-27 23:27:21,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:27:21,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:21,664 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:21,665 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:21,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:21,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:21,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:21,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:21,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:21,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [241121852] [2019-12-27 23:27:21,792 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:21,794 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:21,813 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 206 transitions. [2019-12-27 23:27:21,813 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:21,815 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 23:27:21,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:21,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:21,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:21,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:21,815 INFO L87 Difference]: Start difference. First operand 1005 states and 2304 transitions. Second operand 11 states. [2019-12-27 23:27:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:22,257 INFO L93 Difference]: Finished difference Result 1890 states and 4190 transitions. [2019-12-27 23:27:22,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:22,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:22,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:22,259 INFO L225 Difference]: With dead ends: 1890 [2019-12-27 23:27:22,260 INFO L226 Difference]: Without dead ends: 1783 [2019-12-27 23:27:22,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=223, Invalid=707, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:27:22,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2019-12-27 23:27:22,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1065. [2019-12-27 23:27:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-12-27 23:27:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 2451 transitions. [2019-12-27 23:27:22,274 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 2451 transitions. Word has length 44 [2019-12-27 23:27:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:22,274 INFO L462 AbstractCegarLoop]: Abstraction has 1065 states and 2451 transitions. [2019-12-27 23:27:22,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:22,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 2451 transitions. [2019-12-27 23:27:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:22,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:22,275 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:22,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:22,476 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:22,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:22,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1765511778, now seen corresponding path program 46 times [2019-12-27 23:27:22,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:22,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706957430] [2019-12-27 23:27:22,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:22,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706957430] [2019-12-27 23:27:22,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101756049] [2019-12-27 23:27:22,618 INFO L92 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 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 [2019-12-27 23:27:22,660 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:27:22,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:22,661 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:22,662 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:23,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:23,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:23,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:23,360 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:23,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:23,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:23,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2108984206] [2019-12-27 23:27:23,360 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:23,363 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:23,380 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 206 transitions. [2019-12-27 23:27:23,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:23,382 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 23:27:23,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:23,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:23,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:23,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=238, Unknown=1, NotChecked=0, Total=306 [2019-12-27 23:27:23,383 INFO L87 Difference]: Start difference. First operand 1065 states and 2451 transitions. Second operand 11 states. [2019-12-27 23:27:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:25,325 INFO L93 Difference]: Finished difference Result 1906 states and 4230 transitions. [2019-12-27 23:27:25,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:27:25,325 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:25,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:25,327 INFO L225 Difference]: With dead ends: 1906 [2019-12-27 23:27:25,327 INFO L226 Difference]: Without dead ends: 1799 [2019-12-27 23:27:25,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=238, Invalid=752, Unknown=2, NotChecked=0, Total=992 [2019-12-27 23:27:25,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2019-12-27 23:27:25,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1061. [2019-12-27 23:27:25,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2019-12-27 23:27:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 2438 transitions. [2019-12-27 23:27:25,342 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 2438 transitions. Word has length 44 [2019-12-27 23:27:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:25,342 INFO L462 AbstractCegarLoop]: Abstraction has 1061 states and 2438 transitions. [2019-12-27 23:27:25,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 2438 transitions. [2019-12-27 23:27:25,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:25,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:25,343 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:25,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:25,544 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:25,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:25,545 INFO L82 PathProgramCache]: Analyzing trace with hash -998901656, now seen corresponding path program 47 times [2019-12-27 23:27:25,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:25,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21035471] [2019-12-27 23:27:25,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:25,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21035471] [2019-12-27 23:27:25,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764819403] [2019-12-27 23:27:25,709 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2019-12-27 23:27:25,774 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 23:27:25,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:25,775 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:25,776 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:25,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:25,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:25,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:25,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:25,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:25,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1746344756] [2019-12-27 23:27:25,956 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:25,960 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:25,987 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 206 transitions. [2019-12-27 23:27:25,988 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:25,990 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 23:27:25,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:25,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:25,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:25,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:25,991 INFO L87 Difference]: Start difference. First operand 1061 states and 2438 transitions. Second operand 11 states. [2019-12-27 23:27:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:26,460 INFO L93 Difference]: Finished difference Result 1911 states and 4239 transitions. [2019-12-27 23:27:26,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:26,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:26,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:26,462 INFO L225 Difference]: With dead ends: 1911 [2019-12-27 23:27:26,463 INFO L226 Difference]: Without dead ends: 1804 [2019-12-27 23:27:26,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=709, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:27:26,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2019-12-27 23:27:26,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1077. [2019-12-27 23:27:26,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1077 states. [2019-12-27 23:27:26,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 2478 transitions. [2019-12-27 23:27:26,479 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 2478 transitions. Word has length 44 [2019-12-27 23:27:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:26,479 INFO L462 AbstractCegarLoop]: Abstraction has 1077 states and 2478 transitions. [2019-12-27 23:27:26,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 2478 transitions. [2019-12-27 23:27:26,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:26,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:26,480 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:26,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:26,681 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:26,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:26,682 INFO L82 PathProgramCache]: Analyzing trace with hash -989070626, now seen corresponding path program 48 times [2019-12-27 23:27:26,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:26,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221408564] [2019-12-27 23:27:26,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:26,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221408564] [2019-12-27 23:27:26,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952885593] [2019-12-27 23:27:26,801 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2019-12-27 23:27:26,845 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 23:27:26,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:26,846 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:26,847 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:26,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:26,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:26,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:26,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:26,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:26,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1309458090] [2019-12-27 23:27:26,965 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:26,967 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:26,985 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 206 transitions. [2019-12-27 23:27:26,985 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:26,987 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 23:27:26,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:26,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:26,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:26,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:26,987 INFO L87 Difference]: Start difference. First operand 1077 states and 2478 transitions. Second operand 11 states. [2019-12-27 23:27:27,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:27,432 INFO L93 Difference]: Finished difference Result 1971 states and 4372 transitions. [2019-12-27 23:27:27,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:27,433 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:27,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:27,434 INFO L225 Difference]: With dead ends: 1971 [2019-12-27 23:27:27,434 INFO L226 Difference]: Without dead ends: 1864 [2019-12-27 23:27:27,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:27:27,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2019-12-27 23:27:27,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1061. [2019-12-27 23:27:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2019-12-27 23:27:27,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 2438 transitions. [2019-12-27 23:27:27,447 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 2438 transitions. Word has length 44 [2019-12-27 23:27:27,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:27,447 INFO L462 AbstractCegarLoop]: Abstraction has 1061 states and 2438 transitions. [2019-12-27 23:27:27,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 2438 transitions. [2019-12-27 23:27:27,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:27,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:27,448 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:27,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:27,649 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:27,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:27,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1172505404, now seen corresponding path program 49 times [2019-12-27 23:27:27,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:27,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979067237] [2019-12-27 23:27:27,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:27,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979067237] [2019-12-27 23:27:27,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53236231] [2019-12-27 23:27:27,788 INFO L92 rtionOrderModulation]: Changing assertion order to 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 [2019-12-27 23:27:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:27,834 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:27,834 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:27,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:27,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:27,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:27,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1002650497] [2019-12-27 23:27:27,959 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:27,962 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:27,977 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:27:27,977 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:27,979 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:27:27,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:27,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:27,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:27,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:27,979 INFO L87 Difference]: Start difference. First operand 1061 states and 2438 transitions. Second operand 11 states. [2019-12-27 23:27:28,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:28,549 INFO L93 Difference]: Finished difference Result 1919 states and 4272 transitions. [2019-12-27 23:27:28,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:28,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:28,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:28,553 INFO L225 Difference]: With dead ends: 1919 [2019-12-27 23:27:28,553 INFO L226 Difference]: Without dead ends: 1812 [2019-12-27 23:27:28,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:27:28,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2019-12-27 23:27:28,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1057. [2019-12-27 23:27:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2019-12-27 23:27:28,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 2425 transitions. [2019-12-27 23:27:28,580 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 2425 transitions. Word has length 44 [2019-12-27 23:27:28,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:28,581 INFO L462 AbstractCegarLoop]: Abstraction has 1057 states and 2425 transitions. [2019-12-27 23:27:28,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 2425 transitions. [2019-12-27 23:27:28,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:28,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:28,583 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:28,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:28,787 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:28,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:28,788 INFO L82 PathProgramCache]: Analyzing trace with hash 258824296, now seen corresponding path program 50 times [2019-12-27 23:27:28,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:28,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020497753] [2019-12-27 23:27:28,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:28,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020497753] [2019-12-27 23:27:28,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535487511] [2019-12-27 23:27:28,946 INFO L92 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 [2019-12-27 23:27:28,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:27:28,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:28,994 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:28,995 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:29,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:29,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:29,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:29,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:29,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:29,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:29,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [102766148] [2019-12-27 23:27:29,560 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:29,563 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:29,589 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 206 transitions. [2019-12-27 23:27:29,589 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:29,591 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 23:27:29,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:29,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:29,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:29,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:29,592 INFO L87 Difference]: Start difference. First operand 1057 states and 2425 transitions. Second operand 11 states. [2019-12-27 23:27:30,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:30,105 INFO L93 Difference]: Finished difference Result 1930 states and 4284 transitions. [2019-12-27 23:27:30,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:30,105 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:30,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:30,107 INFO L225 Difference]: With dead ends: 1930 [2019-12-27 23:27:30,107 INFO L226 Difference]: Without dead ends: 1823 [2019-12-27 23:27:30,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:27:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2019-12-27 23:27:30,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1089. [2019-12-27 23:27:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2019-12-27 23:27:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 2505 transitions. [2019-12-27 23:27:30,121 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 2505 transitions. Word has length 44 [2019-12-27 23:27:30,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:30,121 INFO L462 AbstractCegarLoop]: Abstraction has 1089 states and 2505 transitions. [2019-12-27 23:27:30,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 2505 transitions. [2019-12-27 23:27:30,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:30,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:30,122 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:30,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 78 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:30,323 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:30,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:30,324 INFO L82 PathProgramCache]: Analyzing trace with hash 268655326, now seen corresponding path program 51 times [2019-12-27 23:27:30,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:30,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178856149] [2019-12-27 23:27:30,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:30,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178856149] [2019-12-27 23:27:30,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447819223] [2019-12-27 23:27:30,459 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-12-27 23:27:30,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:27:30,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:30,521 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 23:27:30,522 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:30,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:30,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:30,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:30,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:30,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-12-27 23:27:30,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [3554011] [2019-12-27 23:27:30,663 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:30,666 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:30,684 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 206 transitions. [2019-12-27 23:27:30,684 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:30,686 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 23:27:30,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:30,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:30,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:30,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:27:30,687 INFO L87 Difference]: Start difference. First operand 1089 states and 2505 transitions. Second operand 11 states. [2019-12-27 23:27:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:31,123 INFO L93 Difference]: Finished difference Result 1983 states and 4399 transitions. [2019-12-27 23:27:31,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:31,124 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:31,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:31,126 INFO L225 Difference]: With dead ends: 1983 [2019-12-27 23:27:31,126 INFO L226 Difference]: Without dead ends: 1876 [2019-12-27 23:27:31,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:27:31,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2019-12-27 23:27:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1073. [2019-12-27 23:27:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2019-12-27 23:27:31,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 2465 transitions. [2019-12-27 23:27:31,139 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 2465 transitions. Word has length 44 [2019-12-27 23:27:31,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:31,139 INFO L462 AbstractCegarLoop]: Abstraction has 1073 states and 2465 transitions. [2019-12-27 23:27:31,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:31,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 2465 transitions. [2019-12-27 23:27:31,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:31,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:31,140 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:31,341 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 79 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:31,341 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:31,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:31,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1035265448, now seen corresponding path program 52 times [2019-12-27 23:27:31,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:31,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772934501] [2019-12-27 23:27:31,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:31,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772934501] [2019-12-27 23:27:31,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332982350] [2019-12-27 23:27:31,461 INFO L92 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:31,506 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:27:31,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:31,507 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:31,508 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:31,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:31,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:31,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:31,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:31,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:31,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:31,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [506977136] [2019-12-27 23:27:31,899 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:31,901 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:31,919 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 206 transitions. [2019-12-27 23:27:31,919 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:31,921 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 23:27:31,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:31,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:31,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:31,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:31,922 INFO L87 Difference]: Start difference. First operand 1073 states and 2465 transitions. Second operand 11 states. [2019-12-27 23:27:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:33,520 INFO L93 Difference]: Finished difference Result 1883 states and 4186 transitions. [2019-12-27 23:27:33,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:33,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:33,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:33,523 INFO L225 Difference]: With dead ends: 1883 [2019-12-27 23:27:33,523 INFO L226 Difference]: Without dead ends: 1776 [2019-12-27 23:27:33,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=215, Invalid=713, Unknown=2, NotChecked=0, Total=930 [2019-12-27 23:27:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2019-12-27 23:27:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1089. [2019-12-27 23:27:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2019-12-27 23:27:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 2505 transitions. [2019-12-27 23:27:33,536 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 2505 transitions. Word has length 44 [2019-12-27 23:27:33,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:33,536 INFO L462 AbstractCegarLoop]: Abstraction has 1089 states and 2505 transitions. [2019-12-27 23:27:33,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 2505 transitions. [2019-12-27 23:27:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:33,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:33,537 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:33,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:33,738 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:33,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:33,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1045096478, now seen corresponding path program 53 times [2019-12-27 23:27:33,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:33,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436609384] [2019-12-27 23:27:33,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:33,858 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:33,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436609384] [2019-12-27 23:27:33,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16400104] [2019-12-27 23:27:33,858 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:33,905 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-27 23:27:33,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:33,907 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:33,907 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:34,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:34,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:34,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:34,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:34,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:34,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1644320031] [2019-12-27 23:27:34,069 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:34,072 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:34,137 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 206 transitions. [2019-12-27 23:27:34,138 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:34,140 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 23:27:34,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:34,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:34,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:34,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:34,141 INFO L87 Difference]: Start difference. First operand 1089 states and 2505 transitions. Second operand 11 states. [2019-12-27 23:27:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:34,536 INFO L93 Difference]: Finished difference Result 1796 states and 4034 transitions. [2019-12-27 23:27:34,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:34,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:34,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:34,538 INFO L225 Difference]: With dead ends: 1796 [2019-12-27 23:27:34,538 INFO L226 Difference]: Without dead ends: 1689 [2019-12-27 23:27:34,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:27:34,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2019-12-27 23:27:34,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1091. [2019-12-27 23:27:34,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1091 states. [2019-12-27 23:27:34,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 2495 transitions. [2019-12-27 23:27:34,551 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 2495 transitions. Word has length 44 [2019-12-27 23:27:34,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:34,551 INFO L462 AbstractCegarLoop]: Abstraction has 1091 states and 2495 transitions. [2019-12-27 23:27:34,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:34,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 2495 transitions. [2019-12-27 23:27:34,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:34,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:34,553 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:34,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:34,754 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:34,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:34,754 INFO L82 PathProgramCache]: Analyzing trace with hash 861661700, now seen corresponding path program 54 times [2019-12-27 23:27:34,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:34,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046855493] [2019-12-27 23:27:34,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:34,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046855493] [2019-12-27 23:27:34,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978987148] [2019-12-27 23:27:34,903 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:34,951 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-27 23:27:34,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:34,951 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:34,952 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:35,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:35,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:35,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:35,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:35,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:35,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1874646399] [2019-12-27 23:27:35,084 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:35,086 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:35,102 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:27:35,103 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:35,104 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:27:35,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:35,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:35,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:35,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:35,105 INFO L87 Difference]: Start difference. First operand 1091 states and 2495 transitions. Second operand 11 states. [2019-12-27 23:27:35,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:35,514 INFO L93 Difference]: Finished difference Result 1891 states and 4219 transitions. [2019-12-27 23:27:35,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:35,514 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:35,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:35,516 INFO L225 Difference]: With dead ends: 1891 [2019-12-27 23:27:35,516 INFO L226 Difference]: Without dead ends: 1784 [2019-12-27 23:27:35,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:27:35,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2019-12-27 23:27:35,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1075. [2019-12-27 23:27:35,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-12-27 23:27:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 2455 transitions. [2019-12-27 23:27:35,529 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 2455 transitions. Word has length 44 [2019-12-27 23:27:35,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:35,530 INFO L462 AbstractCegarLoop]: Abstraction has 1075 states and 2455 transitions. [2019-12-27 23:27:35,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 2455 transitions. [2019-12-27 23:27:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:35,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:35,531 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:35,731 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:35,732 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:35,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:35,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1387104490, now seen corresponding path program 55 times [2019-12-27 23:27:35,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:35,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619028280] [2019-12-27 23:27:35,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:35,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619028280] [2019-12-27 23:27:35,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285805607] [2019-12-27 23:27:35,886 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:35,931 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:35,931 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:36,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:36,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:36,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:36,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:36,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:36,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1418413151] [2019-12-27 23:27:36,068 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:36,071 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:36,084 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 158 transitions. [2019-12-27 23:27:36,084 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:36,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:27:36,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:36,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:36,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:36,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:36,086 INFO L87 Difference]: Start difference. First operand 1075 states and 2455 transitions. Second operand 11 states. [2019-12-27 23:27:36,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:36,556 INFO L93 Difference]: Finished difference Result 1919 states and 4272 transitions. [2019-12-27 23:27:36,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:27:36,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:36,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:36,558 INFO L225 Difference]: With dead ends: 1919 [2019-12-27 23:27:36,558 INFO L226 Difference]: Without dead ends: 1812 [2019-12-27 23:27:36,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:27:36,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2019-12-27 23:27:36,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1071. [2019-12-27 23:27:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071 states. [2019-12-27 23:27:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 2442 transitions. [2019-12-27 23:27:36,573 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 2442 transitions. Word has length 44 [2019-12-27 23:27:36,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:36,574 INFO L462 AbstractCegarLoop]: Abstraction has 1071 states and 2442 transitions. [2019-12-27 23:27:36,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:36,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 2442 transitions. [2019-12-27 23:27:36,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:36,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:36,575 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:36,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:36,776 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:36,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:36,777 INFO L82 PathProgramCache]: Analyzing trace with hash 547964112, now seen corresponding path program 13 times [2019-12-27 23:27:36,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:36,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328301352] [2019-12-27 23:27:36,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:36,923 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:36,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328301352] [2019-12-27 23:27:36,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039679442] [2019-12-27 23:27:36,924 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:36,967 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:36,967 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:37,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:37,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:37,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:37,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:37,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [776291720] [2019-12-27 23:27:37,096 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:37,098 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:37,109 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 134 transitions. [2019-12-27 23:27:37,109 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:37,110 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:27:37,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:37,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:37,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:37,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:37,111 INFO L87 Difference]: Start difference. First operand 1071 states and 2442 transitions. Second operand 11 states. [2019-12-27 23:27:37,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:37,533 INFO L93 Difference]: Finished difference Result 1878 states and 4170 transitions. [2019-12-27 23:27:37,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 23:27:37,533 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:37,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:37,535 INFO L225 Difference]: With dead ends: 1878 [2019-12-27 23:27:37,536 INFO L226 Difference]: Without dead ends: 1771 [2019-12-27 23:27:37,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=809, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:27:37,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2019-12-27 23:27:37,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1023. [2019-12-27 23:27:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2019-12-27 23:27:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 2334 transitions. [2019-12-27 23:27:37,548 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 2334 transitions. Word has length 44 [2019-12-27 23:27:37,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:37,548 INFO L462 AbstractCegarLoop]: Abstraction has 1023 states and 2334 transitions. [2019-12-27 23:27:37,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:37,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 2334 transitions. [2019-12-27 23:27:37,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:37,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:37,550 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:37,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 84 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:37,750 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:37,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:37,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1786014847, now seen corresponding path program 3 times [2019-12-27 23:27:37,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:37,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504665185] [2019-12-27 23:27:37,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:37,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504665185] [2019-12-27 23:27:37,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742847521] [2019-12-27 23:27:37,904 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:37,953 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-27 23:27:37,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:37,954 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:37,955 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:38,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:38,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:38,147 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:38,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:38,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:38,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1109820824] [2019-12-27 23:27:38,149 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:38,155 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:38,178 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 117 states and 188 transitions. [2019-12-27 23:27:38,178 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:38,182 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 23:27:38,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:38,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:38,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:38,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:38,183 INFO L87 Difference]: Start difference. First operand 1023 states and 2334 transitions. Second operand 11 states. [2019-12-27 23:27:38,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:38,564 INFO L93 Difference]: Finished difference Result 1746 states and 3884 transitions. [2019-12-27 23:27:38,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:27:38,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:38,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:38,566 INFO L225 Difference]: With dead ends: 1746 [2019-12-27 23:27:38,566 INFO L226 Difference]: Without dead ends: 1618 [2019-12-27 23:27:38,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=628, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:27:38,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2019-12-27 23:27:38,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1069. [2019-12-27 23:27:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-12-27 23:27:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 2397 transitions. [2019-12-27 23:27:38,578 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 2397 transitions. Word has length 44 [2019-12-27 23:27:38,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:38,578 INFO L462 AbstractCegarLoop]: Abstraction has 1069 states and 2397 transitions. [2019-12-27 23:27:38,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:38,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 2397 transitions. [2019-12-27 23:27:38,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:38,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:38,580 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:38,782 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:38,782 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:38,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:38,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1636863042, now seen corresponding path program 6 times [2019-12-27 23:27:38,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:38,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456356031] [2019-12-27 23:27:38,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:38,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456356031] [2019-12-27 23:27:38,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772681092] [2019-12-27 23:27:38,958 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:39,009 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-12-27 23:27:39,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:39,009 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:39,010 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:39,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:39,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:39,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:39,174 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:39,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:39,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:39,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1309230071] [2019-12-27 23:27:39,175 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:39,178 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:39,187 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-27 23:27:39,187 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:39,188 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:27:39,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:39,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:39,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:39,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:27:39,188 INFO L87 Difference]: Start difference. First operand 1069 states and 2397 transitions. Second operand 12 states. [2019-12-27 23:27:39,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:39,465 INFO L93 Difference]: Finished difference Result 1479 states and 3350 transitions. [2019-12-27 23:27:39,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:27:39,466 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:39,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:39,467 INFO L225 Difference]: With dead ends: 1479 [2019-12-27 23:27:39,467 INFO L226 Difference]: Without dead ends: 1323 [2019-12-27 23:27:39,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=608, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:27:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2019-12-27 23:27:39,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1114. [2019-12-27 23:27:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2019-12-27 23:27:39,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 2513 transitions. [2019-12-27 23:27:39,478 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 2513 transitions. Word has length 48 [2019-12-27 23:27:39,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:39,479 INFO L462 AbstractCegarLoop]: Abstraction has 1114 states and 2513 transitions. [2019-12-27 23:27:39,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:39,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 2513 transitions. [2019-12-27 23:27:39,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:39,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:39,480 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:39,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:39,680 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:39,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:39,681 INFO L82 PathProgramCache]: Analyzing trace with hash -2015129797, now seen corresponding path program 9 times [2019-12-27 23:27:39,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:39,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352685869] [2019-12-27 23:27:39,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:39,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352685869] [2019-12-27 23:27:39,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163141364] [2019-12-27 23:27:39,813 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:39,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-27 23:27:39,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:39,863 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 23:27:39,864 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:40,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:40,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:40,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:40,024 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:40,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:40,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-12-27 23:27:40,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [204594410] [2019-12-27 23:27:40,025 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:40,027 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:40,049 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:27:40,050 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:40,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:27:40,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:40,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:40,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:40,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:27:40,051 INFO L87 Difference]: Start difference. First operand 1114 states and 2513 transitions. Second operand 12 states. [2019-12-27 23:27:40,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:40,391 INFO L93 Difference]: Finished difference Result 1670 states and 3732 transitions. [2019-12-27 23:27:40,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:27:40,391 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:40,393 INFO L225 Difference]: With dead ends: 1670 [2019-12-27 23:27:40,393 INFO L226 Difference]: Without dead ends: 1563 [2019-12-27 23:27:40,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=632, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:27:40,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-12-27 23:27:40,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1110. [2019-12-27 23:27:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2019-12-27 23:27:40,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 2500 transitions. [2019-12-27 23:27:40,404 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 2500 transitions. Word has length 48 [2019-12-27 23:27:40,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:40,404 INFO L462 AbstractCegarLoop]: Abstraction has 1110 states and 2500 transitions. [2019-12-27 23:27:40,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:40,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 2500 transitions. [2019-12-27 23:27:40,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:40,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:40,406 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:40,609 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 87 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:40,610 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:40,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:40,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1083907011, now seen corresponding path program 10 times [2019-12-27 23:27:40,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:40,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902548304] [2019-12-27 23:27:40,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:40,752 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:40,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902548304] [2019-12-27 23:27:40,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403722637] [2019-12-27 23:27:40,753 INFO L92 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:40,796 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:27:40,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:40,797 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:40,798 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:42,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:42,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:42,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:42,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:42,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:42,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [152034574] [2019-12-27 23:27:42,485 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:42,488 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:42,510 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:27:42,510 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:42,511 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:27:42,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:42,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:42,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:42,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=296, Unknown=3, NotChecked=0, Total=380 [2019-12-27 23:27:42,511 INFO L87 Difference]: Start difference. First operand 1110 states and 2500 transitions. Second operand 12 states. [2019-12-27 23:27:43,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:43,570 INFO L93 Difference]: Finished difference Result 1830 states and 4052 transitions. [2019-12-27 23:27:43,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:27:43,570 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:43,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:43,572 INFO L225 Difference]: With dead ends: 1830 [2019-12-27 23:27:43,572 INFO L226 Difference]: Without dead ends: 1723 [2019-12-27 23:27:43,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=224, Invalid=642, Unknown=4, NotChecked=0, Total=870 [2019-12-27 23:27:43,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2019-12-27 23:27:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1106. [2019-12-27 23:27:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2019-12-27 23:27:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 2487 transitions. [2019-12-27 23:27:43,586 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 2487 transitions. Word has length 48 [2019-12-27 23:27:43,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:43,586 INFO L462 AbstractCegarLoop]: Abstraction has 1106 states and 2487 transitions. [2019-12-27 23:27:43,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 2487 transitions. [2019-12-27 23:27:43,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:43,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:43,587 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:43,788 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 88 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:43,788 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:43,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:43,789 INFO L82 PathProgramCache]: Analyzing trace with hash -52372515, now seen corresponding path program 56 times [2019-12-27 23:27:43,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:43,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419939899] [2019-12-27 23:27:43,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:43,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419939899] [2019-12-27 23:27:43,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417424834] [2019-12-27 23:27:43,934 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:43,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:27:43,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:43,998 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:43,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:44,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:44,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:44,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:44,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:44,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:44,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1311350583] [2019-12-27 23:27:44,189 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:44,191 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:44,212 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:27:44,213 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:44,214 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:27:44,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:44,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:44,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:44,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:27:44,215 INFO L87 Difference]: Start difference. First operand 1106 states and 2487 transitions. Second operand 12 states. [2019-12-27 23:27:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:44,650 INFO L93 Difference]: Finished difference Result 1969 states and 4330 transitions. [2019-12-27 23:27:44,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:27:44,650 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:44,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:44,652 INFO L225 Difference]: With dead ends: 1969 [2019-12-27 23:27:44,652 INFO L226 Difference]: Without dead ends: 1862 [2019-12-27 23:27:44,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=240, Invalid=690, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:27:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2019-12-27 23:27:44,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1122. [2019-12-27 23:27:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2019-12-27 23:27:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 2527 transitions. [2019-12-27 23:27:44,666 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 2527 transitions. Word has length 48 [2019-12-27 23:27:44,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:44,666 INFO L462 AbstractCegarLoop]: Abstraction has 1122 states and 2527 transitions. [2019-12-27 23:27:44,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:44,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 2527 transitions. [2019-12-27 23:27:44,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:44,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:44,668 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:44,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:44,869 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:44,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:44,869 INFO L82 PathProgramCache]: Analyzing trace with hash -42541485, now seen corresponding path program 57 times [2019-12-27 23:27:44,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:44,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107407915] [2019-12-27 23:27:44,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:45,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107407915] [2019-12-27 23:27:45,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705362637] [2019-12-27 23:27:45,034 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:45,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 23:27:45,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:45,083 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-27 23:27:45,084 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:45,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:45,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:45,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:45,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:45,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-12-27 23:27:45,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [17207285] [2019-12-27 23:27:45,260 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:45,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:45,283 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:27:45,284 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:45,284 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:27:45,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:45,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:45,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:45,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:27:45,285 INFO L87 Difference]: Start difference. First operand 1122 states and 2527 transitions. Second operand 12 states. [2019-12-27 23:27:45,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:45,712 INFO L93 Difference]: Finished difference Result 1957 states and 4310 transitions. [2019-12-27 23:27:45,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:27:45,713 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:45,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:45,715 INFO L225 Difference]: With dead ends: 1957 [2019-12-27 23:27:45,715 INFO L226 Difference]: Without dead ends: 1850 [2019-12-27 23:27:45,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=255, Invalid=737, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:27:45,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2019-12-27 23:27:45,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1102. [2019-12-27 23:27:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2019-12-27 23:27:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 2474 transitions. [2019-12-27 23:27:45,728 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 2474 transitions. Word has length 48 [2019-12-27 23:27:45,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:45,728 INFO L462 AbstractCegarLoop]: Abstraction has 1102 states and 2474 transitions. [2019-12-27 23:27:45,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 2474 transitions. [2019-12-27 23:27:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:45,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:45,730 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:45,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:45,930 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:45,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:45,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1581973769, now seen corresponding path program 58 times [2019-12-27 23:27:45,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:45,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590331264] [2019-12-27 23:27:45,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:46,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590331264] [2019-12-27 23:27:46,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714590180] [2019-12-27 23:27:46,116 INFO L92 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:46,162 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:27:46,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:46,163 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:46,165 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:46,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:46,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:46,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:46,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:46,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:46,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [74344259] [2019-12-27 23:27:46,383 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:46,386 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:46,406 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:27:46,407 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:46,408 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:27:46,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:46,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:46,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:46,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:27:46,409 INFO L87 Difference]: Start difference. First operand 1102 states and 2474 transitions. Second operand 12 states. [2019-12-27 23:27:46,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:46,894 INFO L93 Difference]: Finished difference Result 2028 states and 4448 transitions. [2019-12-27 23:27:46,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:27:46,894 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:46,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:46,896 INFO L225 Difference]: With dead ends: 2028 [2019-12-27 23:27:46,896 INFO L226 Difference]: Without dead ends: 1921 [2019-12-27 23:27:46,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=252, Invalid=740, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:27:46,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2019-12-27 23:27:46,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1134. [2019-12-27 23:27:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2019-12-27 23:27:46,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 2554 transitions. [2019-12-27 23:27:46,908 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 2554 transitions. Word has length 48 [2019-12-27 23:27:46,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:46,908 INFO L462 AbstractCegarLoop]: Abstraction has 1134 states and 2554 transitions. [2019-12-27 23:27:46,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 2554 transitions. [2019-12-27 23:27:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:46,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:46,910 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:47,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 91 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:47,110 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:47,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:47,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1572142739, now seen corresponding path program 59 times [2019-12-27 23:27:47,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:47,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389802784] [2019-12-27 23:27:47,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:47,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389802784] [2019-12-27 23:27:47,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737581102] [2019-12-27 23:27:47,253 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:47,295 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 23:27:47,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:47,296 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:47,296 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:49,655 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-12-27 23:27:49,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:49,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:49,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:49,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:49,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:49,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [425687402] [2019-12-27 23:27:49,669 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:49,673 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:49,694 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:27:49,695 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:49,696 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:27:49,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:49,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:49,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:49,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:27:49,696 INFO L87 Difference]: Start difference. First operand 1134 states and 2554 transitions. Second operand 12 states. [2019-12-27 23:27:52,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:52,032 INFO L93 Difference]: Finished difference Result 1985 states and 4370 transitions. [2019-12-27 23:27:52,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:27:52,032 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:52,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:52,034 INFO L225 Difference]: With dead ends: 1985 [2019-12-27 23:27:52,034 INFO L226 Difference]: Without dead ends: 1878 [2019-12-27 23:27:52,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=254, Invalid=734, Unknown=4, NotChecked=0, Total=992 [2019-12-27 23:27:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2019-12-27 23:27:52,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1118. [2019-12-27 23:27:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2019-12-27 23:27:52,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 2514 transitions. [2019-12-27 23:27:52,047 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 2514 transitions. Word has length 48 [2019-12-27 23:27:52,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:52,047 INFO L462 AbstractCegarLoop]: Abstraction has 1118 states and 2514 transitions. [2019-12-27 23:27:52,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:52,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 2514 transitions. [2019-12-27 23:27:52,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:52,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:52,049 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:27:52,249 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:52,250 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:52,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:52,250 INFO L82 PathProgramCache]: Analyzing trace with hash -805532617, now seen corresponding path program 60 times [2019-12-27 23:27:52,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:52,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993149492] [2019-12-27 23:27:52,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:52,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993149492] [2019-12-27 23:27:52,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394169424] [2019-12-27 23:27:52,450 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:52,500 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-27 23:27:52,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:52,523 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:52,524 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:56,584 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-12-27 23:27:56,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:56,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:56,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:56,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:56,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:56,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [366511558] [2019-12-27 23:27:56,596 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:56,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:56,620 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:27:56,620 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:56,621 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:27:56,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:56,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:56,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:56,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=293, Unknown=2, NotChecked=0, Total=380 [2019-12-27 23:27:56,622 INFO L87 Difference]: Start difference. First operand 1118 states and 2514 transitions. Second operand 12 states. [2019-12-27 23:28:00,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:28:00,231 INFO L93 Difference]: Finished difference Result 2037 states and 4470 transitions. [2019-12-27 23:28:00,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:28:00,231 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:28:00,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:28:00,233 INFO L225 Difference]: With dead ends: 2037 [2019-12-27 23:28:00,233 INFO L226 Difference]: Without dead ends: 1930 [2019-12-27 23:28:00,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=255, Invalid=730, Unknown=7, NotChecked=0, Total=992 [2019-12-27 23:28:00,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-12-27 23:28:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1134. [2019-12-27 23:28:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2019-12-27 23:28:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 2554 transitions. [2019-12-27 23:28:00,246 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 2554 transitions. Word has length 48 [2019-12-27 23:28:00,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:28:00,246 INFO L462 AbstractCegarLoop]: Abstraction has 1134 states and 2554 transitions. [2019-12-27 23:28:00,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:28:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 2554 transitions. [2019-12-27 23:28:00,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:28:00,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:28:00,248 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:28:00,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 93 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:00,448 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:28:00,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:28:00,449 INFO L82 PathProgramCache]: Analyzing trace with hash -795701587, now seen corresponding path program 61 times [2019-12-27 23:28:00,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:28:00,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701820609] [2019-12-27 23:28:00,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:28:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:28:00,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701820609] [2019-12-27 23:28:00,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214718189] [2019-12-27 23:28:00,601 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:00,645 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:28:00,646 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:28:05,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:05,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:05,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:28:05,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:28:05,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:28:05,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [303907760] [2019-12-27 23:28:05,234 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:28:05,237 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:28:05,260 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:28:05,260 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:28:05,261 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:28:05,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:28:05,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:28:05,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:28:05,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=296, Unknown=1, NotChecked=0, Total=380 [2019-12-27 23:28:05,262 INFO L87 Difference]: Start difference. First operand 1134 states and 2554 transitions. Second operand 12 states. [2019-12-27 23:28:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:28:12,852 INFO L93 Difference]: Finished difference Result 2025 states and 4450 transitions. [2019-12-27 23:28:12,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:28:12,853 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:28:12,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:28:12,855 INFO L225 Difference]: With dead ends: 2025 [2019-12-27 23:28:12,855 INFO L226 Difference]: Without dead ends: 1918 [2019-12-27 23:28:12,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=251, Invalid=735, Unknown=6, NotChecked=0, Total=992 [2019-12-27 23:28:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2019-12-27 23:28:12,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1098. [2019-12-27 23:28:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098 states. [2019-12-27 23:28:12,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 2461 transitions. [2019-12-27 23:28:12,871 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 2461 transitions. Word has length 48 [2019-12-27 23:28:12,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:28:12,871 INFO L462 AbstractCegarLoop]: Abstraction has 1098 states and 2461 transitions. [2019-12-27 23:28:12,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:28:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 2461 transitions. [2019-12-27 23:28:12,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:28:12,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:28:12,873 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:28:13,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 94 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:13,075 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:28:13,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:28:13,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1423047407, now seen corresponding path program 62 times [2019-12-27 23:28:13,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:28:13,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660387256] [2019-12-27 23:28:13,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:28:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:28:13,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660387256] [2019-12-27 23:28:13,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609574247] [2019-12-27 23:28:13,247 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:13,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:28:13,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:28:13,295 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:28:13,296 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:28:13,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:13,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:13,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:28:13,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:28:13,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:28:13,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1199656566] [2019-12-27 23:28:13,532 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:28:13,564 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:28:13,588 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:28:13,588 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:28:13,589 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:28:13,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:28:13,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:28:13,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:28:13,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:28:13,590 INFO L87 Difference]: Start difference. First operand 1098 states and 2461 transitions. Second operand 12 states. [2019-12-27 23:28:14,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:28:14,126 INFO L93 Difference]: Finished difference Result 2049 states and 4490 transitions. [2019-12-27 23:28:14,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:28:14,126 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:28:14,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:28:14,129 INFO L225 Difference]: With dead ends: 2049 [2019-12-27 23:28:14,129 INFO L226 Difference]: Without dead ends: 1942 [2019-12-27 23:28:14,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:28:14,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2019-12-27 23:28:14,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1146. [2019-12-27 23:28:14,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1146 states. [2019-12-27 23:28:14,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 2581 transitions. [2019-12-27 23:28:14,146 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 2581 transitions. Word has length 48 [2019-12-27 23:28:14,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:28:14,146 INFO L462 AbstractCegarLoop]: Abstraction has 1146 states and 2581 transitions. [2019-12-27 23:28:14,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:28:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 2581 transitions. [2019-12-27 23:28:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:28:14,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:28:14,148 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:28:14,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:14,349 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:28:14,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:28:14,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1413216377, now seen corresponding path program 63 times [2019-12-27 23:28:14,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:28:14,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858126947] [2019-12-27 23:28:14,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:28:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:28:14,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858126947] [2019-12-27 23:28:14,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572722127] [2019-12-27 23:28:14,510 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:14,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:28:14,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:28:14,556 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-27 23:28:14,557 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:28:14,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:14,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:14,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:28:14,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:28:14,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:28:14,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [192130448] [2019-12-27 23:28:14,824 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:28:14,827 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:28:14,852 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:28:14,852 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:28:14,853 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:28:14,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:28:14,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:28:14,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:28:14,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:28:14,854 INFO L87 Difference]: Start difference. First operand 1146 states and 2581 transitions. Second operand 12 states. [2019-12-27 23:28:15,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:28:15,466 INFO L93 Difference]: Finished difference Result 1992 states and 4388 transitions. [2019-12-27 23:28:15,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:28:15,467 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:28:15,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:28:15,469 INFO L225 Difference]: With dead ends: 1992 [2019-12-27 23:28:15,469 INFO L226 Difference]: Without dead ends: 1885 [2019-12-27 23:28:15,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:28:15,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2019-12-27 23:28:15,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 1130. [2019-12-27 23:28:15,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-12-27 23:28:15,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 2541 transitions. [2019-12-27 23:28:15,485 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 2541 transitions. Word has length 48 [2019-12-27 23:28:15,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:28:15,485 INFO L462 AbstractCegarLoop]: Abstraction has 1130 states and 2541 transitions. [2019-12-27 23:28:15,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:28:15,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 2541 transitions. [2019-12-27 23:28:15,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:28:15,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:28:15,487 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:28:15,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:15,690 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:28:15,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:28:15,691 INFO L82 PathProgramCache]: Analyzing trace with hash -646606255, now seen corresponding path program 64 times [2019-12-27 23:28:15,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:28:15,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164723011] [2019-12-27 23:28:15,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:28:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:28:15,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164723011] [2019-12-27 23:28:15,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984010210] [2019-12-27 23:28:15,883 INFO L92 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:15,926 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:28:15,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:28:15,927 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:28:15,928 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:28:16,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:16,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:16,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:28:16,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:28:16,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:28:16,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2103034429] [2019-12-27 23:28:16,231 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:28:16,234 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:28:16,292 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:28:16,292 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:28:16,294 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:28:16,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:28:16,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:28:16,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:28:16,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:28:16,294 INFO L87 Difference]: Start difference. First operand 1130 states and 2541 transitions. Second operand 12 states. [2019-12-27 23:28:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:28:16,962 INFO L93 Difference]: Finished difference Result 2065 states and 4530 transitions. [2019-12-27 23:28:16,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:28:16,963 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:28:16,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:28:16,965 INFO L225 Difference]: With dead ends: 2065 [2019-12-27 23:28:16,965 INFO L226 Difference]: Without dead ends: 1958 [2019-12-27 23:28:16,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=280, Invalid=842, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 23:28:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2019-12-27 23:28:16,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1146. [2019-12-27 23:28:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1146 states. [2019-12-27 23:28:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 2581 transitions. [2019-12-27 23:28:16,984 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 2581 transitions. Word has length 48 [2019-12-27 23:28:16,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:28:16,984 INFO L462 AbstractCegarLoop]: Abstraction has 1146 states and 2581 transitions. [2019-12-27 23:28:16,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:28:16,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 2581 transitions. [2019-12-27 23:28:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:28:16,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:28:16,985 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:28:17,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:17,186 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:28:17,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:28:17,187 INFO L82 PathProgramCache]: Analyzing trace with hash -636775225, now seen corresponding path program 65 times [2019-12-27 23:28:17,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:28:17,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029151701] [2019-12-27 23:28:17,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:28:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:28:17,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029151701] [2019-12-27 23:28:17,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450088426] [2019-12-27 23:28:17,353 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:17,401 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 23:28:17,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:28:17,402 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:28:17,403 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:28:17,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:17,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:17,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:28:17,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:28:17,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:28:17,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1950771553] [2019-12-27 23:28:17,805 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:28:17,809 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:28:17,848 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:28:17,849 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:28:17,850 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:28:17,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:28:17,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:28:17,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:28:17,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:28:17,851 INFO L87 Difference]: Start difference. First operand 1146 states and 2581 transitions. Second operand 12 states. [2019-12-27 23:28:28,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:28:28,618 INFO L93 Difference]: Finished difference Result 2032 states and 4468 transitions. [2019-12-27 23:28:28,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:28:28,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:28:28,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:28:28,621 INFO L225 Difference]: With dead ends: 2032 [2019-12-27 23:28:28,621 INFO L226 Difference]: Without dead ends: 1925 [2019-12-27 23:28:28,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=262, Invalid=789, Unknown=5, NotChecked=0, Total=1056 [2019-12-27 23:28:28,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2019-12-27 23:28:28,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1114. [2019-12-27 23:28:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2019-12-27 23:28:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 2501 transitions. [2019-12-27 23:28:28,638 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 2501 transitions. Word has length 48 [2019-12-27 23:28:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:28:28,638 INFO L462 AbstractCegarLoop]: Abstraction has 1114 states and 2501 transitions. [2019-12-27 23:28:28,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:28:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 2501 transitions. [2019-12-27 23:28:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:28:28,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:28:28,639 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:28:28,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 98 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:28,840 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:28:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:28:28,841 INFO L82 PathProgramCache]: Analyzing trace with hash 611119697, now seen corresponding path program 66 times [2019-12-27 23:28:28,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:28:28,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014134739] [2019-12-27 23:28:28,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:28:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:29,008 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:28:29,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014134739] [2019-12-27 23:28:29,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779614201] [2019-12-27 23:28:29,009 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:29,059 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 23:28:29,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:28:29,060 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:28:29,062 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:28:37,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:37,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:37,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:28:37,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:28:37,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:28:37,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [933072579] [2019-12-27 23:28:37,604 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:28:37,606 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:28:37,671 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:28:37,671 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:28:37,673 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:28:37,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:28:37,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:28:37,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:28:37,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:28:37,674 INFO L87 Difference]: Start difference. First operand 1114 states and 2501 transitions. Second operand 12 states. [2019-12-27 23:28:46,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:28:46,358 INFO L93 Difference]: Finished difference Result 2037 states and 4470 transitions. [2019-12-27 23:28:46,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:28:46,359 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:28:46,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:28:46,361 INFO L225 Difference]: With dead ends: 2037 [2019-12-27 23:28:46,362 INFO L226 Difference]: Without dead ends: 1930 [2019-12-27 23:28:46,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=261, Invalid=791, Unknown=4, NotChecked=0, Total=1056 [2019-12-27 23:28:46,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-12-27 23:28:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1146. [2019-12-27 23:28:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1146 states. [2019-12-27 23:28:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 2581 transitions. [2019-12-27 23:28:46,386 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 2581 transitions. Word has length 48 [2019-12-27 23:28:46,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:28:46,386 INFO L462 AbstractCegarLoop]: Abstraction has 1146 states and 2581 transitions. [2019-12-27 23:28:46,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:28:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 2581 transitions. [2019-12-27 23:28:46,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:28:46,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:28:46,388 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:28:46,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:46,588 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:28:46,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:28:46,589 INFO L82 PathProgramCache]: Analyzing trace with hash 620950727, now seen corresponding path program 67 times [2019-12-27 23:28:46,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:28:46,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932782368] [2019-12-27 23:28:46,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:28:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:28:46,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932782368] [2019-12-27 23:28:46,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183016063] [2019-12-27 23:28:46,736 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:46,778 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:28:46,779 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:28:47,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:47,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:47,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:28:47,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:28:47,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:28:47,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [728223449] [2019-12-27 23:28:47,222 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:28:47,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:28:47,259 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:28:47,259 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:28:47,261 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:28:47,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:28:47,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:28:47,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:28:47,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:28:47,262 INFO L87 Difference]: Start difference. First operand 1146 states and 2581 transitions. Second operand 12 states. [2019-12-27 23:28:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:28:47,864 INFO L93 Difference]: Finished difference Result 2013 states and 4430 transitions. [2019-12-27 23:28:47,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:28:47,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:28:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:28:47,867 INFO L225 Difference]: With dead ends: 2013 [2019-12-27 23:28:47,867 INFO L226 Difference]: Without dead ends: 1906 [2019-12-27 23:28:47,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=265, Invalid=791, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:28:47,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2019-12-27 23:28:47,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1130. [2019-12-27 23:28:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-12-27 23:28:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 2541 transitions. [2019-12-27 23:28:47,881 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 2541 transitions. Word has length 48 [2019-12-27 23:28:47,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:28:47,881 INFO L462 AbstractCegarLoop]: Abstraction has 1130 states and 2541 transitions. [2019-12-27 23:28:47,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:28:47,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 2541 transitions. [2019-12-27 23:28:47,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:28:47,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:28:47,882 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:28:48,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:48,087 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:28:48,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:28:48,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1387560849, now seen corresponding path program 68 times [2019-12-27 23:28:48,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:28:48,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403025869] [2019-12-27 23:28:48,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:28:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:28:48,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403025869] [2019-12-27 23:28:48,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368128026] [2019-12-27 23:28:48,255 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:48,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:28:48,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:28:48,302 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:28:48,303 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:28:57,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:57,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:57,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:28:57,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:28:57,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:28:57,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [187600419] [2019-12-27 23:28:57,286 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:28:57,288 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:28:57,346 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:28:57,346 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:28:57,347 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:28:57,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:28:57,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:28:57,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:28:57,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:28:57,348 INFO L87 Difference]: Start difference. First operand 1130 states and 2541 transitions. Second operand 12 states. [2019-12-27 23:29:00,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:00,624 INFO L93 Difference]: Finished difference Result 2065 states and 4530 transitions. [2019-12-27 23:29:00,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:29:00,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:00,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:00,626 INFO L225 Difference]: With dead ends: 2065 [2019-12-27 23:29:00,626 INFO L226 Difference]: Without dead ends: 1958 [2019-12-27 23:29:00,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=263, Invalid=792, Unknown=1, NotChecked=0, Total=1056 [2019-12-27 23:29:00,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2019-12-27 23:29:00,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1146. [2019-12-27 23:29:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1146 states. [2019-12-27 23:29:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 2581 transitions. [2019-12-27 23:29:00,640 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 2581 transitions. Word has length 48 [2019-12-27 23:29:00,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:00,641 INFO L462 AbstractCegarLoop]: Abstraction has 1146 states and 2581 transitions. [2019-12-27 23:29:00,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 2581 transitions. [2019-12-27 23:29:00,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:00,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:00,642 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:00,842 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 101 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:00,842 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:00,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:00,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1397391879, now seen corresponding path program 69 times [2019-12-27 23:29:00,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:00,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799556556] [2019-12-27 23:29:00,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:00,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799556556] [2019-12-27 23:29:00,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86545658] [2019-12-27 23:29:00,982 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:01,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 23:29:01,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:01,033 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-27 23:29:01,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:01,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:01,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:01,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:01,186 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:01,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:01,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-12-27 23:29:01,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [143682873] [2019-12-27 23:29:01,187 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:01,189 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:01,212 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:01,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:01,213 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:29:01,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:01,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:01,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:01,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:29:01,213 INFO L87 Difference]: Start difference. First operand 1146 states and 2581 transitions. Second operand 12 states. [2019-12-27 23:29:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:01,682 INFO L93 Difference]: Finished difference Result 2013 states and 4430 transitions. [2019-12-27 23:29:01,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:29:01,683 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:01,685 INFO L225 Difference]: With dead ends: 2013 [2019-12-27 23:29:01,685 INFO L226 Difference]: Without dead ends: 1906 [2019-12-27 23:29:01,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 23:29:01,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2019-12-27 23:29:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1097. [2019-12-27 23:29:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2019-12-27 23:29:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 2457 transitions. [2019-12-27 23:29:01,700 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 2457 transitions. Word has length 48 [2019-12-27 23:29:01,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:01,700 INFO L462 AbstractCegarLoop]: Abstraction has 1097 states and 2457 transitions. [2019-12-27 23:29:01,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 2457 transitions. [2019-12-27 23:29:01,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:01,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:01,702 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:01,905 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:01,905 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:01,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:01,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1507693013, now seen corresponding path program 70 times [2019-12-27 23:29:01,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:01,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073516911] [2019-12-27 23:29:01,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:02,047 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:02,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073516911] [2019-12-27 23:29:02,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948525771] [2019-12-27 23:29:02,048 INFO L92 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:02,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:29:02,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:02,093 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:02,093 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:02,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:02,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:02,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:02,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:02,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:02,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [751603778] [2019-12-27 23:29:02,234 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:02,237 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:02,291 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:02,291 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:02,292 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:02,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:02,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:02,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:02,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:02,293 INFO L87 Difference]: Start difference. First operand 1097 states and 2457 transitions. Second operand 12 states. [2019-12-27 23:29:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:02,776 INFO L93 Difference]: Finished difference Result 2026 states and 4444 transitions. [2019-12-27 23:29:02,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:29:02,776 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:02,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:02,778 INFO L225 Difference]: With dead ends: 2026 [2019-12-27 23:29:02,778 INFO L226 Difference]: Without dead ends: 1919 [2019-12-27 23:29:02,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=806, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:29:02,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2019-12-27 23:29:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1161. [2019-12-27 23:29:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-12-27 23:29:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 2617 transitions. [2019-12-27 23:29:02,793 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 2617 transitions. Word has length 48 [2019-12-27 23:29:02,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:02,793 INFO L462 AbstractCegarLoop]: Abstraction has 1161 states and 2617 transitions. [2019-12-27 23:29:02,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 2617 transitions. [2019-12-27 23:29:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:02,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:02,794 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:02,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:02,995 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:02,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:02,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1497861983, now seen corresponding path program 71 times [2019-12-27 23:29:02,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:02,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704770491] [2019-12-27 23:29:02,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:03,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704770491] [2019-12-27 23:29:03,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92464184] [2019-12-27 23:29:03,143 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:03,189 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-27 23:29:03,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:03,191 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:03,192 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:03,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:03,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:03,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:03,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:03,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:03,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1457257474] [2019-12-27 23:29:03,618 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:03,620 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:03,642 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:03,642 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:03,644 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:03,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:03,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:03,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:03,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:03,644 INFO L87 Difference]: Start difference. First operand 1161 states and 2617 transitions. Second operand 12 states. [2019-12-27 23:29:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:05,489 INFO L93 Difference]: Finished difference Result 1999 states and 4406 transitions. [2019-12-27 23:29:05,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:29:05,490 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:05,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:05,492 INFO L225 Difference]: With dead ends: 1999 [2019-12-27 23:29:05,492 INFO L226 Difference]: Without dead ends: 1892 [2019-12-27 23:29:05,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=254, Invalid=799, Unknown=3, NotChecked=0, Total=1056 [2019-12-27 23:29:05,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2019-12-27 23:29:05,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1145. [2019-12-27 23:29:05,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2019-12-27 23:29:05,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 2577 transitions. [2019-12-27 23:29:05,505 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 2577 transitions. Word has length 48 [2019-12-27 23:29:05,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:05,506 INFO L462 AbstractCegarLoop]: Abstraction has 1145 states and 2577 transitions. [2019-12-27 23:29:05,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:05,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 2577 transitions. [2019-12-27 23:29:05,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:05,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:05,507 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:05,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 104 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:05,707 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:05,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:05,708 INFO L82 PathProgramCache]: Analyzing trace with hash -731251861, now seen corresponding path program 72 times [2019-12-27 23:29:05,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:05,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747306966] [2019-12-27 23:29:05,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:05,856 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:05,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747306966] [2019-12-27 23:29:05,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243220050] [2019-12-27 23:29:05,857 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:05,903 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-27 23:29:05,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:05,905 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:05,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:09,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:09,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:09,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:09,641 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:09,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:09,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:09,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2102044169] [2019-12-27 23:29:09,642 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:09,644 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:09,665 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:09,666 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:09,667 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:09,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:09,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:09,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:09,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=298, Unknown=1, NotChecked=0, Total=380 [2019-12-27 23:29:09,668 INFO L87 Difference]: Start difference. First operand 1145 states and 2577 transitions. Second operand 12 states. [2019-12-27 23:29:13,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:13,544 INFO L93 Difference]: Finished difference Result 2032 states and 4468 transitions. [2019-12-27 23:29:13,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:29:13,544 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:13,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:13,546 INFO L225 Difference]: With dead ends: 2032 [2019-12-27 23:29:13,546 INFO L226 Difference]: Without dead ends: 1925 [2019-12-27 23:29:13,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=267, Invalid=847, Unknown=8, NotChecked=0, Total=1122 [2019-12-27 23:29:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2019-12-27 23:29:13,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1161. [2019-12-27 23:29:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-12-27 23:29:13,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 2617 transitions. [2019-12-27 23:29:13,561 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 2617 transitions. Word has length 48 [2019-12-27 23:29:13,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:13,561 INFO L462 AbstractCegarLoop]: Abstraction has 1161 states and 2617 transitions. [2019-12-27 23:29:13,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:13,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 2617 transitions. [2019-12-27 23:29:13,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:13,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:13,562 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:13,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 105 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:13,763 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:13,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:13,764 INFO L82 PathProgramCache]: Analyzing trace with hash -721420831, now seen corresponding path program 73 times [2019-12-27 23:29:13,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:13,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806701551] [2019-12-27 23:29:13,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:13,911 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:13,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806701551] [2019-12-27 23:29:13,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287032556] [2019-12-27 23:29:13,911 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:13,957 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:13,958 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:16,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:16,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:16,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:16,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:16,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:16,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1859410855] [2019-12-27 23:29:16,452 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:16,454 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:16,476 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:16,476 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:16,477 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:16,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:16,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:16,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:16,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=300, Unknown=1, NotChecked=0, Total=380 [2019-12-27 23:29:16,478 INFO L87 Difference]: Start difference. First operand 1161 states and 2617 transitions. Second operand 12 states. [2019-12-27 23:29:18,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:18,656 INFO L93 Difference]: Finished difference Result 2060 states and 4528 transitions. [2019-12-27 23:29:18,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:29:18,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:18,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:18,658 INFO L225 Difference]: With dead ends: 2060 [2019-12-27 23:29:18,659 INFO L226 Difference]: Without dead ends: 1953 [2019-12-27 23:29:18,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=249, Invalid=802, Unknown=5, NotChecked=0, Total=1056 [2019-12-27 23:29:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2019-12-27 23:29:18,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1129. [2019-12-27 23:29:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2019-12-27 23:29:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 2537 transitions. [2019-12-27 23:29:18,671 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 2537 transitions. Word has length 48 [2019-12-27 23:29:18,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:18,672 INFO L462 AbstractCegarLoop]: Abstraction has 1129 states and 2537 transitions. [2019-12-27 23:29:18,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 2537 transitions. [2019-12-27 23:29:18,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:18,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:18,673 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:18,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:18,874 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:18,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:18,875 INFO L82 PathProgramCache]: Analyzing trace with hash 526474091, now seen corresponding path program 74 times [2019-12-27 23:29:18,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:18,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033170414] [2019-12-27 23:29:18,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:19,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033170414] [2019-12-27 23:29:19,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332023563] [2019-12-27 23:29:19,061 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:19,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:29:19,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:19,108 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:19,109 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:24,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:24,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:24,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:24,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:24,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:24,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [662986251] [2019-12-27 23:29:24,676 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:24,679 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:24,700 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:24,701 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:24,702 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:24,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:24,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:24,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:24,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=295, Unknown=4, NotChecked=0, Total=380 [2019-12-27 23:29:24,702 INFO L87 Difference]: Start difference. First operand 1129 states and 2537 transitions. Second operand 12 states. [2019-12-27 23:29:28,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:28,329 INFO L93 Difference]: Finished difference Result 2065 states and 4530 transitions. [2019-12-27 23:29:28,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 23:29:28,329 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:28,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:28,331 INFO L225 Difference]: With dead ends: 2065 [2019-12-27 23:29:28,331 INFO L226 Difference]: Without dead ends: 1958 [2019-12-27 23:29:28,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=286, Invalid=898, Unknown=6, NotChecked=0, Total=1190 [2019-12-27 23:29:28,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2019-12-27 23:29:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1161. [2019-12-27 23:29:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-12-27 23:29:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 2617 transitions. [2019-12-27 23:29:28,346 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 2617 transitions. Word has length 48 [2019-12-27 23:29:28,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:28,347 INFO L462 AbstractCegarLoop]: Abstraction has 1161 states and 2617 transitions. [2019-12-27 23:29:28,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 2617 transitions. [2019-12-27 23:29:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:28,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:28,348 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:28,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 107 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:28,548 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:28,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:28,549 INFO L82 PathProgramCache]: Analyzing trace with hash 536305121, now seen corresponding path program 75 times [2019-12-27 23:29:28,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:28,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52406363] [2019-12-27 23:29:28,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:28,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52406363] [2019-12-27 23:29:28,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988746349] [2019-12-27 23:29:28,726 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:28,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:29:28,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:28,775 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 23:29:28,776 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:30,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:30,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:30,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:30,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:30,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:30,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1109105029] [2019-12-27 23:29:30,140 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:30,142 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:30,164 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:30,164 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:30,165 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:30,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:30,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:30,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:30,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=303, Unknown=1, NotChecked=0, Total=380 [2019-12-27 23:29:30,166 INFO L87 Difference]: Start difference. First operand 1161 states and 2617 transitions. Second operand 12 states. [2019-12-27 23:29:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:31,573 INFO L93 Difference]: Finished difference Result 2041 states and 4490 transitions. [2019-12-27 23:29:31,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 23:29:31,574 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:31,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:31,576 INFO L225 Difference]: With dead ends: 2041 [2019-12-27 23:29:31,576 INFO L226 Difference]: Without dead ends: 1934 [2019-12-27 23:29:31,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=281, Invalid=907, Unknown=2, NotChecked=0, Total=1190 [2019-12-27 23:29:31,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2019-12-27 23:29:31,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1145. [2019-12-27 23:29:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2019-12-27 23:29:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 2577 transitions. [2019-12-27 23:29:31,588 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 2577 transitions. Word has length 48 [2019-12-27 23:29:31,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:31,588 INFO L462 AbstractCegarLoop]: Abstraction has 1145 states and 2577 transitions. [2019-12-27 23:29:31,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 2577 transitions. [2019-12-27 23:29:31,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:31,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:31,589 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:31,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:31,790 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:31,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:31,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1302915243, now seen corresponding path program 76 times [2019-12-27 23:29:31,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:31,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824359815] [2019-12-27 23:29:31,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:31,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824359815] [2019-12-27 23:29:31,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403277926] [2019-12-27 23:29:31,945 INFO L92 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 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:31,987 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:29:31,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:31,988 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:31,988 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:32,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:32,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:32,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:32,674 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:32,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:32,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:32,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [236889256] [2019-12-27 23:29:32,675 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:32,678 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:32,700 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:32,700 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:32,701 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:32,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:32,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:32,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:32,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=298, Unknown=1, NotChecked=0, Total=380 [2019-12-27 23:29:32,702 INFO L87 Difference]: Start difference. First operand 1145 states and 2577 transitions. Second operand 12 states. [2019-12-27 23:29:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:33,337 INFO L93 Difference]: Finished difference Result 2133 states and 4670 transitions. [2019-12-27 23:29:33,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 23:29:33,337 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:33,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:33,339 INFO L225 Difference]: With dead ends: 2133 [2019-12-27 23:29:33,339 INFO L226 Difference]: Without dead ends: 2026 [2019-12-27 23:29:33,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=320, Invalid=1011, Unknown=1, NotChecked=0, Total=1332 [2019-12-27 23:29:33,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2019-12-27 23:29:33,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1161. [2019-12-27 23:29:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-12-27 23:29:33,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 2617 transitions. [2019-12-27 23:29:33,356 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 2617 transitions. Word has length 48 [2019-12-27 23:29:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:33,356 INFO L462 AbstractCegarLoop]: Abstraction has 1161 states and 2617 transitions. [2019-12-27 23:29:33,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:33,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 2617 transitions. [2019-12-27 23:29:33,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:33,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:33,357 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:33,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 109 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:33,561 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:33,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:33,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1312746273, now seen corresponding path program 77 times [2019-12-27 23:29:33,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:33,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740798460] [2019-12-27 23:29:33,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:33,696 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:33,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740798460] [2019-12-27 23:29:33,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702633221] [2019-12-27 23:29:33,697 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:33,744 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-27 23:29:33,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:33,745 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:33,746 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:34,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:34,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:34,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:34,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:34,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:34,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [217413403] [2019-12-27 23:29:34,560 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:34,563 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:34,583 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:34,584 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:34,585 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:34,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:34,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:34,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:34,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:34,585 INFO L87 Difference]: Start difference. First operand 1161 states and 2617 transitions. Second operand 12 states. [2019-12-27 23:29:35,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:35,614 INFO L93 Difference]: Finished difference Result 2062 states and 4532 transitions. [2019-12-27 23:29:35,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 23:29:35,614 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:35,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:35,616 INFO L225 Difference]: With dead ends: 2062 [2019-12-27 23:29:35,616 INFO L226 Difference]: Without dead ends: 1955 [2019-12-27 23:29:35,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=285, Invalid=904, Unknown=1, NotChecked=0, Total=1190 [2019-12-27 23:29:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2019-12-27 23:29:35,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1113. [2019-12-27 23:29:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-12-27 23:29:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 2497 transitions. [2019-12-27 23:29:35,628 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 2497 transitions. Word has length 48 [2019-12-27 23:29:35,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:35,629 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 2497 transitions. [2019-12-27 23:29:35,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:35,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 2497 transitions. [2019-12-27 23:29:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:35,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:35,630 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:35,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:35,830 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:35,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:35,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1604893547, now seen corresponding path program 78 times [2019-12-27 23:29:35,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:35,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441172604] [2019-12-27 23:29:35,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:35,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441172604] [2019-12-27 23:29:35,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45477918] [2019-12-27 23:29:35,974 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:36,019 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 23:29:36,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:36,020 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:36,021 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:36,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:36,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:36,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:36,171 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:36,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:36,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:36,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [662754117] [2019-12-27 23:29:36,172 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:36,174 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:36,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:36,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:36,198 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:36,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:36,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:36,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:36,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:36,198 INFO L87 Difference]: Start difference. First operand 1113 states and 2497 transitions. Second operand 12 states. [2019-12-27 23:29:36,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:36,792 INFO L93 Difference]: Finished difference Result 2138 states and 4672 transitions. [2019-12-27 23:29:36,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 23:29:36,792 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:36,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:36,794 INFO L225 Difference]: With dead ends: 2138 [2019-12-27 23:29:36,794 INFO L226 Difference]: Without dead ends: 2031 [2019-12-27 23:29:36,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=284, Invalid=906, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 23:29:36,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2019-12-27 23:29:36,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 1161. [2019-12-27 23:29:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-12-27 23:29:36,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 2617 transitions. [2019-12-27 23:29:36,808 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 2617 transitions. Word has length 48 [2019-12-27 23:29:36,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:36,809 INFO L462 AbstractCegarLoop]: Abstraction has 1161 states and 2617 transitions. [2019-12-27 23:29:36,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 2617 transitions. [2019-12-27 23:29:36,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:36,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:36,810 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:37,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:37,010 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:37,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:37,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1614724577, now seen corresponding path program 79 times [2019-12-27 23:29:37,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:37,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139785811] [2019-12-27 23:29:37,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:37,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139785811] [2019-12-27 23:29:37,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513715583] [2019-12-27 23:29:37,149 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:37,193 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:37,194 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:37,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:37,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:37,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:37,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:37,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:37,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1980318270] [2019-12-27 23:29:37,924 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:37,927 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:37,949 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:37,949 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:37,950 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:37,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:37,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:37,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:37,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:37,951 INFO L87 Difference]: Start difference. First operand 1161 states and 2617 transitions. Second operand 12 states. [2019-12-27 23:29:40,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:40,642 INFO L93 Difference]: Finished difference Result 2102 states and 4612 transitions. [2019-12-27 23:29:40,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 23:29:40,643 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:40,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:40,645 INFO L225 Difference]: With dead ends: 2102 [2019-12-27 23:29:40,645 INFO L226 Difference]: Without dead ends: 1995 [2019-12-27 23:29:40,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=291, Invalid=895, Unknown=4, NotChecked=0, Total=1190 [2019-12-27 23:29:40,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2019-12-27 23:29:40,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1145. [2019-12-27 23:29:40,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2019-12-27 23:29:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 2577 transitions. [2019-12-27 23:29:40,658 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 2577 transitions. Word has length 48 [2019-12-27 23:29:40,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:40,659 INFO L462 AbstractCegarLoop]: Abstraction has 1145 states and 2577 transitions. [2019-12-27 23:29:40,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:40,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 2577 transitions. [2019-12-27 23:29:40,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:40,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:40,660 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:40,860 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:40,860 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:40,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:40,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1913632597, now seen corresponding path program 80 times [2019-12-27 23:29:40,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:40,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858565922] [2019-12-27 23:29:40,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:41,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858565922] [2019-12-27 23:29:41,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719344243] [2019-12-27 23:29:41,006 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:41,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:29:41,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:41,052 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:41,053 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:41,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:41,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:41,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:41,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:41,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:41,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1287974147] [2019-12-27 23:29:41,215 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:41,219 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:41,248 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:41,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:41,250 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:41,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:41,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:41,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:41,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:41,251 INFO L87 Difference]: Start difference. First operand 1145 states and 2577 transitions. Second operand 12 states. [2019-12-27 23:29:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:41,867 INFO L93 Difference]: Finished difference Result 2074 states and 4552 transitions. [2019-12-27 23:29:41,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:29:41,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:41,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:41,870 INFO L225 Difference]: With dead ends: 2074 [2019-12-27 23:29:41,870 INFO L226 Difference]: Without dead ends: 1967 [2019-12-27 23:29:41,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 23:29:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2019-12-27 23:29:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1161. [2019-12-27 23:29:41,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-12-27 23:29:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 2617 transitions. [2019-12-27 23:29:41,884 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 2617 transitions. Word has length 48 [2019-12-27 23:29:41,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:41,885 INFO L462 AbstractCegarLoop]: Abstraction has 1161 states and 2617 transitions. [2019-12-27 23:29:41,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:41,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 2617 transitions. [2019-12-27 23:29:41,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:41,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:41,886 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:42,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:42,086 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:42,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:42,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1903801567, now seen corresponding path program 81 times [2019-12-27 23:29:42,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:42,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672553518] [2019-12-27 23:29:42,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:42,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672553518] [2019-12-27 23:29:42,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042078014] [2019-12-27 23:29:42,227 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:42,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:29:42,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:42,278 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:42,278 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:42,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:42,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:42,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:42,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:42,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:42,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [548031960] [2019-12-27 23:29:42,426 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:42,429 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:42,451 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:42,451 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:42,452 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:42,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:42,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:42,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:42,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:42,453 INFO L87 Difference]: Start difference. First operand 1161 states and 2617 transitions. Second operand 12 states. [2019-12-27 23:29:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:42,988 INFO L93 Difference]: Finished difference Result 2062 states and 4532 transitions. [2019-12-27 23:29:42,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:29:42,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:42,992 INFO L225 Difference]: With dead ends: 2062 [2019-12-27 23:29:42,992 INFO L226 Difference]: Without dead ends: 1955 [2019-12-27 23:29:42,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=856, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 23:29:42,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2019-12-27 23:29:43,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1129. [2019-12-27 23:29:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2019-12-27 23:29:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 2537 transitions. [2019-12-27 23:29:43,005 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 2537 transitions. Word has length 48 [2019-12-27 23:29:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:43,005 INFO L462 AbstractCegarLoop]: Abstraction has 1129 states and 2537 transitions. [2019-12-27 23:29:43,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 2537 transitions. [2019-12-27 23:29:43,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:43,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:43,006 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:43,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 114 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:43,207 INFO L410 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:43,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:43,207 INFO L82 PathProgramCache]: Analyzing trace with hash -655906645, now seen corresponding path program 82 times [2019-12-27 23:29:43,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:43,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634991193] [2019-12-27 23:29:43,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:43,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634991193] [2019-12-27 23:29:43,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57554416] [2019-12-27 23:29:43,351 INFO L92 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 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:43,395 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:29:43,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:43,395 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:43,397 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:44,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:44,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:44,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:44,312 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:44,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:44,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:44,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [642529219] [2019-12-27 23:29:44,312 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:44,315 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:44,337 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:44,337 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:44,338 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:44,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:44,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:44,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:44,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:44,339 INFO L87 Difference]: Start difference. First operand 1129 states and 2537 transitions. Second operand 12 states. [2019-12-27 23:29:45,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:45,277 INFO L93 Difference]: Finished difference Result 2086 states and 4572 transitions. [2019-12-27 23:29:45,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:29:45,278 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:45,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:45,280 INFO L225 Difference]: With dead ends: 2086 [2019-12-27 23:29:45,280 INFO L226 Difference]: Without dead ends: 1979 [2019-12-27 23:29:45,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=267, Invalid=854, Unknown=1, NotChecked=0, Total=1122 [2019-12-27 23:29:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2019-12-27 23:29:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1161. [2019-12-27 23:29:45,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-12-27 23:29:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 2617 transitions. [2019-12-27 23:29:45,294 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 2617 transitions. Word has length 48 [2019-12-27 23:29:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:45,294 INFO L462 AbstractCegarLoop]: Abstraction has 1161 states and 2617 transitions. [2019-12-27 23:29:45,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 2617 transitions. [2019-12-27 23:29:45,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:45,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:45,295 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:45,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 115 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:45,495 INFO L410 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:45,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:45,496 INFO L82 PathProgramCache]: Analyzing trace with hash -646075615, now seen corresponding path program 83 times [2019-12-27 23:29:45,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:45,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114366429] [2019-12-27 23:29:45,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:45,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114366429] [2019-12-27 23:29:45,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419275082] [2019-12-27 23:29:45,663 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:45,722 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 23:29:45,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:45,723 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:45,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:48,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:48,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:48,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:48,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:48,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:48,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [384114300] [2019-12-27 23:29:48,179 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:48,181 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:48,203 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:48,203 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:48,205 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:48,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:48,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:48,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:48,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=297, Unknown=2, NotChecked=0, Total=380 [2019-12-27 23:29:48,206 INFO L87 Difference]: Start difference. First operand 1161 states and 2617 transitions. Second operand 12 states. [2019-12-27 23:29:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:52,890 INFO L93 Difference]: Finished difference Result 2102 states and 4612 transitions. [2019-12-27 23:29:52,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:29:52,890 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:52,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:52,893 INFO L225 Difference]: With dead ends: 2102 [2019-12-27 23:29:52,893 INFO L226 Difference]: Without dead ends: 1995 [2019-12-27 23:29:52,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=270, Invalid=842, Unknown=10, NotChecked=0, Total=1122 [2019-12-27 23:29:52,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2019-12-27 23:29:52,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1145. [2019-12-27 23:29:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2019-12-27 23:29:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 2577 transitions. [2019-12-27 23:29:52,906 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 2577 transitions. Word has length 48 [2019-12-27 23:29:52,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:52,906 INFO L462 AbstractCegarLoop]: Abstraction has 1145 states and 2577 transitions. [2019-12-27 23:29:52,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:52,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 2577 transitions. [2019-12-27 23:29:52,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:52,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:52,907 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:53,108 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:53,108 INFO L410 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:53,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:53,109 INFO L82 PathProgramCache]: Analyzing trace with hash 120534507, now seen corresponding path program 84 times [2019-12-27 23:29:53,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:53,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387384677] [2019-12-27 23:29:53,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:53,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387384677] [2019-12-27 23:29:53,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260084161] [2019-12-27 23:29:53,253 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:53,301 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-27 23:29:53,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:53,302 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:53,303 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:53,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:53,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:53,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:53,897 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:53,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:53,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:53,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [254492368] [2019-12-27 23:29:53,898 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:53,901 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:53,923 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:53,923 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:53,924 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:53,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:53,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:53,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:53,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=298, Unknown=1, NotChecked=0, Total=380 [2019-12-27 23:29:53,925 INFO L87 Difference]: Start difference. First operand 1145 states and 2577 transitions. Second operand 12 states. [2019-12-27 23:29:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:54,874 INFO L93 Difference]: Finished difference Result 2074 states and 4552 transitions. [2019-12-27 23:29:54,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:29:54,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:54,877 INFO L225 Difference]: With dead ends: 2074 [2019-12-27 23:29:54,877 INFO L226 Difference]: Without dead ends: 1967 [2019-12-27 23:29:54,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=266, Invalid=854, Unknown=2, NotChecked=0, Total=1122 [2019-12-27 23:29:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2019-12-27 23:29:54,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1161. [2019-12-27 23:29:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-12-27 23:29:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 2617 transitions. [2019-12-27 23:29:54,891 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 2617 transitions. Word has length 48 [2019-12-27 23:29:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:54,891 INFO L462 AbstractCegarLoop]: Abstraction has 1161 states and 2617 transitions. [2019-12-27 23:29:54,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 2617 transitions. [2019-12-27 23:29:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:54,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:54,892 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:55,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 117 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:55,095 INFO L410 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:55,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:55,096 INFO L82 PathProgramCache]: Analyzing trace with hash 130365537, now seen corresponding path program 85 times [2019-12-27 23:29:55,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:55,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677767224] [2019-12-27 23:29:55,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:55,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677767224] [2019-12-27 23:29:55,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155765424] [2019-12-27 23:29:55,239 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:55,287 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:55,288 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:55,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:55,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:55,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:55,442 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:55,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:55,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:55,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1043879534] [2019-12-27 23:29:55,443 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:55,445 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:55,467 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:55,467 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:55,468 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:55,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:55,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:55,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:55,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:55,469 INFO L87 Difference]: Start difference. First operand 1161 states and 2617 transitions. Second operand 12 states. [2019-12-27 23:29:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:55,955 INFO L93 Difference]: Finished difference Result 1982 states and 4372 transitions. [2019-12-27 23:29:55,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:29:55,955 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:55,957 INFO L225 Difference]: With dead ends: 1982 [2019-12-27 23:29:55,957 INFO L226 Difference]: Without dead ends: 1875 [2019-12-27 23:29:55,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 23:29:55,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2019-12-27 23:29:55,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1106. [2019-12-27 23:29:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106 states. [2019-12-27 23:29:55,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 2475 transitions. [2019-12-27 23:29:55,970 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 2475 transitions. Word has length 48 [2019-12-27 23:29:55,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:55,970 INFO L462 AbstractCegarLoop]: Abstraction has 1106 states and 2475 transitions. [2019-12-27 23:29:55,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:55,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 2475 transitions. [2019-12-27 23:29:55,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:55,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:55,971 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:56,172 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 118 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:56,172 INFO L410 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:56,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:56,173 INFO L82 PathProgramCache]: Analyzing trace with hash -802637243, now seen corresponding path program 14 times [2019-12-27 23:29:56,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:56,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357725167] [2019-12-27 23:29:56,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:56,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357725167] [2019-12-27 23:29:56,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465031298] [2019-12-27 23:29:56,334 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:56,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:29:56,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:56,379 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:56,380 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:56,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:56,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:56,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:56,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:56,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:56,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1175473310] [2019-12-27 23:29:56,525 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:56,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:56,556 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 193 states and 336 transitions. [2019-12-27 23:29:56,557 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:56,560 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 23:29:56,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:56,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:56,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:56,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:56,561 INFO L87 Difference]: Start difference. First operand 1106 states and 2475 transitions. Second operand 12 states. [2019-12-27 23:29:57,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:57,006 INFO L93 Difference]: Finished difference Result 1889 states and 4191 transitions. [2019-12-27 23:29:57,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:29:57,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:57,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:57,008 INFO L225 Difference]: With dead ends: 1889 [2019-12-27 23:29:57,008 INFO L226 Difference]: Without dead ends: 1740 [2019-12-27 23:29:57,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:29:57,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2019-12-27 23:29:57,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1171. [2019-12-27 23:29:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2019-12-27 23:29:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 2629 transitions. [2019-12-27 23:29:57,022 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 2629 transitions. Word has length 48 [2019-12-27 23:29:57,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:57,022 INFO L462 AbstractCegarLoop]: Abstraction has 1171 states and 2629 transitions. [2019-12-27 23:29:57,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 2629 transitions. [2019-12-27 23:29:57,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:57,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:57,023 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:57,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:57,224 INFO L410 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:57,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:57,224 INFO L82 PathProgramCache]: Analyzing trace with hash -792806213, now seen corresponding path program 15 times [2019-12-27 23:29:57,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:57,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062787049] [2019-12-27 23:29:57,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:57,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062787049] [2019-12-27 23:29:57,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164958948] [2019-12-27 23:29:57,370 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:57,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-27 23:29:57,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:57,421 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-27 23:29:57,422 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:57,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:57,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:57,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:57,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:57,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:57,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1101669667] [2019-12-27 23:29:57,596 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:57,600 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:57,668 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 330 transitions. [2019-12-27 23:29:57,668 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:57,674 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 33 times. [2019-12-27 23:29:57,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:57,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:57,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:57,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:57,675 INFO L87 Difference]: Start difference. First operand 1171 states and 2629 transitions. Second operand 12 states. [2019-12-27 23:29:58,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:58,170 INFO L93 Difference]: Finished difference Result 1948 states and 4288 transitions. [2019-12-27 23:29:58,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:29:58,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:58,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:58,173 INFO L225 Difference]: With dead ends: 1948 [2019-12-27 23:29:58,173 INFO L226 Difference]: Without dead ends: 1841 [2019-12-27 23:29:58,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:29:58,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2019-12-27 23:29:58,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1167. [2019-12-27 23:29:58,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2019-12-27 23:29:58,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 2616 transitions. [2019-12-27 23:29:58,187 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 2616 transitions. Word has length 48 [2019-12-27 23:29:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:58,187 INFO L462 AbstractCegarLoop]: Abstraction has 1167 states and 2616 transitions. [2019-12-27 23:29:58,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:58,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 2616 transitions. [2019-12-27 23:29:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:58,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:58,188 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:29:58,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 120 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:58,389 INFO L410 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:58,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:58,389 INFO L82 PathProgramCache]: Analyzing trace with hash -26196091, now seen corresponding path program 86 times [2019-12-27 23:29:58,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:58,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414281575] [2019-12-27 23:29:58,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:58,536 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:58,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414281575] [2019-12-27 23:29:58,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095214207] [2019-12-27 23:29:58,537 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:58,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:29:58,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:58,582 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:58,583 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:59,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:59,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:59,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:29:59,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:59,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:59,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [300438113] [2019-12-27 23:29:59,531 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:59,533 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:59,561 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 306 transitions. [2019-12-27 23:29:59,561 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:59,563 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 23:29:59,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:59,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:59,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:59,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:59,564 INFO L87 Difference]: Start difference. First operand 1167 states and 2616 transitions. Second operand 12 states. [2019-12-27 23:30:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:01,069 INFO L93 Difference]: Finished difference Result 2129 states and 4650 transitions. [2019-12-27 23:30:01,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:30:01,069 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:30:01,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:01,072 INFO L225 Difference]: With dead ends: 2129 [2019-12-27 23:30:01,072 INFO L226 Difference]: Without dead ends: 2022 [2019-12-27 23:30:01,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=254, Invalid=866, Unknown=2, NotChecked=0, Total=1122 [2019-12-27 23:30:01,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2019-12-27 23:30:01,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1183. [2019-12-27 23:30:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-12-27 23:30:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 2656 transitions. [2019-12-27 23:30:01,086 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 2656 transitions. Word has length 48 [2019-12-27 23:30:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:01,086 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 2656 transitions. [2019-12-27 23:30:01,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:30:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 2656 transitions. [2019-12-27 23:30:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:30:01,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:01,087 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:01,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 121 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:01,288 INFO L410 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:01,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:01,288 INFO L82 PathProgramCache]: Analyzing trace with hash -16365061, now seen corresponding path program 87 times [2019-12-27 23:30:01,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:01,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924735873] [2019-12-27 23:30:01,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:01,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924735873] [2019-12-27 23:30:01,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186391006] [2019-12-27 23:30:01,437 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:01,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 23:30:01,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:01,483 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-27 23:30:01,484 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:01,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:01,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:01,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:01,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:01,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:30:01,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [149234367] [2019-12-27 23:30:01,662 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:01,665 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:01,692 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 306 transitions. [2019-12-27 23:30:01,692 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:01,695 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 23:30:01,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:30:01,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:01,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:30:01,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:30:01,695 INFO L87 Difference]: Start difference. First operand 1183 states and 2656 transitions. Second operand 12 states. [2019-12-27 23:30:02,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:02,166 INFO L93 Difference]: Finished difference Result 2117 states and 4630 transitions. [2019-12-27 23:30:02,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:30:02,166 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:30:02,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:02,168 INFO L225 Difference]: With dead ends: 2117 [2019-12-27 23:30:02,168 INFO L226 Difference]: Without dead ends: 2010 [2019-12-27 23:30:02,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:30:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2019-12-27 23:30:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 1163. [2019-12-27 23:30:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1163 states. [2019-12-27 23:30:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 2603 transitions. [2019-12-27 23:30:02,183 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 2603 transitions. Word has length 48 [2019-12-27 23:30:02,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:02,183 INFO L462 AbstractCegarLoop]: Abstraction has 1163 states and 2603 transitions. [2019-12-27 23:30:02,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:30:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 2603 transitions. [2019-12-27 23:30:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:30:02,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:02,185 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:02,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:02,386 INFO L410 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:02,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:02,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1231529861, now seen corresponding path program 88 times [2019-12-27 23:30:02,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:02,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140968499] [2019-12-27 23:30:02,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:02,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140968499] [2019-12-27 23:30:02,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903778506] [2019-12-27 23:30:02,568 INFO L92 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 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:02,616 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:30:02,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:02,617 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:30:02,618 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:03,771 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 16 Received shutdown request... [2019-12-27 23:30:06,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 123 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:06,365 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 23:30:06,371 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 23:30:06,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:30:06 BasicIcfg [2019-12-27 23:30:06,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:30:06,372 INFO L168 Benchmark]: Toolchain (without parser) took 277107.42 ms. Allocated memory was 146.8 MB in the beginning and 465.6 MB in the end (delta: 318.8 MB). Free memory was 103.8 MB in the beginning and 320.5 MB in the end (delta: -216.7 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:06,373 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 23:30:06,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 709.91 ms. Allocated memory was 146.8 MB in the beginning and 205.5 MB in the end (delta: 58.7 MB). Free memory was 103.4 MB in the beginning and 162.8 MB in the end (delta: -59.4 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:06,374 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.25 ms. Allocated memory is still 205.5 MB. Free memory was 162.8 MB in the beginning and 160.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:06,374 INFO L168 Benchmark]: Boogie Preprocessor took 31.50 ms. Allocated memory is still 205.5 MB. Free memory was 160.8 MB in the beginning and 159.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:06,374 INFO L168 Benchmark]: RCFGBuilder took 413.51 ms. Allocated memory is still 205.5 MB. Free memory was 159.5 MB in the beginning and 139.7 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:06,375 INFO L168 Benchmark]: TraceAbstraction took 275876.37 ms. Allocated memory was 205.5 MB in the beginning and 465.6 MB in the end (delta: 260.0 MB). Free memory was 139.0 MB in the beginning and 320.5 MB in the end (delta: -181.4 MB). Peak memory consumption was 78.6 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:06,377 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 709.91 ms. Allocated memory was 146.8 MB in the beginning and 205.5 MB in the end (delta: 58.7 MB). Free memory was 103.4 MB in the beginning and 162.8 MB in the end (delta: -59.4 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.25 ms. Allocated memory is still 205.5 MB. Free memory was 162.8 MB in the beginning and 160.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.50 ms. Allocated memory is still 205.5 MB. Free memory was 160.8 MB in the beginning and 159.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 413.51 ms. Allocated memory is still 205.5 MB. Free memory was 159.5 MB in the beginning and 139.7 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 275876.37 ms. Allocated memory was 205.5 MB in the beginning and 465.6 MB in the end (delta: 260.0 MB). Free memory was 139.0 MB in the beginning and 320.5 MB in the end (delta: -181.4 MB). Peak memory consumption was 78.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 712]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 712). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 19 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 1 error locations. Result: TIMEOUT, OverallTime: 275.7s, OverallIterations: 127, TraceHistogramMax: 7, AutomataDifference: 126.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6695 SDtfs, 60332 SDslu, 52267 SDs, 0 SdLazy, 9248 SolverSat, 3398 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9252 GetRequests, 5983 SyntacticMatches, 0 SemanticMatches, 3269 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14952 ImplicationChecksByTransitivity, 214.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1244occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 126 MinimizatonAttempts, 73577 StatesRemovedByMinimization, 126 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 106.7s InterpolantComputationTime, 10556 NumberOfCodeBlocks, 10556 NumberOfCodeBlocksAsserted, 470 NumberOfCheckSat, 10309 ConstructedInterpolants, 171 QuantifiedInterpolants, 4986019 SizeOfPredicates, 484 NumberOfNonLiveVariables, 13914 ConjunctsInSsa, 1567 ConjunctsInUnsatCore, 247 InterpolantComputations, 5 PerfectInterpolantSequences, 0/4252 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown