/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_longer-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:25:27,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:25:27,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:25:27,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:25:27,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:25:27,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:25:27,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:25:27,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:25:27,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:25:27,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:25:27,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:25:27,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:25:27,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:25:27,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:25:27,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:25:27,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:25:27,951 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:25:27,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:25:27,954 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:25:27,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:25:27,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:25:27,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:25:27,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:25:27,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:25:27,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:25:27,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:25:27,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:25:27,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:25:27,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:25:27,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:25:27,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:25:27,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:25:27,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:25:27,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:25:27,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:25:27,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:25:27,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:25:27,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:25:27,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:25:27,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:25:27,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:25:27,985 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,011 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:25:28,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:25:28,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:25:28,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:25:28,015 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:25:28,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:25:28,015 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:25:28,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:25:28,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:25:28,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:25:28,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:25:28,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:25:28,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:25:28,017 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:25:28,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:25:28,018 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:25:28,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:25:28,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:25:28,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:25:28,018 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:25:28,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:25:28,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:25:28,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:25:28,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:25:28,020 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:25:28,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:25:28,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:25:28,020 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:25:28,020 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 23:25:28,021 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:25:28,021 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:25:28,022 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,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:25:28,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:25:28,346 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:25:28,346 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:25:28,347 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_bench_longer-1.i [2019-12-27 23:25:28,416 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9112020c/c8490216e39546fc884028b05175a6cd/FLAGb039275d4 [2019-12-27 23:25:28,962 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:25:28,963 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_bench_longer-1.i [2019-12-27 23:25:28,986 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9112020c/c8490216e39546fc884028b05175a6cd/FLAGb039275d4 [2019-12-27 23:25:29,221 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9112020c/c8490216e39546fc884028b05175a6cd [2019-12-27 23:25:29,233 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:25:29,235 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:25:29,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:25:29,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:25:29,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:25:29,244 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,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74eb5d09 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,248 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,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:25:29,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:25:29,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:25:29,795 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:25:29,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:25:29,917 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:25:29,917 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,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:25:29,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:25:29,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:25:29,918 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:25:29,927 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:29,944 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:29,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:25:29,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:25:29,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:25:29,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:25:29,972 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:29,972 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:29,975 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:29,975 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:29,981 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:29,986 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:29,988 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:29,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:25:29,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:25:29,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:25:29,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:25:29,992 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,048 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 23:25:30,049 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 23:25:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 23:25:30,049 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 23:25:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:25:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 23:25:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:25:30,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:25:30,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 23:25:30,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:25:30,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:25:30,052 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,402 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:25:30,402 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 23:25:30,404 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,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:25:30,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:25:30,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:25:30,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:25:30,409 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,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1b3f1e 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,411 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,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1b3f1e 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,411 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,413 INFO L109 eAbstractionObserver]: Analyzing ICFG fib_bench_longer-1.i [2019-12-27 23:25:30,423 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:25:30,423 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:25:30,430 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 23:25:30,431 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:25:30,458 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,458 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,458 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,459 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,459 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,459 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,460 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,460 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,460 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,460 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,461 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,461 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,461 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,461 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,462 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,462 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,462 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,462 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,463 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,463 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,463 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,464 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,464 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,464 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,465 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,465 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,465 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,465 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,465 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,466 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,470 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,470 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,470 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,471 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,471 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,471 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,477 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,477 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,477 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,478 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,478 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,478 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:25:30,494 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-27 23:25:30,511 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:25:30,511 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:25:30,511 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:25:30,511 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:25:30,512 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:25:30,512 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:25:30,512 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:25:30,512 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:25:30,521 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 53 transitions [2019-12-27 23:25:30,606 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1244 states. [2019-12-27 23:25:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states. [2019-12-27 23:25:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 23:25:30,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:30,619 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,619 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:30,626 INFO L82 PathProgramCache]: Analyzing trace with hash 978645364, now seen corresponding path program 1 times [2019-12-27 23:25:30,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:30,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973462404] [2019-12-27 23:25:30,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:31,058 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,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973462404] [2019-12-27 23:25:31,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:25:31,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:25:31,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2110351758] [2019-12-27 23:25:31,062 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:31,069 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:31,093 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 20 transitions. [2019-12-27 23:25:31,094 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:31,098 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:25:31,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:25:31,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:31,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:25:31,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:25:31,116 INFO L87 Difference]: Start difference. First operand 1244 states. Second operand 5 states. [2019-12-27 23:25:31,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:31,328 INFO L93 Difference]: Finished difference Result 2093 states and 6041 transitions. [2019-12-27 23:25:31,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 23:25:31,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 23:25:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:31,362 INFO L225 Difference]: With dead ends: 2093 [2019-12-27 23:25:31,362 INFO L226 Difference]: Without dead ends: 572 [2019-12-27 23:25:31,366 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,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-12-27 23:25:31,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 460. [2019-12-27 23:25:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-12-27 23:25:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1179 transitions. [2019-12-27 23:25:31,467 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1179 transitions. Word has length 20 [2019-12-27 23:25:31,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:31,468 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 1179 transitions. [2019-12-27 23:25:31,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:25:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1179 transitions. [2019-12-27 23:25:31,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 23:25:31,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:31,470 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,470 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:31,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:31,471 INFO L82 PathProgramCache]: Analyzing trace with hash 2103912560, now seen corresponding path program 1 times [2019-12-27 23:25:31,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:31,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682492817] [2019-12-27 23:25:31,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:31,641 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,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682492817] [2019-12-27 23:25:31,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:25:31,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:25:31,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1855156308] [2019-12-27 23:25:31,642 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:31,645 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:31,648 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 24 transitions. [2019-12-27 23:25:31,649 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:31,649 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:25:31,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:25:31,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:31,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:25:31,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:25:31,652 INFO L87 Difference]: Start difference. First operand 460 states and 1179 transitions. Second operand 6 states. [2019-12-27 23:25:31,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:31,811 INFO L93 Difference]: Finished difference Result 908 states and 2257 transitions. [2019-12-27 23:25:31,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:25:31,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 23:25:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:31,818 INFO L225 Difference]: With dead ends: 908 [2019-12-27 23:25:31,818 INFO L226 Difference]: Without dead ends: 673 [2019-12-27 23:25:31,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:25:31,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-12-27 23:25:31,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 554. [2019-12-27 23:25:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-12-27 23:25:31,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1367 transitions. [2019-12-27 23:25:31,874 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1367 transitions. Word has length 24 [2019-12-27 23:25:31,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:31,874 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 1367 transitions. [2019-12-27 23:25:31,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:25:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1367 transitions. [2019-12-27 23:25:31,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 23:25:31,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:31,884 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:31,884 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:31,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:31,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1857069363, now seen corresponding path program 1 times [2019-12-27 23:25:31,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:31,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125627367] [2019-12-27 23:25:31,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:32,125 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,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125627367] [2019-12-27 23:25:32,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304150990] [2019-12-27 23:25:32,126 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,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:32,201 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 23:25:32,208 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:32,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:32,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:32,328 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,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:32,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-12-27 23:25:32,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [37900325] [2019-12-27 23:25:32,329 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:32,334 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:32,338 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 23:25:32,338 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:32,339 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:25:32,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:25:32,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:32,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:25:32,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:25:32,340 INFO L87 Difference]: Start difference. First operand 554 states and 1367 transitions. Second operand 7 states. [2019-12-27 23:25:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:32,569 INFO L93 Difference]: Finished difference Result 967 states and 2375 transitions. [2019-12-27 23:25:32,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:25:32,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 23:25:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:32,575 INFO L225 Difference]: With dead ends: 967 [2019-12-27 23:25:32,575 INFO L226 Difference]: Without dead ends: 753 [2019-12-27 23:25:32,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:32,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-12-27 23:25:32,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 586. [2019-12-27 23:25:32,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-12-27 23:25:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1443 transitions. [2019-12-27 23:25:32,604 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 1443 transitions. Word has length 28 [2019-12-27 23:25:32,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:32,604 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 1443 transitions. [2019-12-27 23:25:32,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:25:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 1443 transitions. [2019-12-27 23:25:32,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 23:25:32,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:32,606 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:32,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:32,810 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:32,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:32,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1304113332, now seen corresponding path program 1 times [2019-12-27 23:25:32,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:32,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925403672] [2019-12-27 23:25:32,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:32,991 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,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925403672] [2019-12-27 23:25:32,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:25:32,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:25:32,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2100723775] [2019-12-27 23:25:32,993 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:32,997 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:33,004 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 76 transitions. [2019-12-27 23:25:33,004 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:33,011 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:25:33,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:25:33,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:33,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:25:33,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:25:33,013 INFO L87 Difference]: Start difference. First operand 586 states and 1443 transitions. Second operand 7 states. [2019-12-27 23:25:33,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:33,159 INFO L93 Difference]: Finished difference Result 984 states and 2381 transitions. [2019-12-27 23:25:33,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:25:33,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 23:25:33,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:33,165 INFO L225 Difference]: With dead ends: 984 [2019-12-27 23:25:33,166 INFO L226 Difference]: Without dead ends: 835 [2019-12-27 23:25:33,166 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,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-12-27 23:25:33,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 653. [2019-12-27 23:25:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-12-27 23:25:33,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1575 transitions. [2019-12-27 23:25:33,187 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1575 transitions. Word has length 28 [2019-12-27 23:25:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:33,191 INFO L462 AbstractCegarLoop]: Abstraction has 653 states and 1575 transitions. [2019-12-27 23:25:33,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:25:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1575 transitions. [2019-12-27 23:25:33,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:25:33,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:33,195 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:33,204 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:33,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:33,205 INFO L82 PathProgramCache]: Analyzing trace with hash 960102518, now seen corresponding path program 2 times [2019-12-27 23:25:33,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:33,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277280903] [2019-12-27 23:25:33,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:33,415 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:33,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277280903] [2019-12-27 23:25:33,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236537484] [2019-12-27 23:25:33,416 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 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,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:25:33,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:33,487 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:25:33,490 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:33,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:33,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:33,576 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:33,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:33,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-12-27 23:25:33,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [77128002] [2019-12-27 23:25:33,577 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:33,580 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:33,584 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 32 transitions. [2019-12-27 23:25:33,585 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:33,585 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:25:33,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:25:33,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:33,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:25:33,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:25:33,586 INFO L87 Difference]: Start difference. First operand 653 states and 1575 transitions. Second operand 8 states. [2019-12-27 23:25:33,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:33,810 INFO L93 Difference]: Finished difference Result 1031 states and 2454 transitions. [2019-12-27 23:25:33,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:25:33,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 23:25:33,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:33,816 INFO L225 Difference]: With dead ends: 1031 [2019-12-27 23:25:33,816 INFO L226 Difference]: Without dead ends: 875 [2019-12-27 23:25:33,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:25:33,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-12-27 23:25:33,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 685. [2019-12-27 23:25:33,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-12-27 23:25:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1633 transitions. [2019-12-27 23:25:33,839 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1633 transitions. Word has length 32 [2019-12-27 23:25:33,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:33,841 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 1633 transitions. [2019-12-27 23:25:33,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:25:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1633 transitions. [2019-12-27 23:25:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:25:33,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:33,845 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:34,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:34,053 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:34,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:34,054 INFO L82 PathProgramCache]: Analyzing trace with hash 407146487, now seen corresponding path program 1 times [2019-12-27 23:25:34,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:34,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984452433] [2019-12-27 23:25:34,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:34,174 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:34,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984452433] [2019-12-27 23:25:34,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601850632] [2019-12-27 23:25:34,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:34,237 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:25:34,238 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:34,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:34,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:34,321 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:34,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:34,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-12-27 23:25:34,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [534028295] [2019-12-27 23:25:34,322 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:34,326 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:34,335 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 98 transitions. [2019-12-27 23:25:34,335 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:34,340 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:25:34,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:25:34,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:34,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:25:34,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:25:34,341 INFO L87 Difference]: Start difference. First operand 685 states and 1633 transitions. Second operand 8 states. [2019-12-27 23:25:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:34,532 INFO L93 Difference]: Finished difference Result 1022 states and 2436 transitions. [2019-12-27 23:25:34,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:25:34,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 23:25:34,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:34,538 INFO L225 Difference]: With dead ends: 1022 [2019-12-27 23:25:34,538 INFO L226 Difference]: Without dead ends: 915 [2019-12-27 23:25:34,539 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:34,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-12-27 23:25:34,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 693. [2019-12-27 23:25:34,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-12-27 23:25:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1662 transitions. [2019-12-27 23:25:34,561 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1662 transitions. Word has length 32 [2019-12-27 23:25:34,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:34,562 INFO L462 AbstractCegarLoop]: Abstraction has 693 states and 1662 transitions. [2019-12-27 23:25:34,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:25:34,562 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1662 transitions. [2019-12-27 23:25:34,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:25:34,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:34,563 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:34,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:34,767 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:34,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:34,768 INFO L82 PathProgramCache]: Analyzing trace with hash -729133039, now seen corresponding path program 1 times [2019-12-27 23:25:34,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:34,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758214800] [2019-12-27 23:25:34,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:34,895 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:34,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758214800] [2019-12-27 23:25:34,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920153043] [2019-12-27 23:25:34,896 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:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:34,958 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:25:34,960 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:35,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:35,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:35,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:35,038 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,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:35,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-12-27 23:25:35,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1459558341] [2019-12-27 23:25:35,039 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:35,042 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:35,054 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 128 transitions. [2019-12-27 23:25:35,054 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:35,059 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:25:35,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:25:35,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:35,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:25:35,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:25:35,060 INFO L87 Difference]: Start difference. First operand 693 states and 1662 transitions. Second operand 8 states. [2019-12-27 23:25:35,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:35,220 INFO L93 Difference]: Finished difference Result 1165 states and 2743 transitions. [2019-12-27 23:25:35,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:25:35,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 23:25:35,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:35,228 INFO L225 Difference]: With dead ends: 1165 [2019-12-27 23:25:35,228 INFO L226 Difference]: Without dead ends: 1016 [2019-12-27 23:25:35,229 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:35,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-12-27 23:25:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 742. [2019-12-27 23:25:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2019-12-27 23:25:35,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1764 transitions. [2019-12-27 23:25:35,251 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1764 transitions. Word has length 32 [2019-12-27 23:25:35,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:35,251 INFO L462 AbstractCegarLoop]: Abstraction has 742 states and 1764 transitions. [2019-12-27 23:25:35,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:25:35,251 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1764 transitions. [2019-12-27 23:25:35,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:25:35,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:35,253 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,456 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:35,457 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:35,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:35,458 INFO L82 PathProgramCache]: Analyzing trace with hash -719302009, now seen corresponding path program 2 times [2019-12-27 23:25:35,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:35,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848952085] [2019-12-27 23:25:35,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:35,566 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,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848952085] [2019-12-27 23:25:35,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932441181] [2019-12-27 23:25:35,567 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:35,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:25:35,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:35,635 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:25:35,637 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:35,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:35,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:35,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:35,733 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,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:35,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-12-27 23:25:35,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1826849134] [2019-12-27 23:25:35,735 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:35,738 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:35,749 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 122 transitions. [2019-12-27 23:25:35,749 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:35,752 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:25:35,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:25:35,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:35,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:25:35,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:25:35,754 INFO L87 Difference]: Start difference. First operand 742 states and 1764 transitions. Second operand 8 states. [2019-12-27 23:25:35,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:35,943 INFO L93 Difference]: Finished difference Result 1144 states and 2680 transitions. [2019-12-27 23:25:35,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:25:35,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 23:25:35,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:35,950 INFO L225 Difference]: With dead ends: 1144 [2019-12-27 23:25:35,950 INFO L226 Difference]: Without dead ends: 1037 [2019-12-27 23:25:35,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:25:35,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2019-12-27 23:25:35,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 754. [2019-12-27 23:25:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-27 23:25:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1791 transitions. [2019-12-27 23:25:35,976 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1791 transitions. Word has length 32 [2019-12-27 23:25:35,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:35,977 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1791 transitions. [2019-12-27 23:25:35,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:25:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1791 transitions. [2019-12-27 23:25:35,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:25:35,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:35,997 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,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:36,202 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:36,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:36,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1769924471, now seen corresponding path program 2 times [2019-12-27 23:25:36,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:36,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433142549] [2019-12-27 23:25:36,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:36,345 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,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433142549] [2019-12-27 23:25:36,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535211745] [2019-12-27 23:25:36,346 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 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,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:25:36,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:36,410 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:25:36,412 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:36,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:36,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:36,500 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,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:36,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-12-27 23:25:36,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1072672127] [2019-12-27 23:25:36,502 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:36,505 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:36,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 80 transitions. [2019-12-27 23:25:36,512 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:36,514 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:25:36,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:25:36,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:36,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:25:36,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:25:36,515 INFO L87 Difference]: Start difference. First operand 754 states and 1791 transitions. Second operand 8 states. [2019-12-27 23:25:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:36,723 INFO L93 Difference]: Finished difference Result 1144 states and 2680 transitions. [2019-12-27 23:25:36,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:25:36,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 23:25:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:36,730 INFO L225 Difference]: With dead ends: 1144 [2019-12-27 23:25:36,730 INFO L226 Difference]: Without dead ends: 1037 [2019-12-27 23:25:36,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:25:36,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2019-12-27 23:25:36,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 760. [2019-12-27 23:25:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-12-27 23:25:36,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1794 transitions. [2019-12-27 23:25:36,752 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1794 transitions. Word has length 32 [2019-12-27 23:25:36,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:36,752 INFO L462 AbstractCegarLoop]: Abstraction has 760 states and 1794 transitions. [2019-12-27 23:25:36,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:25:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1794 transitions. [2019-12-27 23:25:36,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 23:25:36,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:36,754 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:36,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:36,958 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:36,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:36,959 INFO L82 PathProgramCache]: Analyzing trace with hash -710146503, now seen corresponding path program 3 times [2019-12-27 23:25:36,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:36,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332372393] [2019-12-27 23:25:36,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:37,155 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:37,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332372393] [2019-12-27 23:25:37,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798333598] [2019-12-27 23:25:37,156 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 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,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:25:37,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:37,209 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:25:37,211 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:37,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:37,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:37,331 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:37,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:37,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-12-27 23:25:37,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1115524046] [2019-12-27 23:25:37,332 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:37,336 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:37,342 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 36 transitions. [2019-12-27 23:25:37,342 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:37,342 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:25:37,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:25:37,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:37,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:25:37,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:25:37,343 INFO L87 Difference]: Start difference. First operand 760 states and 1794 transitions. Second operand 9 states. [2019-12-27 23:25:37,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:37,575 INFO L93 Difference]: Finished difference Result 1291 states and 3023 transitions. [2019-12-27 23:25:37,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:25:37,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-27 23:25:37,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:37,583 INFO L225 Difference]: With dead ends: 1291 [2019-12-27 23:25:37,583 INFO L226 Difference]: Without dead ends: 1077 [2019-12-27 23:25:37,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:25:37,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-12-27 23:25:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 788. [2019-12-27 23:25:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-12-27 23:25:37,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1854 transitions. [2019-12-27 23:25:37,605 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1854 transitions. Word has length 36 [2019-12-27 23:25:37,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:37,605 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1854 transitions. [2019-12-27 23:25:37,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:25:37,606 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1854 transitions. [2019-12-27 23:25:37,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 23:25:37,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:37,607 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:37,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:37,810 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:37,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:37,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1263102534, now seen corresponding path program 3 times [2019-12-27 23:25:37,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:37,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153951629] [2019-12-27 23:25:37,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:37,919 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:37,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153951629] [2019-12-27 23:25:37,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018509121] [2019-12-27 23:25:37,920 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:37,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 23:25:37,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:37,976 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:25:37,978 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:38,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:38,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:38,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:38,195 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,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:38,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-12-27 23:25:38,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1805740355] [2019-12-27 23:25:38,198 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:38,202 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:38,216 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 126 transitions. [2019-12-27 23:25:38,217 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:38,218 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:25:38,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:25:38,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:38,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:25:38,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:25:38,219 INFO L87 Difference]: Start difference. First operand 788 states and 1854 transitions. Second operand 9 states. [2019-12-27 23:25:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:38,468 INFO L93 Difference]: Finished difference Result 1224 states and 2840 transitions. [2019-12-27 23:25:38,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:25:38,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-27 23:25:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:38,474 INFO L225 Difference]: With dead ends: 1224 [2019-12-27 23:25:38,475 INFO L226 Difference]: Without dead ends: 1117 [2019-12-27 23:25:38,475 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:38,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2019-12-27 23:25:38,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 788. [2019-12-27 23:25:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-12-27 23:25:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1854 transitions. [2019-12-27 23:25:38,497 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1854 transitions. Word has length 36 [2019-12-27 23:25:38,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:38,497 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1854 transitions. [2019-12-27 23:25:38,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:25:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1854 transitions. [2019-12-27 23:25:38,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 23:25:38,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:38,499 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:38,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:38,708 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:38,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:38,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1895585236, now seen corresponding path program 1 times [2019-12-27 23:25:38,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:38,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813595763] [2019-12-27 23:25:38,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:38,854 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:38,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813595763] [2019-12-27 23:25:38,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721639810] [2019-12-27 23:25:38,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:38,909 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:25:38,911 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:39,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:39,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:39,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:39,052 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:39,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:39,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-12-27 23:25:39,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [425034178] [2019-12-27 23:25:39,053 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:39,056 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:39,068 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 126 transitions. [2019-12-27 23:25:39,070 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:39,073 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:25:39,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:25:39,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:39,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:25:39,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:25:39,074 INFO L87 Difference]: Start difference. First operand 788 states and 1854 transitions. Second operand 9 states. [2019-12-27 23:25:39,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:39,326 INFO L93 Difference]: Finished difference Result 1264 states and 2920 transitions. [2019-12-27 23:25:39,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:25:39,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-27 23:25:39,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:39,333 INFO L225 Difference]: With dead ends: 1264 [2019-12-27 23:25:39,333 INFO L226 Difference]: Without dead ends: 1157 [2019-12-27 23:25:39,333 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:39,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2019-12-27 23:25:39,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 804. [2019-12-27 23:25:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2019-12-27 23:25:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1894 transitions. [2019-12-27 23:25:39,351 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1894 transitions. Word has length 36 [2019-12-27 23:25:39,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:39,352 INFO L462 AbstractCegarLoop]: Abstraction has 804 states and 1894 transitions. [2019-12-27 23:25:39,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:25:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1894 transitions. [2019-12-27 23:25:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 23:25:39,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:39,353 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:39,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:39,557 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:39,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:39,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1905416266, now seen corresponding path program 2 times [2019-12-27 23:25:39,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:39,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509268901] [2019-12-27 23:25:39,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:39,702 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:39,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509268901] [2019-12-27 23:25:39,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360629547] [2019-12-27 23:25:39,703 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 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,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:25:39,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:39,760 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:25:39,761 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:39,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:39,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:39,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:39,852 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:39,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:39,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-12-27 23:25:39,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2071468103] [2019-12-27 23:25:39,854 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:39,857 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:39,870 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 126 transitions. [2019-12-27 23:25:39,870 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:39,872 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:25:39,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:25:39,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:39,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:25:39,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:25:39,873 INFO L87 Difference]: Start difference. First operand 804 states and 1894 transitions. Second operand 9 states. [2019-12-27 23:25:40,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:40,122 INFO L93 Difference]: Finished difference Result 1252 states and 2900 transitions. [2019-12-27 23:25:40,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:25:40,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-27 23:25:40,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:40,128 INFO L225 Difference]: With dead ends: 1252 [2019-12-27 23:25:40,128 INFO L226 Difference]: Without dead ends: 1145 [2019-12-27 23:25:40,128 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:40,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2019-12-27 23:25:40,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 800. [2019-12-27 23:25:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-12-27 23:25:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1881 transitions. [2019-12-27 23:25:40,146 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1881 transitions. Word has length 36 [2019-12-27 23:25:40,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:40,147 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1881 transitions. [2019-12-27 23:25:40,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:25:40,147 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1881 transitions. [2019-12-27 23:25:40,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 23:25:40,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:40,148 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,352 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:40,353 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:40,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:40,354 INFO L82 PathProgramCache]: Analyzing trace with hash 365983982, now seen corresponding path program 3 times [2019-12-27 23:25:40,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:40,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246443794] [2019-12-27 23:25:40,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:40,499 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,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246443794] [2019-12-27 23:25:40,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886406968] [2019-12-27 23:25:40,500 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,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 23:25:40,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:40,557 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:25:40,558 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:40,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:40,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:40,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:40,670 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,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:40,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-12-27 23:25:40,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1682999096] [2019-12-27 23:25:40,671 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:40,675 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:40,690 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 109 states and 180 transitions. [2019-12-27 23:25:40,690 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:40,700 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 23:25:40,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:25:40,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:40,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:25:40,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:25:40,706 INFO L87 Difference]: Start difference. First operand 800 states and 1881 transitions. Second operand 9 states. [2019-12-27 23:25:40,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:40,946 INFO L93 Difference]: Finished difference Result 1306 states and 3025 transitions. [2019-12-27 23:25:40,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:25:40,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-27 23:25:40,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:40,957 INFO L225 Difference]: With dead ends: 1306 [2019-12-27 23:25:40,957 INFO L226 Difference]: Without dead ends: 1157 [2019-12-27 23:25:40,958 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:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2019-12-27 23:25:40,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 853. [2019-12-27 23:25:40,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-12-27 23:25:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1996 transitions. [2019-12-27 23:25:40,978 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1996 transitions. Word has length 36 [2019-12-27 23:25:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:40,978 INFO L462 AbstractCegarLoop]: Abstraction has 853 states and 1996 transitions. [2019-12-27 23:25:40,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:25:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1996 transitions. [2019-12-27 23:25:40,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 23:25:40,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:40,980 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:41,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:41,183 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:41,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:41,184 INFO L82 PathProgramCache]: Analyzing trace with hash 375815012, now seen corresponding path program 4 times [2019-12-27 23:25:41,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:41,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531279187] [2019-12-27 23:25:41,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:41,321 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,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531279187] [2019-12-27 23:25:41,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802763828] [2019-12-27 23:25:41,322 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:41,383 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:25:41,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:41,384 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:25:41,385 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:41,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:41,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:41,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:41,538 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,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:41,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-12-27 23:25:41,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [680669829] [2019-12-27 23:25:41,539 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:41,545 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:41,563 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 174 transitions. [2019-12-27 23:25:41,564 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:41,567 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:25:41,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:25:41,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:41,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:25:41,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:25:41,568 INFO L87 Difference]: Start difference. First operand 853 states and 1996 transitions. Second operand 9 states. [2019-12-27 23:25:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:41,867 INFO L93 Difference]: Finished difference Result 1365 states and 3122 transitions. [2019-12-27 23:25:41,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:25:41,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-27 23:25:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:41,874 INFO L225 Difference]: With dead ends: 1365 [2019-12-27 23:25:41,874 INFO L226 Difference]: Without dead ends: 1258 [2019-12-27 23:25:41,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:25:41,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-12-27 23:25:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 849. [2019-12-27 23:25:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-12-27 23:25:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1983 transitions. [2019-12-27 23:25:41,941 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1983 transitions. Word has length 36 [2019-12-27 23:25:41,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:41,941 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1983 transitions. [2019-12-27 23:25:41,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:25:41,941 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1983 transitions. [2019-12-27 23:25:41,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 23:25:41,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:41,943 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,146 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:42,147 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:42,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:42,148 INFO L82 PathProgramCache]: Analyzing trace with hash 699135054, now seen corresponding path program 3 times [2019-12-27 23:25:42,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:42,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085458231] [2019-12-27 23:25:42,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:42,424 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,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085458231] [2019-12-27 23:25:42,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164438305] [2019-12-27 23:25:42,426 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 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:42,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 23:25:42,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:42,495 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:25:42,497 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:42,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:42,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:42,613 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,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:42,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-12-27 23:25:42,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1392212725] [2019-12-27 23:25:42,614 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:42,618 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:42,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 150 transitions. [2019-12-27 23:25:42,632 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:42,637 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:25:42,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:25:42,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:42,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:25:42,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:25:42,638 INFO L87 Difference]: Start difference. First operand 849 states and 1983 transitions. Second operand 9 states. [2019-12-27 23:25:42,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:42,902 INFO L93 Difference]: Finished difference Result 1405 states and 3202 transitions. [2019-12-27 23:25:42,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:25:42,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-27 23:25:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:42,910 INFO L225 Difference]: With dead ends: 1405 [2019-12-27 23:25:42,910 INFO L226 Difference]: Without dead ends: 1298 [2019-12-27 23:25:42,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:25:42,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2019-12-27 23:25:42,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 865. [2019-12-27 23:25:42,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-12-27 23:25:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 2023 transitions. [2019-12-27 23:25:42,934 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 2023 transitions. Word has length 36 [2019-12-27 23:25:42,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:42,935 INFO L462 AbstractCegarLoop]: Abstraction has 865 states and 2023 transitions. [2019-12-27 23:25:42,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:25:42,935 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 2023 transitions. [2019-12-27 23:25:42,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 23:25:42,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:42,937 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:43,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:43,141 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:43,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:43,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1152256164, now seen corresponding path program 4 times [2019-12-27 23:25:43,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:43,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729764194] [2019-12-27 23:25:43,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:43,266 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:43,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729764194] [2019-12-27 23:25:43,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994204554] [2019-12-27 23:25:43,267 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 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:43,319 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:25:43,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:43,320 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:25:43,321 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:43,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:43,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:43,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:43,430 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:43,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:43,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-12-27 23:25:43,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [10837076] [2019-12-27 23:25:43,431 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:43,434 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:43,449 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 150 transitions. [2019-12-27 23:25:43,449 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:43,452 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:25:43,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:25:43,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:43,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:25:43,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:25:43,453 INFO L87 Difference]: Start difference. First operand 865 states and 2023 transitions. Second operand 9 states. [2019-12-27 23:25:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:43,730 INFO L93 Difference]: Finished difference Result 1346 states and 3084 transitions. [2019-12-27 23:25:43,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:25:43,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-27 23:25:43,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:43,735 INFO L225 Difference]: With dead ends: 1346 [2019-12-27 23:25:43,735 INFO L226 Difference]: Without dead ends: 1239 [2019-12-27 23:25:43,736 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:43,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2019-12-27 23:25:43,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 867. [2019-12-27 23:25:43,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2019-12-27 23:25:43,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 2013 transitions. [2019-12-27 23:25:43,754 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 2013 transitions. Word has length 36 [2019-12-27 23:25:43,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:43,754 INFO L462 AbstractCegarLoop]: Abstraction has 867 states and 2013 transitions. [2019-12-27 23:25:43,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:25:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 2013 transitions. [2019-12-27 23:25:43,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:43,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:43,756 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:43,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:43,959 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:43,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:43,960 INFO L82 PathProgramCache]: Analyzing trace with hash 978285180, now seen corresponding path program 4 times [2019-12-27 23:25:43,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:43,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421253970] [2019-12-27 23:25:43,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:44,102 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:44,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421253970] [2019-12-27 23:25:44,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513923605] [2019-12-27 23:25:44,103 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:44,153 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:25:44,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:44,154 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:44,154 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:44,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:44,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:44,247 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:44,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:44,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:44,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1743681316] [2019-12-27 23:25:44,248 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:44,252 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:44,258 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 40 transitions. [2019-12-27 23:25:44,258 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:44,259 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:25:44,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:44,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:44,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:44,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:44,260 INFO L87 Difference]: Start difference. First operand 867 states and 2013 transitions. Second operand 10 states. [2019-12-27 23:25:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:44,531 INFO L93 Difference]: Finished difference Result 1453 states and 3347 transitions. [2019-12-27 23:25:44,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:25:44,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:44,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:44,539 INFO L225 Difference]: With dead ends: 1453 [2019-12-27 23:25:44,539 INFO L226 Difference]: Without dead ends: 1239 [2019-12-27 23:25:44,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:25:44,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2019-12-27 23:25:44,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 895. [2019-12-27 23:25:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-27 23:25:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 2073 transitions. [2019-12-27 23:25:44,560 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 2073 transitions. Word has length 40 [2019-12-27 23:25:44,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:44,560 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 2073 transitions. [2019-12-27 23:25:44,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:44,560 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2073 transitions. [2019-12-27 23:25:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:44,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:44,562 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:44,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:44,765 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:44,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:44,766 INFO L82 PathProgramCache]: Analyzing trace with hash 425329149, now seen corresponding path program 4 times [2019-12-27 23:25:44,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:44,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89772472] [2019-12-27 23:25:44,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:44,885 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:44,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89772472] [2019-12-27 23:25:44,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474773698] [2019-12-27 23:25:44,886 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 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,933 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:25:44,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:44,934 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:44,935 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:47,504 WARN L192 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-12-27 23:25:47,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:47,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:47,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:47,522 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,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:47,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:47,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1749580542] [2019-12-27 23:25:47,523 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:47,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:47,543 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 154 transitions. [2019-12-27 23:25:47,543 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:47,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:25:47,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:47,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:47,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:47,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=183, Unknown=1, NotChecked=0, Total=240 [2019-12-27 23:25:47,545 INFO L87 Difference]: Start difference. First operand 895 states and 2073 transitions. Second operand 10 states. [2019-12-27 23:25:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:48,352 INFO L93 Difference]: Finished difference Result 1426 states and 3244 transitions. [2019-12-27 23:25:48,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:25:48,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:48,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:48,361 INFO L225 Difference]: With dead ends: 1426 [2019-12-27 23:25:48,361 INFO L226 Difference]: Without dead ends: 1319 [2019-12-27 23:25:48,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=146, Invalid=404, Unknown=2, NotChecked=0, Total=552 [2019-12-27 23:25:48,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-12-27 23:25:48,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 895. [2019-12-27 23:25:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-27 23:25:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 2073 transitions. [2019-12-27 23:25:48,382 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 2073 transitions. Word has length 40 [2019-12-27 23:25:48,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:48,383 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 2073 transitions. [2019-12-27 23:25:48,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2073 transitions. [2019-12-27 23:25:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:48,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:48,385 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:48,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:48,587 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:48,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:48,588 INFO L82 PathProgramCache]: Analyzing trace with hash -710950377, now seen corresponding path program 5 times [2019-12-27 23:25:48,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:48,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037592005] [2019-12-27 23:25:48,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:48,743 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:48,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037592005] [2019-12-27 23:25:48,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845238934] [2019-12-27 23:25:48,744 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 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:48,811 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 23:25:48,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:48,812 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:48,813 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:48,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:48,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:48,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:48,998 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:48,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:48,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:48,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [924085205] [2019-12-27 23:25:48,998 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:49,003 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:49,022 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 154 transitions. [2019-12-27 23:25:49,022 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:49,023 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:25:49,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:49,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:49,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:49,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:49,025 INFO L87 Difference]: Start difference. First operand 895 states and 2073 transitions. Second operand 10 states. [2019-12-27 23:25:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:49,337 INFO L93 Difference]: Finished difference Result 1485 states and 3362 transitions. [2019-12-27 23:25:49,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:25:49,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:49,341 INFO L225 Difference]: With dead ends: 1485 [2019-12-27 23:25:49,342 INFO L226 Difference]: Without dead ends: 1378 [2019-12-27 23:25:49,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:25:49,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2019-12-27 23:25:49,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 911. [2019-12-27 23:25:49,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2019-12-27 23:25:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 2113 transitions. [2019-12-27 23:25:49,362 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 2113 transitions. Word has length 40 [2019-12-27 23:25:49,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:49,363 INFO L462 AbstractCegarLoop]: Abstraction has 911 states and 2113 transitions. [2019-12-27 23:25:49,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:49,363 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 2113 transitions. [2019-12-27 23:25:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:49,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:49,364 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:49,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:49,568 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:49,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:49,569 INFO L82 PathProgramCache]: Analyzing trace with hash -701119347, now seen corresponding path program 6 times [2019-12-27 23:25:49,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:49,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006874925] [2019-12-27 23:25:49,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:49,698 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:49,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006874925] [2019-12-27 23:25:49,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383464709] [2019-12-27 23:25:49,699 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 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:49,743 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 23:25:49,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:49,744 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:49,745 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:49,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:49,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:49,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:49,931 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:49,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:49,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:49,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1455279065] [2019-12-27 23:25:49,932 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:49,936 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:49,954 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 154 transitions. [2019-12-27 23:25:49,955 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:49,956 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:25:49,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:49,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:49,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:49,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:49,958 INFO L87 Difference]: Start difference. First operand 911 states and 2113 transitions. Second operand 10 states. [2019-12-27 23:25:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:50,329 INFO L93 Difference]: Finished difference Result 1473 states and 3342 transitions. [2019-12-27 23:25:50,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:25:50,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:50,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:50,332 INFO L225 Difference]: With dead ends: 1473 [2019-12-27 23:25:50,333 INFO L226 Difference]: Without dead ends: 1366 [2019-12-27 23:25:50,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:25:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-12-27 23:25:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 895. [2019-12-27 23:25:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-27 23:25:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 2073 transitions. [2019-12-27 23:25:50,354 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 2073 transitions. Word has length 40 [2019-12-27 23:25:50,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:50,355 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 2073 transitions. [2019-12-27 23:25:50,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:50,355 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2073 transitions. [2019-12-27 23:25:50,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:50,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:50,357 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:50,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:50,560 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:50,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:50,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2054415665, now seen corresponding path program 7 times [2019-12-27 23:25:50,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:50,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888023650] [2019-12-27 23:25:50,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:50,683 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:50,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888023650] [2019-12-27 23:25:50,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835377724] [2019-12-27 23:25:50,684 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 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:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:50,739 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:50,740 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:50,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:50,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:50,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:50,860 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:50,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:50,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:50,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [264879193] [2019-12-27 23:25:50,861 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:50,865 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:50,881 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 154 transitions. [2019-12-27 23:25:50,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:50,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:25:50,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:50,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:50,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:50,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:50,884 INFO L87 Difference]: Start difference. First operand 895 states and 2073 transitions. Second operand 10 states. [2019-12-27 23:25:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:51,196 INFO L93 Difference]: Finished difference Result 1504 states and 3400 transitions. [2019-12-27 23:25:51,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:25:51,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:51,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:51,200 INFO L225 Difference]: With dead ends: 1504 [2019-12-27 23:25:51,200 INFO L226 Difference]: Without dead ends: 1397 [2019-12-27 23:25:51,201 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:51,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2019-12-27 23:25:51,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 927. [2019-12-27 23:25:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-12-27 23:25:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2153 transitions. [2019-12-27 23:25:51,222 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2153 transitions. Word has length 40 [2019-12-27 23:25:51,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:51,223 INFO L462 AbstractCegarLoop]: Abstraction has 927 states and 2153 transitions. [2019-12-27 23:25:51,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2153 transitions. [2019-12-27 23:25:51,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:51,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:51,225 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,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:51,428 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:51,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:51,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2064246695, now seen corresponding path program 8 times [2019-12-27 23:25:51,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:51,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256814884] [2019-12-27 23:25:51,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:51,565 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,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256814884] [2019-12-27 23:25:51,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936511238] [2019-12-27 23:25:51,566 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 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:51,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:25:51,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:51,612 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:51,613 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:53,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:53,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:53,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:53,053 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,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:53,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:53,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [918497670] [2019-12-27 23:25:53,054 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:53,059 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:53,075 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 154 transitions. [2019-12-27 23:25:53,075 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:53,077 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:25:53,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:53,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:53,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:53,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=184, Unknown=1, NotChecked=0, Total=240 [2019-12-27 23:25:53,078 INFO L87 Difference]: Start difference. First operand 927 states and 2153 transitions. Second operand 10 states. [2019-12-27 23:25:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:54,252 INFO L93 Difference]: Finished difference Result 1442 states and 3284 transitions. [2019-12-27 23:25:54,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:25:54,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:54,255 INFO L225 Difference]: With dead ends: 1442 [2019-12-27 23:25:54,255 INFO L226 Difference]: Without dead ends: 1335 [2019-12-27 23:25:54,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=166, Invalid=482, Unknown=2, NotChecked=0, Total=650 [2019-12-27 23:25:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-12-27 23:25:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 911. [2019-12-27 23:25:54,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2019-12-27 23:25:54,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 2113 transitions. [2019-12-27 23:25:54,276 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 2113 transitions. Word has length 40 [2019-12-27 23:25:54,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:54,277 INFO L462 AbstractCegarLoop]: Abstraction has 911 states and 2113 transitions. [2019-12-27 23:25:54,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:54,277 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 2113 transitions. [2019-12-27 23:25:54,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:54,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:54,279 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:54,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:54,482 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:54,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:54,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1907400559, now seen corresponding path program 9 times [2019-12-27 23:25:54,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:54,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058407664] [2019-12-27 23:25:54,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:54,625 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,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058407664] [2019-12-27 23:25:54,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328709015] [2019-12-27 23:25:54,626 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 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:54,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 23:25:54,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:54,693 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:54,694 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:54,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:54,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:54,858 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,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:54,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:54,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [258496961] [2019-12-27 23:25:54,859 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:54,867 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:54,888 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 154 transitions. [2019-12-27 23:25:54,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:54,891 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:25:54,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:54,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:54,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:54,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:54,892 INFO L87 Difference]: Start difference. First operand 911 states and 2113 transitions. Second operand 10 states. [2019-12-27 23:25:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:55,312 INFO L93 Difference]: Finished difference Result 1534 states and 3464 transitions. [2019-12-27 23:25:55,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:25:55,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:55,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:55,323 INFO L225 Difference]: With dead ends: 1534 [2019-12-27 23:25:55,323 INFO L226 Difference]: Without dead ends: 1427 [2019-12-27 23:25:55,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:25:55,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-12-27 23:25:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 927. [2019-12-27 23:25:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-12-27 23:25:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2153 transitions. [2019-12-27 23:25:55,344 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2153 transitions. Word has length 40 [2019-12-27 23:25:55,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:55,345 INFO L462 AbstractCegarLoop]: Abstraction has 927 states and 2153 transitions. [2019-12-27 23:25:55,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:55,345 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2153 transitions. [2019-12-27 23:25:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:55,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:55,348 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:55,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:55,549 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:55,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:55,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1454279449, now seen corresponding path program 10 times [2019-12-27 23:25:55,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:55,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620418797] [2019-12-27 23:25:55,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:55,694 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:55,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620418797] [2019-12-27 23:25:55,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368520283] [2019-12-27 23:25:55,694 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 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:55,741 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:25:55,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:55,742 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:55,743 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:55,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:55,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:55,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:55,862 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:55,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:55,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:55,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [78984129] [2019-12-27 23:25:55,863 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:55,867 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:55,883 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 154 transitions. [2019-12-27 23:25:55,883 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:55,885 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:25:55,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:55,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:55,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:55,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:55,886 INFO L87 Difference]: Start difference. First operand 927 states and 2153 transitions. Second operand 10 states. [2019-12-27 23:25:56,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:56,197 INFO L93 Difference]: Finished difference Result 1482 states and 3364 transitions. [2019-12-27 23:25:56,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:25:56,202 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:56,206 INFO L225 Difference]: With dead ends: 1482 [2019-12-27 23:25:56,206 INFO L226 Difference]: Without dead ends: 1375 [2019-12-27 23:25:56,207 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:56,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2019-12-27 23:25:56,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 907. [2019-12-27 23:25:56,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-12-27 23:25:56,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 2100 transitions. [2019-12-27 23:25:56,227 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 2100 transitions. Word has length 40 [2019-12-27 23:25:56,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:56,227 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 2100 transitions. [2019-12-27 23:25:56,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:56,227 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 2100 transitions. [2019-12-27 23:25:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:56,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:56,229 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:56,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:56,433 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:56,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:56,433 INFO L82 PathProgramCache]: Analyzing trace with hash -2081625269, now seen corresponding path program 5 times [2019-12-27 23:25:56,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:56,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377476181] [2019-12-27 23:25:56,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:56,571 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:56,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377476181] [2019-12-27 23:25:56,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662367098] [2019-12-27 23:25:56,572 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 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:56,618 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 23:25:56,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:56,619 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:56,619 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:56,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:56,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:56,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:56,736 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:56,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:56,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:56,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1896381776] [2019-12-27 23:25:56,736 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:56,741 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:56,759 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 232 transitions. [2019-12-27 23:25:56,759 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:56,763 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 23:25:56,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:56,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:56,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:56,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:56,764 INFO L87 Difference]: Start difference. First operand 907 states and 2100 transitions. Second operand 10 states. [2019-12-27 23:25:57,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:57,056 INFO L93 Difference]: Finished difference Result 1475 states and 3367 transitions. [2019-12-27 23:25:57,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:25:57,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:57,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:57,059 INFO L225 Difference]: With dead ends: 1475 [2019-12-27 23:25:57,059 INFO L226 Difference]: Without dead ends: 1326 [2019-12-27 23:25:57,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:25:57,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-12-27 23:25:57,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 964. [2019-12-27 23:25:57,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-12-27 23:25:57,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 2228 transitions. [2019-12-27 23:25:57,080 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 2228 transitions. Word has length 40 [2019-12-27 23:25:57,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:57,080 INFO L462 AbstractCegarLoop]: Abstraction has 964 states and 2228 transitions. [2019-12-27 23:25:57,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 2228 transitions. [2019-12-27 23:25:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:57,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:57,082 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:57,285 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:57,285 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:57,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:57,286 INFO L82 PathProgramCache]: Analyzing trace with hash -2071794239, now seen corresponding path program 6 times [2019-12-27 23:25:57,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:57,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224183800] [2019-12-27 23:25:57,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:57,425 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:57,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224183800] [2019-12-27 23:25:57,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724756137] [2019-12-27 23:25:57,426 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 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:57,473 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 23:25:57,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:57,474 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:25:57,475 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:57,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:57,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:57,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:57,600 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:57,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:57,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:57,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1320511431] [2019-12-27 23:25:57,601 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:57,606 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:57,626 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 226 transitions. [2019-12-27 23:25:57,626 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:57,630 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 23:25:57,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:57,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:57,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:57,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:57,631 INFO L87 Difference]: Start difference. First operand 964 states and 2228 transitions. Second operand 10 states. [2019-12-27 23:25:57,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:57,990 INFO L93 Difference]: Finished difference Result 1546 states and 3484 transitions. [2019-12-27 23:25:57,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:25:57,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:57,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:57,992 INFO L225 Difference]: With dead ends: 1546 [2019-12-27 23:25:57,993 INFO L226 Difference]: Without dead ends: 1439 [2019-12-27 23:25:57,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:25:57,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2019-12-27 23:25:58,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 960. [2019-12-27 23:25:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-12-27 23:25:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 2215 transitions. [2019-12-27 23:25:58,014 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 2215 transitions. Word has length 40 [2019-12-27 23:25:58,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:58,014 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 2215 transitions. [2019-12-27 23:25:58,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 2215 transitions. [2019-12-27 23:25:58,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:58,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:58,016 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:58,220 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:58,220 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:58,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:58,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1748474197, now seen corresponding path program 11 times [2019-12-27 23:25:58,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:58,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129392737] [2019-12-27 23:25:58,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:58,352 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:58,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129392737] [2019-12-27 23:25:58,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837364130] [2019-12-27 23:25:58,352 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 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:58,400 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 23:25:58,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:58,402 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:58,403 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:58,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:58,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:58,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:58,620 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:58,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:58,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:58,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [348692309] [2019-12-27 23:25:58,620 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:58,624 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:58,639 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 202 transitions. [2019-12-27 23:25:58,639 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:58,642 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 23:25:58,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:58,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:58,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:58,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:58,643 INFO L87 Difference]: Start difference. First operand 960 states and 2215 transitions. Second operand 10 states. [2019-12-27 23:25:59,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:59,013 INFO L93 Difference]: Finished difference Result 1607 states and 3606 transitions. [2019-12-27 23:25:59,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:25:59,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:59,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:59,015 INFO L225 Difference]: With dead ends: 1607 [2019-12-27 23:25:59,016 INFO L226 Difference]: Without dead ends: 1500 [2019-12-27 23:25:59,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 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:25:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2019-12-27 23:25:59,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 976. [2019-12-27 23:25:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-12-27 23:25:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 2255 transitions. [2019-12-27 23:25:59,035 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 2255 transitions. Word has length 40 [2019-12-27 23:25:59,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:59,036 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 2255 transitions. [2019-12-27 23:25:59,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 2255 transitions. [2019-12-27 23:25:59,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:59,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:59,038 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,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:25:59,241 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:25:59,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:25:59,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1295353087, now seen corresponding path program 12 times [2019-12-27 23:25:59,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:25:59,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230675111] [2019-12-27 23:25:59,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:25:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:25:59,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:59,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230675111] [2019-12-27 23:25:59,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170402085] [2019-12-27 23:25:59,379 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 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:59,424 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 23:25:59,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:25:59,424 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:25:59,425 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:25:59,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:59,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:59,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:25:59,554 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,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:25:59,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:25:59,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1345429891] [2019-12-27 23:25:59,555 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:25:59,558 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:25:59,573 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 202 transitions. [2019-12-27 23:25:59,573 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:25:59,576 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 23:25:59,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:25:59,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:25:59,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:25:59,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:25:59,576 INFO L87 Difference]: Start difference. First operand 976 states and 2255 transitions. Second operand 10 states. [2019-12-27 23:25:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:25:59,913 INFO L93 Difference]: Finished difference Result 1595 states and 3586 transitions. [2019-12-27 23:25:59,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:25:59,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:25:59,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:25:59,915 INFO L225 Difference]: With dead ends: 1595 [2019-12-27 23:25:59,915 INFO L226 Difference]: Without dead ends: 1488 [2019-12-27 23:25:59,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:25:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-12-27 23:25:59,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 956. [2019-12-27 23:25:59,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-12-27 23:25:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2202 transitions. [2019-12-27 23:25:59,959 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2202 transitions. Word has length 40 [2019-12-27 23:25:59,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:25:59,959 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2202 transitions. [2019-12-27 23:25:59,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:25:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2202 transitions. [2019-12-27 23:25:59,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:25:59,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:25:59,961 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,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:00,164 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:00,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:00,165 INFO L82 PathProgramCache]: Analyzing trace with hash -52709717, now seen corresponding path program 13 times [2019-12-27 23:26:00,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:00,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434203940] [2019-12-27 23:26:00,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:00,298 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,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434203940] [2019-12-27 23:26:00,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251477489] [2019-12-27 23:26:00,299 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 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:26:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:00,342 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:26:00,343 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:00,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:00,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:00,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:00,477 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,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:00,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:26:00,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2056451307] [2019-12-27 23:26:00,479 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:00,483 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:00,503 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 178 transitions. [2019-12-27 23:26:00,504 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:00,507 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:26:00,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:26:00,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:00,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:26:00,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:26:00,508 INFO L87 Difference]: Start difference. First operand 956 states and 2202 transitions. Second operand 10 states. [2019-12-27 23:26:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:00,865 INFO L93 Difference]: Finished difference Result 1647 states and 3686 transitions. [2019-12-27 23:26:00,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:00,865 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:26:00,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:00,867 INFO L225 Difference]: With dead ends: 1647 [2019-12-27 23:26:00,867 INFO L226 Difference]: Without dead ends: 1540 [2019-12-27 23:26:00,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 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:00,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2019-12-27 23:26:00,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 988. [2019-12-27 23:26:00,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-12-27 23:26:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 2282 transitions. [2019-12-27 23:26:00,886 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 2282 transitions. Word has length 40 [2019-12-27 23:26:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:00,887 INFO L462 AbstractCegarLoop]: Abstraction has 988 states and 2282 transitions. [2019-12-27 23:26:00,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:26:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 2282 transitions. [2019-12-27 23:26:00,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:26:00,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:00,890 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:01,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:01,093 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:01,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:01,093 INFO L82 PathProgramCache]: Analyzing trace with hash -42878687, now seen corresponding path program 14 times [2019-12-27 23:26:01,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:01,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406619570] [2019-12-27 23:26:01,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:01,227 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,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406619570] [2019-12-27 23:26:01,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446525993] [2019-12-27 23:26:01,227 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 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:26:01,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:26:01,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:01,273 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:26:01,274 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:01,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:01,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:01,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:01,384 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,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:01,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:26:01,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1818057708] [2019-12-27 23:26:01,385 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:01,389 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:01,409 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 178 transitions. [2019-12-27 23:26:01,409 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:01,412 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:26:01,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:26:01,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:01,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:26:01,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:26:01,413 INFO L87 Difference]: Start difference. First operand 988 states and 2282 transitions. Second operand 10 states. [2019-12-27 23:26:01,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:01,901 INFO L93 Difference]: Finished difference Result 1675 states and 3746 transitions. [2019-12-27 23:26:01,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:01,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:26:01,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:01,905 INFO L225 Difference]: With dead ends: 1675 [2019-12-27 23:26:01,905 INFO L226 Difference]: Without dead ends: 1568 [2019-12-27 23:26:01,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2019-12-27 23:26:01,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2019-12-27 23:26:01,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 972. [2019-12-27 23:26:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-12-27 23:26:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 2242 transitions. [2019-12-27 23:26:01,935 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 2242 transitions. Word has length 40 [2019-12-27 23:26:01,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:01,936 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 2242 transitions. [2019-12-27 23:26:01,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:26:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 2242 transitions. [2019-12-27 23:26:01,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:26:01,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:01,939 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,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:02,144 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:02,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash 285692907, now seen corresponding path program 15 times [2019-12-27 23:26:02,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:02,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893165537] [2019-12-27 23:26:02,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:02,358 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,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893165537] [2019-12-27 23:26:02,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679734528] [2019-12-27 23:26:02,359 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 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:26:02,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 23:26:02,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:02,477 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:26:02,478 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:02,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:02,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:02,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:02,733 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,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:02,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:26:02,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [112555874] [2019-12-27 23:26:02,735 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:02,744 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:02,775 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 178 transitions. [2019-12-27 23:26:02,776 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:02,779 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:26:02,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:26:02,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:02,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:26:02,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:26:02,781 INFO L87 Difference]: Start difference. First operand 972 states and 2242 transitions. Second operand 10 states. [2019-12-27 23:26:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:03,179 INFO L93 Difference]: Finished difference Result 1647 states and 3686 transitions. [2019-12-27 23:26:03,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:03,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:26:03,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:03,182 INFO L225 Difference]: With dead ends: 1647 [2019-12-27 23:26:03,182 INFO L226 Difference]: Without dead ends: 1540 [2019-12-27 23:26:03,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2019-12-27 23:26:03,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2019-12-27 23:26:03,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 988. [2019-12-27 23:26:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-12-27 23:26:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 2282 transitions. [2019-12-27 23:26:03,196 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 2282 transitions. Word has length 40 [2019-12-27 23:26:03,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:03,196 INFO L462 AbstractCegarLoop]: Abstraction has 988 states and 2282 transitions. [2019-12-27 23:26:03,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:26:03,196 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 2282 transitions. [2019-12-27 23:26:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 23:26:03,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:03,198 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,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:03,399 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:03,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:03,400 INFO L82 PathProgramCache]: Analyzing trace with hash 738814017, now seen corresponding path program 16 times [2019-12-27 23:26:03,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:03,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671921921] [2019-12-27 23:26:03,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:03,515 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,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671921921] [2019-12-27 23:26:03,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081420895] [2019-12-27 23:26:03,516 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 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:03,562 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:26:03,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:03,562 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:26:03,563 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:03,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:03,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:03,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:03,678 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,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:03,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-12-27 23:26:03,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1085929910] [2019-12-27 23:26:03,678 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:03,682 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:03,697 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 178 transitions. [2019-12-27 23:26:03,697 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:03,699 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:26:03,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:26:03,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:03,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:26:03,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:26:03,700 INFO L87 Difference]: Start difference. First operand 988 states and 2282 transitions. Second operand 10 states. [2019-12-27 23:26:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:04,023 INFO L93 Difference]: Finished difference Result 1548 states and 3488 transitions. [2019-12-27 23:26:04,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:04,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 23:26:04,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:04,026 INFO L225 Difference]: With dead ends: 1548 [2019-12-27 23:26:04,026 INFO L226 Difference]: Without dead ends: 1441 [2019-12-27 23:26:04,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2019-12-27 23:26:04,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2019-12-27 23:26:04,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 974. [2019-12-27 23:26:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-12-27 23:26:04,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 2232 transitions. [2019-12-27 23:26:04,038 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 2232 transitions. Word has length 40 [2019-12-27 23:26:04,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:04,038 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 2232 transitions. [2019-12-27 23:26:04,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:26:04,038 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 2232 transitions. [2019-12-27 23:26:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:04,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:04,040 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:04,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:04,242 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:04,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:04,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1962080961, now seen corresponding path program 5 times [2019-12-27 23:26:04,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:04,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459613242] [2019-12-27 23:26:04,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:04,428 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:04,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459613242] [2019-12-27 23:26:04,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330618651] [2019-12-27 23:26:04,429 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 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:04,508 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-12-27 23:26:04,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:04,510 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:04,511 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:04,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:04,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:04,717 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:04,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:04,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:04,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1797094899] [2019-12-27 23:26:04,719 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:04,724 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:04,737 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 44 transitions. [2019-12-27 23:26:04,737 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:04,737 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:26:04,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:04,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:04,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:04,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:04,741 INFO L87 Difference]: Start difference. First operand 974 states and 2232 transitions. Second operand 11 states. [2019-12-27 23:26:05,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:05,169 INFO L93 Difference]: Finished difference Result 1615 states and 3671 transitions. [2019-12-27 23:26:05,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:26:05,170 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:05,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:05,173 INFO L225 Difference]: With dead ends: 1615 [2019-12-27 23:26:05,173 INFO L226 Difference]: Without dead ends: 1401 [2019-12-27 23:26:05,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2019-12-27 23:26:05,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2019-12-27 23:26:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1002. [2019-12-27 23:26:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-12-27 23:26:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 2292 transitions. [2019-12-27 23:26:05,195 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 2292 transitions. Word has length 44 [2019-12-27 23:26:05,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:05,196 INFO L462 AbstractCegarLoop]: Abstraction has 1002 states and 2292 transitions. [2019-12-27 23:26:05,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 2292 transitions. [2019-12-27 23:26:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:05,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:05,199 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:05,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:05,405 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:05,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:05,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1779930304, now seen corresponding path program 5 times [2019-12-27 23:26:05,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:05,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191385923] [2019-12-27 23:26:05,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:05,554 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:05,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191385923] [2019-12-27 23:26:05,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708650861] [2019-12-27 23:26:05,555 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 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:05,609 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-27 23:26:05,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:05,610 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:05,611 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:07,321 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-12-27 23:26:07,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:07,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:07,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:07,331 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,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:07,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:07,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1115025550] [2019-12-27 23:26:07,331 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:07,336 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:07,354 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:07,354 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:07,355 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:26:07,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:07,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:07,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:07,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=236, Unknown=2, NotChecked=0, Total=306 [2019-12-27 23:26:07,355 INFO L87 Difference]: Start difference. First operand 1002 states and 2292 transitions. Second operand 11 states. [2019-12-27 23:26:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:08,124 INFO L93 Difference]: Finished difference Result 1628 states and 3648 transitions. [2019-12-27 23:26:08,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:26:08,124 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:08,125 INFO L225 Difference]: With dead ends: 1628 [2019-12-27 23:26:08,126 INFO L226 Difference]: Without dead ends: 1521 [2019-12-27 23:26:08,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=183, Invalid=516, Unknown=3, NotChecked=0, Total=702 [2019-12-27 23:26:08,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-12-27 23:26:08,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1002. [2019-12-27 23:26:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-12-27 23:26:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 2292 transitions. [2019-12-27 23:26:08,138 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 2292 transitions. Word has length 44 [2019-12-27 23:26:08,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:08,139 INFO L462 AbstractCegarLoop]: Abstraction has 1002 states and 2292 transitions. [2019-12-27 23:26:08,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 2292 transitions. [2019-12-27 23:26:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:08,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:08,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:26:08,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:08,341 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:08,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:08,341 INFO L82 PathProgramCache]: Analyzing trace with hash 643650778, now seen corresponding path program 17 times [2019-12-27 23:26:08,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:08,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267633237] [2019-12-27 23:26:08,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:08,476 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:08,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267633237] [2019-12-27 23:26:08,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150823269] [2019-12-27 23:26:08,477 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 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:08,525 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 23:26:08,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:08,527 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:08,528 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:08,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:08,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:08,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:08,720 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:08,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:08,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:08,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1991097743] [2019-12-27 23:26:08,721 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:08,724 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:08,744 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:08,745 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:08,746 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:26:08,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:08,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:08,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:08,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:08,747 INFO L87 Difference]: Start difference. First operand 1002 states and 2292 transitions. Second operand 11 states. [2019-12-27 23:26:09,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:09,191 INFO L93 Difference]: Finished difference Result 1727 states and 3846 transitions. [2019-12-27 23:26:09,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:26:09,192 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:09,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:09,193 INFO L225 Difference]: With dead ends: 1727 [2019-12-27 23:26:09,193 INFO L226 Difference]: Without dead ends: 1620 [2019-12-27 23:26:09,194 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:09,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2019-12-27 23:26:09,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1018. [2019-12-27 23:26:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2019-12-27 23:26:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 2332 transitions. [2019-12-27 23:26:09,208 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 2332 transitions. Word has length 44 [2019-12-27 23:26:09,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:09,208 INFO L462 AbstractCegarLoop]: Abstraction has 1018 states and 2332 transitions. [2019-12-27 23:26:09,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:09,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 2332 transitions. [2019-12-27 23:26:09,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:09,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:09,210 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:09,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:09,413 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:09,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:09,414 INFO L82 PathProgramCache]: Analyzing trace with hash 653481808, now seen corresponding path program 18 times [2019-12-27 23:26:09,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:09,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538904859] [2019-12-27 23:26:09,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:09,576 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:09,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538904859] [2019-12-27 23:26:09,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573567082] [2019-12-27 23:26:09,576 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 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:09,636 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 23:26:09,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:09,639 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 23:26:09,640 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:09,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:09,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:09,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:09,813 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:09,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:09,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-12-27 23:26:09,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2014029848] [2019-12-27 23:26:09,813 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:09,818 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:09,843 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:09,843 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:09,845 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:26:09,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:09,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:09,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:09,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:26:09,849 INFO L87 Difference]: Start difference. First operand 1018 states and 2332 transitions. Second operand 11 states. [2019-12-27 23:26:10,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:10,223 INFO L93 Difference]: Finished difference Result 1715 states and 3826 transitions. [2019-12-27 23:26:10,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:26:10,223 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:10,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:10,225 INFO L225 Difference]: With dead ends: 1715 [2019-12-27 23:26:10,225 INFO L226 Difference]: Without dead ends: 1608 [2019-12-27 23:26:10,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=605, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:26:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2019-12-27 23:26:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1002. [2019-12-27 23:26:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-12-27 23:26:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 2292 transitions. [2019-12-27 23:26:10,240 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 2292 transitions. Word has length 44 [2019-12-27 23:26:10,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:10,241 INFO L462 AbstractCegarLoop]: Abstraction has 1002 states and 2292 transitions. [2019-12-27 23:26:10,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:10,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 2292 transitions. [2019-12-27 23:26:10,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:10,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:10,242 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:10,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:10,446 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:10,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:10,446 INFO L82 PathProgramCache]: Analyzing trace with hash -885950476, now seen corresponding path program 19 times [2019-12-27 23:26:10,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:10,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694104818] [2019-12-27 23:26:10,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:10,592 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:10,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694104818] [2019-12-27 23:26:10,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061946336] [2019-12-27 23:26:10,593 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 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:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:10,642 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:10,643 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:10,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:10,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:10,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:10,828 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:10,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:10,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:10,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1534122081] [2019-12-27 23:26:10,829 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:10,834 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:10,858 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:10,858 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:10,859 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:26:10,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:10,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:10,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:10,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:10,860 INFO L87 Difference]: Start difference. First operand 1002 states and 2292 transitions. Second operand 11 states. [2019-12-27 23:26:11,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:11,288 INFO L93 Difference]: Finished difference Result 1746 states and 3884 transitions. [2019-12-27 23:26:11,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:11,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:11,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:11,290 INFO L225 Difference]: With dead ends: 1746 [2019-12-27 23:26:11,291 INFO L226 Difference]: Without dead ends: 1639 [2019-12-27 23:26:11,291 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:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-12-27 23:26:11,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1034. [2019-12-27 23:26:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-12-27 23:26:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 2372 transitions. [2019-12-27 23:26:11,305 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 2372 transitions. Word has length 44 [2019-12-27 23:26:11,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:11,305 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 2372 transitions. [2019-12-27 23:26:11,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:11,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 2372 transitions. [2019-12-27 23:26:11,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:11,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:11,307 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:11,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:11,507 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:11,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:11,508 INFO L82 PathProgramCache]: Analyzing trace with hash -876119446, now seen corresponding path program 20 times [2019-12-27 23:26:11,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:11,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098242147] [2019-12-27 23:26:11,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:11,644 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:11,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098242147] [2019-12-27 23:26:11,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314149602] [2019-12-27 23:26:11,645 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 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:11,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:26:11,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:11,688 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:11,689 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:11,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:11,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:11,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:11,891 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:11,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:11,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:11,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1321915002] [2019-12-27 23:26:11,892 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:11,897 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:11,922 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:11,922 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:11,924 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:26:11,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:11,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:11,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:11,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:11,925 INFO L87 Difference]: Start difference. First operand 1034 states and 2372 transitions. Second operand 11 states. [2019-12-27 23:26:12,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:12,490 INFO L93 Difference]: Finished difference Result 1703 states and 3806 transitions. [2019-12-27 23:26:12,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:12,490 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:12,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:12,492 INFO L225 Difference]: With dead ends: 1703 [2019-12-27 23:26:12,492 INFO L226 Difference]: Without dead ends: 1596 [2019-12-27 23:26:12,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:26:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2019-12-27 23:26:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1018. [2019-12-27 23:26:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2019-12-27 23:26:12,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 2332 transitions. [2019-12-27 23:26:12,512 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 2332 transitions. Word has length 44 [2019-12-27 23:26:12,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:12,512 INFO L462 AbstractCegarLoop]: Abstraction has 1018 states and 2332 transitions. [2019-12-27 23:26:12,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 2332 transitions. [2019-12-27 23:26:12,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:12,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:12,514 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,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:12,717 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:12,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:12,718 INFO L82 PathProgramCache]: Analyzing trace with hash -552799404, now seen corresponding path program 21 times [2019-12-27 23:26:12,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:12,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587749476] [2019-12-27 23:26:12,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:12,860 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,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587749476] [2019-12-27 23:26:12,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83191229] [2019-12-27 23:26:12,860 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 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:12,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:26:12,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:12,904 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:12,905 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:13,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:13,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:13,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:13,139 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,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:13,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:13,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [915991234] [2019-12-27 23:26:13,140 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:13,143 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:13,160 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:13,160 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:13,161 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:26:13,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:13,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:13,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:13,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:13,162 INFO L87 Difference]: Start difference. First operand 1018 states and 2332 transitions. Second operand 11 states. [2019-12-27 23:26:13,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:13,614 INFO L93 Difference]: Finished difference Result 1755 states and 3906 transitions. [2019-12-27 23:26:13,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:13,614 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:13,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:13,617 INFO L225 Difference]: With dead ends: 1755 [2019-12-27 23:26:13,617 INFO L226 Difference]: Without dead ends: 1648 [2019-12-27 23:26:13,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 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:13,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2019-12-27 23:26:13,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1034. [2019-12-27 23:26:13,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-12-27 23:26:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 2372 transitions. [2019-12-27 23:26:13,631 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 2372 transitions. Word has length 44 [2019-12-27 23:26:13,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:13,632 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 2372 transitions. [2019-12-27 23:26:13,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:13,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 2372 transitions. [2019-12-27 23:26:13,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:13,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:13,633 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:13,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:13,835 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:13,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:13,835 INFO L82 PathProgramCache]: Analyzing trace with hash -99678294, now seen corresponding path program 22 times [2019-12-27 23:26:13,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:13,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208170967] [2019-12-27 23:26:13,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:13,984 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,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208170967] [2019-12-27 23:26:13,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778340830] [2019-12-27 23:26:13,984 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 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:14,033 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:26:14,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:14,034 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:14,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:18,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:18,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:18,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:18,543 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,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:18,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:18,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1898047079] [2019-12-27 23:26:18,544 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:18,546 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:18,562 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:18,563 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:18,564 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:26:18,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:18,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:18,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:18,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:18,565 INFO L87 Difference]: Start difference. First operand 1034 states and 2372 transitions. Second operand 11 states. [2019-12-27 23:26:25,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:25,108 INFO L93 Difference]: Finished difference Result 1743 states and 3886 transitions. [2019-12-27 23:26:25,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:25,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:25,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:25,110 INFO L225 Difference]: With dead ends: 1743 [2019-12-27 23:26:25,110 INFO L226 Difference]: Without dead ends: 1636 [2019-12-27 23:26:25,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=204, Invalid=605, Unknown=3, NotChecked=0, Total=812 [2019-12-27 23:26:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2019-12-27 23:26:25,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1002. [2019-12-27 23:26:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-12-27 23:26:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 2292 transitions. [2019-12-27 23:26:25,129 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 2292 transitions. Word has length 44 [2019-12-27 23:26:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:25,129 INFO L462 AbstractCegarLoop]: Abstraction has 1002 states and 2292 transitions. [2019-12-27 23:26:25,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 2292 transitions. [2019-12-27 23:26:25,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:25,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:25,131 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:25,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:25,335 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:25,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:25,335 INFO L82 PathProgramCache]: Analyzing trace with hash -727024114, now seen corresponding path program 23 times [2019-12-27 23:26:25,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:25,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299683989] [2019-12-27 23:26:25,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:25,492 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,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299683989] [2019-12-27 23:26:25,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762606067] [2019-12-27 23:26:25,494 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:25,544 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-27 23:26:25,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:25,545 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:25,546 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:25,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:25,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:25,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:25,684 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,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:25,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:25,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2038276589] [2019-12-27 23:26:25,684 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:25,687 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:25,703 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:25,703 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:25,705 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:26:25,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:25,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:25,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:25,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:25,705 INFO L87 Difference]: Start difference. First operand 1002 states and 2292 transitions. Second operand 11 states. [2019-12-27 23:26:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:26,094 INFO L93 Difference]: Finished difference Result 1765 states and 3922 transitions. [2019-12-27 23:26:26,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:26,094 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:26,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:26,097 INFO L225 Difference]: With dead ends: 1765 [2019-12-27 23:26:26,097 INFO L226 Difference]: Without dead ends: 1658 [2019-12-27 23:26:26,097 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:26,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2019-12-27 23:26:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1050. [2019-12-27 23:26:26,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-12-27 23:26:26,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 2412 transitions. [2019-12-27 23:26:26,123 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 2412 transitions. Word has length 44 [2019-12-27 23:26:26,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:26,124 INFO L462 AbstractCegarLoop]: Abstraction has 1050 states and 2412 transitions. [2019-12-27 23:26:26,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:26,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 2412 transitions. [2019-12-27 23:26:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:26,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:26,126 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:26,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:26,329 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:26,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:26,330 INFO L82 PathProgramCache]: Analyzing trace with hash -717193084, now seen corresponding path program 24 times [2019-12-27 23:26:26,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:26,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866045229] [2019-12-27 23:26:26,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:26,483 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:26,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866045229] [2019-12-27 23:26:26,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6900960] [2019-12-27 23:26:26,484 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:26,532 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 23:26:26,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:26,534 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:26:26,534 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:26,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:26,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:26,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:26,753 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:26,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:26,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:26,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [594599322] [2019-12-27 23:26:26,754 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:26,761 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:26,793 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:26,794 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:26,796 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:26:26,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:26,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:26,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:26,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:26,799 INFO L87 Difference]: Start difference. First operand 1050 states and 2412 transitions. Second operand 11 states. [2019-12-27 23:26:27,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:27,214 INFO L93 Difference]: Finished difference Result 1710 states and 3824 transitions. [2019-12-27 23:26:27,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:27,215 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:27,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:27,218 INFO L225 Difference]: With dead ends: 1710 [2019-12-27 23:26:27,218 INFO L226 Difference]: Without dead ends: 1603 [2019-12-27 23:26:27,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:26:27,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-12-27 23:26:27,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1034. [2019-12-27 23:26:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-12-27 23:26:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 2372 transitions. [2019-12-27 23:26:27,236 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 2372 transitions. Word has length 44 [2019-12-27 23:26:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:27,236 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 2372 transitions. [2019-12-27 23:26:27,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 2372 transitions. [2019-12-27 23:26:27,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:27,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:27,238 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:27,441 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:27,441 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:27,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:27,442 INFO L82 PathProgramCache]: Analyzing trace with hash -393873042, now seen corresponding path program 25 times [2019-12-27 23:26:27,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:27,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516491606] [2019-12-27 23:26:27,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:27,661 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:27,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516491606] [2019-12-27 23:26:27,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523664645] [2019-12-27 23:26:27,662 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:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:27,713 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:27,714 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:28,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:28,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:28,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:28,568 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:28,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:28,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:28,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [453447900] [2019-12-27 23:26:28,569 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:28,572 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:28,589 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:28,589 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:28,590 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:26:28,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:28,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:28,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:28,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=237, Unknown=1, NotChecked=0, Total=306 [2019-12-27 23:26:28,591 INFO L87 Difference]: Start difference. First operand 1034 states and 2372 transitions. Second operand 11 states. [2019-12-27 23:26:30,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:30,464 INFO L93 Difference]: Finished difference Result 1724 states and 3848 transitions. [2019-12-27 23:26:30,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:26:30,464 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:30,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:30,466 INFO L225 Difference]: With dead ends: 1724 [2019-12-27 23:26:30,466 INFO L226 Difference]: Without dead ends: 1617 [2019-12-27 23:26:30,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=217, Invalid=649, Unknown=4, NotChecked=0, Total=870 [2019-12-27 23:26:30,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-12-27 23:26:30,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1050. [2019-12-27 23:26:30,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-12-27 23:26:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 2412 transitions. [2019-12-27 23:26:30,480 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 2412 transitions. Word has length 44 [2019-12-27 23:26:30,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:30,480 INFO L462 AbstractCegarLoop]: Abstraction has 1050 states and 2412 transitions. [2019-12-27 23:26:30,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:30,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 2412 transitions. [2019-12-27 23:26:30,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:30,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:30,481 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:30,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:30,682 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:30,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:30,682 INFO L82 PathProgramCache]: Analyzing trace with hash 59248068, now seen corresponding path program 26 times [2019-12-27 23:26:30,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:30,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267924507] [2019-12-27 23:26:30,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:30,844 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:30,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267924507] [2019-12-27 23:26:30,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997672083] [2019-12-27 23:26:30,845 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:30,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:26:30,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:30,890 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:30,890 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:31,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:31,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:31,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:31,124 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:31,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:31,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:31,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1081928107] [2019-12-27 23:26:31,125 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:31,128 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:31,147 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:31,147 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:31,149 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:26:31,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:31,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:31,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:31,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:31,149 INFO L87 Difference]: Start difference. First operand 1050 states and 2412 transitions. Second operand 11 states. [2019-12-27 23:26:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:31,583 INFO L93 Difference]: Finished difference Result 1712 states and 3828 transitions. [2019-12-27 23:26:31,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:26:31,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:31,585 INFO L225 Difference]: With dead ends: 1712 [2019-12-27 23:26:31,586 INFO L226 Difference]: Without dead ends: 1605 [2019-12-27 23:26:31,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=657, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:26:31,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2019-12-27 23:26:31,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1018. [2019-12-27 23:26:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2019-12-27 23:26:31,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 2332 transitions. [2019-12-27 23:26:31,605 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 2332 transitions. Word has length 44 [2019-12-27 23:26:31,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:31,605 INFO L462 AbstractCegarLoop]: Abstraction has 1018 states and 2332 transitions. [2019-12-27 23:26:31,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:31,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 2332 transitions. [2019-12-27 23:26:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:31,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:31,607 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:31,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:31,811 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:31,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:31,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1301891438, now seen corresponding path program 27 times [2019-12-27 23:26:31,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:31,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330896625] [2019-12-27 23:26:31,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:31,947 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:31,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330896625] [2019-12-27 23:26:31,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641367959] [2019-12-27 23:26:31,947 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:31,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 23:26:31,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:31,992 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:31,993 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:32,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:32,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:32,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:32,125 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,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:32,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:32,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1680750821] [2019-12-27 23:26:32,125 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:32,127 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:32,144 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:32,145 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:32,146 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:26:32,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:32,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:32,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:32,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:32,147 INFO L87 Difference]: Start difference. First operand 1018 states and 2332 transitions. Second operand 11 states. [2019-12-27 23:26:32,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:32,583 INFO L93 Difference]: Finished difference Result 1816 states and 4028 transitions. [2019-12-27 23:26:32,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:26:32,583 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:32,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:32,585 INFO L225 Difference]: With dead ends: 1816 [2019-12-27 23:26:32,586 INFO L226 Difference]: Without dead ends: 1709 [2019-12-27 23:26:32,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:26:32,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2019-12-27 23:26:32,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1050. [2019-12-27 23:26:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-12-27 23:26:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 2412 transitions. [2019-12-27 23:26:32,600 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 2412 transitions. Word has length 44 [2019-12-27 23:26:32,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:32,600 INFO L462 AbstractCegarLoop]: Abstraction has 1050 states and 2412 transitions. [2019-12-27 23:26:32,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:32,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 2412 transitions. [2019-12-27 23:26:32,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:32,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:32,602 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,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:32,802 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:32,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:32,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1311722468, now seen corresponding path program 28 times [2019-12-27 23:26:32,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:32,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592840328] [2019-12-27 23:26:32,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:32,952 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,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592840328] [2019-12-27 23:26:32,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40431224] [2019-12-27 23:26:32,953 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:32,997 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:26:32,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:32,998 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:32,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:33,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:33,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:33,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:33,144 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:33,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:33,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:33,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1428713970] [2019-12-27 23:26:33,144 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:33,148 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:33,173 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:33,173 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:33,175 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:26:33,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:33,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:33,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:33,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:33,176 INFO L87 Difference]: Start difference. First operand 1050 states and 2412 transitions. Second operand 11 states. [2019-12-27 23:26:33,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:33,680 INFO L93 Difference]: Finished difference Result 1792 states and 3988 transitions. [2019-12-27 23:26:33,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:26:33,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:33,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:33,683 INFO L225 Difference]: With dead ends: 1792 [2019-12-27 23:26:33,683 INFO L226 Difference]: Without dead ends: 1685 [2019-12-27 23:26:33,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:26:33,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2019-12-27 23:26:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1034. [2019-12-27 23:26:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-12-27 23:26:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 2372 transitions. [2019-12-27 23:26:33,698 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 2372 transitions. Word has length 44 [2019-12-27 23:26:33,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:33,699 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 2372 transitions. [2019-12-27 23:26:33,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 2372 transitions. [2019-12-27 23:26:33,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:33,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:33,700 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,900 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:33,901 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:33,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:33,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1640294062, now seen corresponding path program 29 times [2019-12-27 23:26:33,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:33,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56639950] [2019-12-27 23:26:33,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:34,036 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,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56639950] [2019-12-27 23:26:34,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472425088] [2019-12-27 23:26:34,037 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:34,086 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 23:26:34,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:34,087 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:34,088 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:35,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:35,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:35,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:35,418 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,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:35,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:35,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1025692112] [2019-12-27 23:26:35,419 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:35,421 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:35,439 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:35,440 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:35,441 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:26:35,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:35,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:35,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:35,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=235, Unknown=3, NotChecked=0, Total=306 [2019-12-27 23:26:35,442 INFO L87 Difference]: Start difference. First operand 1034 states and 2372 transitions. Second operand 11 states. [2019-12-27 23:26:37,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:37,704 INFO L93 Difference]: Finished difference Result 1804 states and 4008 transitions. [2019-12-27 23:26:37,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:26:37,705 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:37,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:37,707 INFO L225 Difference]: With dead ends: 1804 [2019-12-27 23:26:37,707 INFO L226 Difference]: Without dead ends: 1697 [2019-12-27 23:26:37,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=213, Invalid=652, Unknown=5, NotChecked=0, Total=870 [2019-12-27 23:26:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2019-12-27 23:26:37,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1050. [2019-12-27 23:26:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-12-27 23:26:37,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 2412 transitions. [2019-12-27 23:26:37,722 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 2412 transitions. Word has length 44 [2019-12-27 23:26:37,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:37,722 INFO L462 AbstractCegarLoop]: Abstraction has 1050 states and 2412 transitions. [2019-12-27 23:26:37,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 2412 transitions. [2019-12-27 23:26:37,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:37,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:37,724 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:37,927 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:37,927 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:37,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:37,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2093415172, now seen corresponding path program 30 times [2019-12-27 23:26:37,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:37,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450069953] [2019-12-27 23:26:37,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:38,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:38,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450069953] [2019-12-27 23:26:38,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402861619] [2019-12-27 23:26:38,126 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:38,202 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 23:26:38,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:38,204 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 23:26:38,205 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:38,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:38,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:38,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:38,432 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:38,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:38,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-12-27 23:26:38,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1489841761] [2019-12-27 23:26:38,433 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:38,439 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:38,540 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 182 transitions. [2019-12-27 23:26:38,541 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:38,543 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:26:38,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:38,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:38,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:38,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:26:38,544 INFO L87 Difference]: Start difference. First operand 1050 states and 2412 transitions. Second operand 11 states. [2019-12-27 23:26:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:38,988 INFO L93 Difference]: Finished difference Result 1712 states and 3828 transitions. [2019-12-27 23:26:38,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:26:38,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:38,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:38,991 INFO L225 Difference]: With dead ends: 1712 [2019-12-27 23:26:38,991 INFO L226 Difference]: Without dead ends: 1605 [2019-12-27 23:26:38,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:26:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2019-12-27 23:26:39,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1014. [2019-12-27 23:26:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-12-27 23:26:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 2319 transitions. [2019-12-27 23:26:39,011 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 2319 transitions. Word has length 44 [2019-12-27 23:26:39,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:39,011 INFO L462 AbstractCegarLoop]: Abstraction has 1014 states and 2319 transitions. [2019-12-27 23:26:39,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 2319 transitions. [2019-12-27 23:26:39,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:39,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:39,013 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:39,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:39,216 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:39,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:39,217 INFO L82 PathProgramCache]: Analyzing trace with hash -811669720, now seen corresponding path program 7 times [2019-12-27 23:26:39,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:39,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338038841] [2019-12-27 23:26:39,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:39,351 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:39,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338038841] [2019-12-27 23:26:39,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765126718] [2019-12-27 23:26:39,352 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:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:39,393 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:39,394 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:39,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:39,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:39,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:39,514 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:39,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:39,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:39,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [515089882] [2019-12-27 23:26:39,514 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:39,516 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:39,538 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 165 states and 284 transitions. [2019-12-27 23:26:39,538 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:39,541 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 23:26:39,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:39,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:39,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:39,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:39,542 INFO L87 Difference]: Start difference. First operand 1014 states and 2319 transitions. Second operand 11 states. [2019-12-27 23:26:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:39,898 INFO L93 Difference]: Finished difference Result 1696 states and 3809 transitions. [2019-12-27 23:26:39,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:39,899 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:39,900 INFO L225 Difference]: With dead ends: 1696 [2019-12-27 23:26:39,900 INFO L226 Difference]: Without dead ends: 1547 [2019-12-27 23:26:39,901 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:39,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2019-12-27 23:26:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1075. [2019-12-27 23:26:39,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-12-27 23:26:39,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 2460 transitions. [2019-12-27 23:26:39,913 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 2460 transitions. Word has length 44 [2019-12-27 23:26:39,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:39,913 INFO L462 AbstractCegarLoop]: Abstraction has 1075 states and 2460 transitions. [2019-12-27 23:26:39,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:39,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 2460 transitions. [2019-12-27 23:26:39,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:39,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:39,914 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:40,114 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:40,115 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:40,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:40,116 INFO L82 PathProgramCache]: Analyzing trace with hash -801838690, now seen corresponding path program 8 times [2019-12-27 23:26:40,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:40,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612394195] [2019-12-27 23:26:40,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:40,263 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:40,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612394195] [2019-12-27 23:26:40,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120638945] [2019-12-27 23:26:40,263 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:40,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:26:40,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:40,307 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:40,308 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:41,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:41,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:41,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:41,760 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:41,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:41,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:41,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1679980902] [2019-12-27 23:26:41,761 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:41,763 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:41,785 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 278 transitions. [2019-12-27 23:26:41,785 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:41,789 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 23:26:41,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:41,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:41,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:41,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=239, Unknown=1, NotChecked=0, Total=306 [2019-12-27 23:26:41,790 INFO L87 Difference]: Start difference. First operand 1075 states and 2460 transitions. Second operand 11 states. [2019-12-27 23:26:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:42,960 INFO L93 Difference]: Finished difference Result 1755 states and 3906 transitions. [2019-12-27 23:26:42,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:26:42,960 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:42,962 INFO L225 Difference]: With dead ends: 1755 [2019-12-27 23:26:42,963 INFO L226 Difference]: Without dead ends: 1648 [2019-12-27 23:26:42,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=188, Invalid=622, Unknown=2, NotChecked=0, Total=812 [2019-12-27 23:26:42,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2019-12-27 23:26:42,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1071. [2019-12-27 23:26:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071 states. [2019-12-27 23:26:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 2447 transitions. [2019-12-27 23:26:42,977 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 2447 transitions. Word has length 44 [2019-12-27 23:26:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:42,978 INFO L462 AbstractCegarLoop]: Abstraction has 1071 states and 2447 transitions. [2019-12-27 23:26:42,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 2447 transitions. [2019-12-27 23:26:42,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:42,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:42,979 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:43,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:43,180 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:43,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:43,181 INFO L82 PathProgramCache]: Analyzing trace with hash -478518648, now seen corresponding path program 31 times [2019-12-27 23:26:43,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:43,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266086279] [2019-12-27 23:26:43,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:43,341 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:43,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266086279] [2019-12-27 23:26:43,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787548866] [2019-12-27 23:26:43,341 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 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:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:43,399 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:43,400 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:44,548 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_~i~0_118 Int)) (and (<= (div (+ (* v_~i~0_118 (- 1)) 1) (- 3)) 1) (<= c_~j~0 (+ v_~i~0_118 c_~i~0 1)) (<= c_~i~0 (+ (* 2 v_~i~0_118) 1)))) is different from true [2019-12-27 23:26:44,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:44,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:44,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:44,558 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,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:44,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:44,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [411707503] [2019-12-27 23:26:44,558 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:44,561 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:44,581 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 254 transitions. [2019-12-27 23:26:44,582 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:44,584 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 23:26:44,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:44,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:44,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:44,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=211, Unknown=1, NotChecked=30, Total=306 [2019-12-27 23:26:44,585 INFO L87 Difference]: Start difference. First operand 1071 states and 2447 transitions. Second operand 11 states. [2019-12-27 23:26:45,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:45,572 INFO L93 Difference]: Finished difference Result 1868 states and 4128 transitions. [2019-12-27 23:26:45,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:26:45,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:45,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:45,574 INFO L225 Difference]: With dead ends: 1868 [2019-12-27 23:26:45,574 INFO L226 Difference]: Without dead ends: 1761 [2019-12-27 23:26:45,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=202, Invalid=612, Unknown=2, NotChecked=54, Total=870 [2019-12-27 23:26:45,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2019-12-27 23:26:45,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1087. [2019-12-27 23:26:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1087 states. [2019-12-27 23:26:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 2487 transitions. [2019-12-27 23:26:45,587 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 2487 transitions. Word has length 44 [2019-12-27 23:26:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:45,587 INFO L462 AbstractCegarLoop]: Abstraction has 1087 states and 2487 transitions. [2019-12-27 23:26:45,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 2487 transitions. [2019-12-27 23:26:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:45,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:45,589 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:45,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:45,791 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:45,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:45,792 INFO L82 PathProgramCache]: Analyzing trace with hash -25397538, now seen corresponding path program 32 times [2019-12-27 23:26:45,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:45,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169006960] [2019-12-27 23:26:45,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:45,930 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:45,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169006960] [2019-12-27 23:26:45,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793298481] [2019-12-27 23:26:45,931 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 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:45,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:26:45,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:45,983 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:45,984 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:46,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:46,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:46,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:46,673 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:46,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:46,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:46,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1130161558] [2019-12-27 23:26:46,674 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:46,677 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:46,697 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 254 transitions. [2019-12-27 23:26:46,697 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:46,700 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 23:26:46,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:46,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:46,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:46,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:46,701 INFO L87 Difference]: Start difference. First operand 1087 states and 2487 transitions. Second operand 11 states. [2019-12-27 23:26:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:48,883 INFO L93 Difference]: Finished difference Result 1816 states and 4028 transitions. [2019-12-27 23:26:48,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:26:48,883 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:48,885 INFO L225 Difference]: With dead ends: 1816 [2019-12-27 23:26:48,885 INFO L226 Difference]: Without dead ends: 1709 [2019-12-27 23:26:48,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=201, Invalid=665, Unknown=4, NotChecked=0, Total=870 [2019-12-27 23:26:48,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2019-12-27 23:26:48,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1067. [2019-12-27 23:26:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2019-12-27 23:26:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 2434 transitions. [2019-12-27 23:26:48,896 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 2434 transitions. Word has length 44 [2019-12-27 23:26:48,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:48,897 INFO L462 AbstractCegarLoop]: Abstraction has 1067 states and 2434 transitions. [2019-12-27 23:26:48,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:48,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 2434 transitions. [2019-12-27 23:26:48,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:48,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:48,898 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:49,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:49,099 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:49,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:49,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1217245832, now seen corresponding path program 33 times [2019-12-27 23:26:49,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:49,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223937447] [2019-12-27 23:26:49,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:49,254 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:49,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223937447] [2019-12-27 23:26:49,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550620695] [2019-12-27 23:26:49,254 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 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:49,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:26:49,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:49,311 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:49,312 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:55,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:55,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:55,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:55,582 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:55,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:55,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:55,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [956405823] [2019-12-27 23:26:55,583 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:55,587 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:55,615 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 230 transitions. [2019-12-27 23:26:55,615 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:55,618 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:26:55,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:55,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:55,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:55,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=239, Unknown=1, NotChecked=0, Total=306 [2019-12-27 23:26:55,619 INFO L87 Difference]: Start difference. First operand 1067 states and 2434 transitions. Second operand 11 states. [2019-12-27 23:26:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:56,100 INFO L93 Difference]: Finished difference Result 1929 states and 4250 transitions. [2019-12-27 23:26:56,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:26:56,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:56,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:56,102 INFO L225 Difference]: With dead ends: 1929 [2019-12-27 23:26:56,103 INFO L226 Difference]: Without dead ends: 1822 [2019-12-27 23:26:56,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=196, Invalid=673, Unknown=1, NotChecked=0, Total=870 [2019-12-27 23:26:56,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-12-27 23:26:56,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1099. [2019-12-27 23:26:56,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2019-12-27 23:26:56,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 2514 transitions. [2019-12-27 23:26:56,119 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 2514 transitions. Word has length 44 [2019-12-27 23:26:56,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:56,120 INFO L462 AbstractCegarLoop]: Abstraction has 1099 states and 2514 transitions. [2019-12-27 23:26:56,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 2514 transitions. [2019-12-27 23:26:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:56,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:56,121 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:56,321 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:56,322 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:56,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:56,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1227076862, now seen corresponding path program 34 times [2019-12-27 23:26:56,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:56,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688918821] [2019-12-27 23:26:56,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:56,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:26:56,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688918821] [2019-12-27 23:26:56,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190451558] [2019-12-27 23:26:56,481 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 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:56,549 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:26:56,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:56,550 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:56,557 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:56,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:56,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:56,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:56,844 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,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:56,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:56,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1086974815] [2019-12-27 23:26:56,845 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:56,847 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:56,867 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 230 transitions. [2019-12-27 23:26:56,868 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:56,871 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:26:56,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:56,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:56,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:56,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:56,872 INFO L87 Difference]: Start difference. First operand 1099 states and 2514 transitions. Second operand 11 states. [2019-12-27 23:26:57,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:57,359 INFO L93 Difference]: Finished difference Result 1917 states and 4230 transitions. [2019-12-27 23:26:57,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:26:57,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:57,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:57,362 INFO L225 Difference]: With dead ends: 1917 [2019-12-27 23:26:57,362 INFO L226 Difference]: Without dead ends: 1810 [2019-12-27 23:26:57,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:26:57,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2019-12-27 23:26:57,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1083. [2019-12-27 23:26:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-12-27 23:26:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 2474 transitions. [2019-12-27 23:26:57,376 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 2474 transitions. Word has length 44 [2019-12-27 23:26:57,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:57,376 INFO L462 AbstractCegarLoop]: Abstraction has 1083 states and 2474 transitions. [2019-12-27 23:26:57,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 2474 transitions. [2019-12-27 23:26:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:57,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:57,377 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:57,579 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:57,579 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:57,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:57,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1555648456, now seen corresponding path program 35 times [2019-12-27 23:26:57,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:57,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010617032] [2019-12-27 23:26:57,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:57,707 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:57,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010617032] [2019-12-27 23:26:57,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590177430] [2019-12-27 23:26:57,708 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 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:57,753 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 23:26:57,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:57,754 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:57,756 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:58,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:58,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:58,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:58,017 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:58,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:58,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:58,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1230527429] [2019-12-27 23:26:58,019 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:58,023 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:58,052 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 230 transitions. [2019-12-27 23:26:58,053 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:58,055 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:26:58,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:58,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:58,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:58,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:58,057 INFO L87 Difference]: Start difference. First operand 1083 states and 2474 transitions. Second operand 11 states. [2019-12-27 23:26:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:58,583 INFO L93 Difference]: Finished difference Result 1889 states and 4170 transitions. [2019-12-27 23:26:58,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:26:58,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:58,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:58,586 INFO L225 Difference]: With dead ends: 1889 [2019-12-27 23:26:58,586 INFO L226 Difference]: Without dead ends: 1782 [2019-12-27 23:26:58,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:26:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2019-12-27 23:26:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1099. [2019-12-27 23:26:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2019-12-27 23:26:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 2514 transitions. [2019-12-27 23:26:58,600 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 2514 transitions. Word has length 44 [2019-12-27 23:26:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:58,600 INFO L462 AbstractCegarLoop]: Abstraction has 1099 states and 2514 transitions. [2019-12-27 23:26:58,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:58,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 2514 transitions. [2019-12-27 23:26:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:58,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:58,601 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:58,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:58,802 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:58,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:58,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2008769566, now seen corresponding path program 36 times [2019-12-27 23:26:58,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:58,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407998500] [2019-12-27 23:26:58,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:26:58,943 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:58,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407998500] [2019-12-27 23:26:58,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502425600] [2019-12-27 23:26:58,943 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 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:58,988 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 23:26:58,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:26:58,989 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:26:58,990 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:26:59,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:59,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:59,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:26:59,155 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:59,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:26:59,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:26:59,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2097819302] [2019-12-27 23:26:59,156 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:26:59,158 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:26:59,178 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 230 transitions. [2019-12-27 23:26:59,178 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:26:59,180 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 23:26:59,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:26:59,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:26:59,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:26:59,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:26:59,181 INFO L87 Difference]: Start difference. First operand 1099 states and 2514 transitions. Second operand 11 states. [2019-12-27 23:26:59,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:26:59,635 INFO L93 Difference]: Finished difference Result 1837 states and 4070 transitions. [2019-12-27 23:26:59,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:26:59,635 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:26:59,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:26:59,638 INFO L225 Difference]: With dead ends: 1837 [2019-12-27 23:26:59,638 INFO L226 Difference]: Without dead ends: 1730 [2019-12-27 23:26:59,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:26:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2019-12-27 23:26:59,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1063. [2019-12-27 23:26:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states. [2019-12-27 23:26:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 2421 transitions. [2019-12-27 23:26:59,658 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 2421 transitions. Word has length 44 [2019-12-27 23:26:59,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:26:59,658 INFO L462 AbstractCegarLoop]: Abstraction has 1063 states and 2421 transitions. [2019-12-27 23:26:59,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:26:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 2421 transitions. [2019-12-27 23:26:59,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:26:59,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:26:59,660 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:59,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:26:59,864 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:26:59,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:26:59,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1400439432, now seen corresponding path program 37 times [2019-12-27 23:26:59,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:26:59,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738966111] [2019-12-27 23:26:59,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:26:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:00,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:27:00,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738966111] [2019-12-27 23:27:00,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184098972] [2019-12-27 23:27:00,002 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 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:27:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:00,047 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:00,048 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:00,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:00,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:00,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:00,202 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:00,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:00,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:00,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [897205182] [2019-12-27 23:27:00,203 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:00,205 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:00,223 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 206 transitions. [2019-12-27 23:27:00,223 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:00,225 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 23:27:00,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:00,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:00,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:00,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:00,225 INFO L87 Difference]: Start difference. First operand 1063 states and 2421 transitions. Second operand 11 states. [2019-12-27 23:27:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:00,743 INFO L93 Difference]: Finished difference Result 1948 states and 4288 transitions. [2019-12-27 23:27:00,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:27:00,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:00,746 INFO L225 Difference]: With dead ends: 1948 [2019-12-27 23:27:00,746 INFO L226 Difference]: Without dead ends: 1841 [2019-12-27 23:27:00,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:27:00,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2019-12-27 23:27:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1111. [2019-12-27 23:27:00,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-12-27 23:27:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 2541 transitions. [2019-12-27 23:27:00,760 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 2541 transitions. Word has length 44 [2019-12-27 23:27:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:00,760 INFO L462 AbstractCegarLoop]: Abstraction has 1111 states and 2541 transitions. [2019-12-27 23:27:00,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:00,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 2541 transitions. [2019-12-27 23:27:00,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:00,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:00,762 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:00,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:00,962 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:00,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:00,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1410270462, now seen corresponding path program 38 times [2019-12-27 23:27:00,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:00,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146439346] [2019-12-27 23:27:00,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:01,189 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:01,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146439346] [2019-12-27 23:27:01,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510497992] [2019-12-27 23:27:01,190 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 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:27:01,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:27:01,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:01,248 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:01,249 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:02,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:02,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:02,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:02,408 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:02,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:02,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:02,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [782342965] [2019-12-27 23:27:02,409 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:02,411 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:02,428 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 206 transitions. [2019-12-27 23:27:02,429 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:02,430 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 23:27:02,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:02,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:02,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:02,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=237, Unknown=2, NotChecked=0, Total=306 [2019-12-27 23:27:02,431 INFO L87 Difference]: Start difference. First operand 1111 states and 2541 transitions. Second operand 11 states. [2019-12-27 23:27:03,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:03,983 INFO L93 Difference]: Finished difference Result 1936 states and 4268 transitions. [2019-12-27 23:27:03,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:27:03,984 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:03,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:03,985 INFO L225 Difference]: With dead ends: 1936 [2019-12-27 23:27:03,986 INFO L226 Difference]: Without dead ends: 1829 [2019-12-27 23:27:03,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=238, Invalid=751, Unknown=3, NotChecked=0, Total=992 [2019-12-27 23:27:03,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-12-27 23:27:03,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1095. [2019-12-27 23:27:03,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2019-12-27 23:27:04,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 2501 transitions. [2019-12-27 23:27:04,000 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 2501 transitions. Word has length 44 [2019-12-27 23:27:04,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:04,000 INFO L462 AbstractCegarLoop]: Abstraction has 1095 states and 2501 transitions. [2019-12-27 23:27:04,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:04,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 2501 transitions. [2019-12-27 23:27:04,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:04,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:04,002 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:04,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:04,203 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:04,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:04,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1733590504, now seen corresponding path program 39 times [2019-12-27 23:27:04,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:04,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906972667] [2019-12-27 23:27:04,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:04,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:27:04,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906972667] [2019-12-27 23:27:04,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959040507] [2019-12-27 23:27:04,329 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 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:27:04,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 23:27:04,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:04,374 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:04,375 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:04,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:04,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:04,519 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:04,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:04,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:04,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [741929750] [2019-12-27 23:27:04,520 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:04,523 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:04,548 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 206 transitions. [2019-12-27 23:27:04,548 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:04,551 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:27:04,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:04,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:04,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:04,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:04,552 INFO L87 Difference]: Start difference. First operand 1095 states and 2501 transitions. Second operand 11 states. [2019-12-27 23:27:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:05,185 INFO L93 Difference]: Finished difference Result 1957 states and 4310 transitions. [2019-12-27 23:27:05,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:05,185 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:05,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:05,187 INFO L225 Difference]: With dead ends: 1957 [2019-12-27 23:27:05,188 INFO L226 Difference]: Without dead ends: 1850 [2019-12-27 23:27:05,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=221, Invalid=709, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:27:05,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2019-12-27 23:27:05,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1111. [2019-12-27 23:27:05,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-12-27 23:27:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 2541 transitions. [2019-12-27 23:27:05,217 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 2541 transitions. Word has length 44 [2019-12-27 23:27:05,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:05,217 INFO L462 AbstractCegarLoop]: Abstraction has 1111 states and 2541 transitions. [2019-12-27 23:27:05,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 2541 transitions. [2019-12-27 23:27:05,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:05,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:05,220 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:05,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:05,425 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:05,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:05,425 INFO L82 PathProgramCache]: Analyzing trace with hash -2108255682, now seen corresponding path program 40 times [2019-12-27 23:27:05,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:05,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348120449] [2019-12-27 23:27:05,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:05,618 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:05,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348120449] [2019-12-27 23:27:05,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482546292] [2019-12-27 23:27:05,619 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 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:27:05,693 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:27:05,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:05,695 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:05,697 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:05,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:05,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:05,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:05,864 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:05,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:05,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:05,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1568894321] [2019-12-27 23:27:05,865 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:05,868 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:05,892 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 206 transitions. [2019-12-27 23:27:05,893 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:05,894 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 23:27:05,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:05,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:05,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:05,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:05,895 INFO L87 Difference]: Start difference. First operand 1111 states and 2541 transitions. Second operand 11 states. [2019-12-27 23:27:06,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:06,339 INFO L93 Difference]: Finished difference Result 1945 states and 4290 transitions. [2019-12-27 23:27:06,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:06,340 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:06,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:06,342 INFO L225 Difference]: With dead ends: 1945 [2019-12-27 23:27:06,342 INFO L226 Difference]: Without dead ends: 1838 [2019-12-27 23:27:06,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:27:06,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-12-27 23:27:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1079. [2019-12-27 23:27:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-12-27 23:27:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 2461 transitions. [2019-12-27 23:27:06,356 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 2461 transitions. Word has length 44 [2019-12-27 23:27:06,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:06,356 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 2461 transitions. [2019-12-27 23:27:06,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:06,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 2461 transitions. [2019-12-27 23:27:06,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:06,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:06,357 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:06,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:06,558 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:06,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:06,559 INFO L82 PathProgramCache]: Analyzing trace with hash 34865096, now seen corresponding path program 41 times [2019-12-27 23:27:06,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:06,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783046803] [2019-12-27 23:27:06,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:06,693 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:06,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783046803] [2019-12-27 23:27:06,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506645738] [2019-12-27 23:27:06,694 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 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:27:06,748 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 23:27:06,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:06,749 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:06,750 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:06,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:06,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:06,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:06,907 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:06,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:06,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:06,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1760965678] [2019-12-27 23:27:06,908 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:06,911 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:06,931 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 206 transitions. [2019-12-27 23:27:06,932 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:06,933 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 23:27:06,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:06,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:06,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:06,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:06,934 INFO L87 Difference]: Start difference. First operand 1079 states and 2461 transitions. Second operand 11 states. [2019-12-27 23:27:07,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:07,399 INFO L93 Difference]: Finished difference Result 1929 states and 4250 transitions. [2019-12-27 23:27:07,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:07,400 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:07,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:07,401 INFO L225 Difference]: With dead ends: 1929 [2019-12-27 23:27:07,402 INFO L226 Difference]: Without dead ends: 1822 [2019-12-27 23:27:07,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:27:07,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-12-27 23:27:07,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1111. [2019-12-27 23:27:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-12-27 23:27:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 2541 transitions. [2019-12-27 23:27:07,415 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 2541 transitions. Word has length 44 [2019-12-27 23:27:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:07,415 INFO L462 AbstractCegarLoop]: Abstraction has 1111 states and 2541 transitions. [2019-12-27 23:27:07,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 2541 transitions. [2019-12-27 23:27:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:07,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:07,416 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:07,617 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:07,617 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:07,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:07,618 INFO L82 PathProgramCache]: Analyzing trace with hash 44696126, now seen corresponding path program 42 times [2019-12-27 23:27:07,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:07,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953133] [2019-12-27 23:27:07,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:07,748 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:07,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953133] [2019-12-27 23:27:07,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055154539] [2019-12-27 23:27:07,749 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 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:27:07,811 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 23:27:07,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:07,812 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:07,813 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:07,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:07,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:07,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:07,999 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:08,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:08,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:08,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [964572992] [2019-12-27 23:27:08,000 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:08,002 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:08,020 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 206 transitions. [2019-12-27 23:27:08,020 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:08,021 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 23:27:08,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:08,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:08,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:08,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:08,022 INFO L87 Difference]: Start difference. First operand 1111 states and 2541 transitions. Second operand 11 states. [2019-12-27 23:27:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:08,600 INFO L93 Difference]: Finished difference Result 1957 states and 4310 transitions. [2019-12-27 23:27:08,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:08,601 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:08,602 INFO L225 Difference]: With dead ends: 1957 [2019-12-27 23:27:08,602 INFO L226 Difference]: Without dead ends: 1850 [2019-12-27 23:27:08,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:27:08,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2019-12-27 23:27:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1095. [2019-12-27 23:27:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2019-12-27 23:27:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 2501 transitions. [2019-12-27 23:27:08,616 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 2501 transitions. Word has length 44 [2019-12-27 23:27:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:08,617 INFO L462 AbstractCegarLoop]: Abstraction has 1095 states and 2501 transitions. [2019-12-27 23:27:08,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 2501 transitions. [2019-12-27 23:27:08,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:08,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:08,618 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,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:08,819 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:08,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:08,820 INFO L82 PathProgramCache]: Analyzing trace with hash 373267720, now seen corresponding path program 43 times [2019-12-27 23:27:08,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:08,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695532084] [2019-12-27 23:27:08,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:08,948 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,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695532084] [2019-12-27 23:27:08,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16341989] [2019-12-27 23:27:08,948 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 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:27:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:08,993 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:08,994 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:09,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:09,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:09,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:09,177 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,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:09,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:09,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [764896926] [2019-12-27 23:27:09,178 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:09,180 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:09,198 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 206 transitions. [2019-12-27 23:27:09,199 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:09,201 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 23:27:09,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:09,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:09,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:09,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:09,202 INFO L87 Difference]: Start difference. First operand 1095 states and 2501 transitions. Second operand 11 states. [2019-12-27 23:27:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:10,254 INFO L93 Difference]: Finished difference Result 1889 states and 4170 transitions. [2019-12-27 23:27:10,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:10,254 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:10,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:10,257 INFO L225 Difference]: With dead ends: 1889 [2019-12-27 23:27:10,257 INFO L226 Difference]: Without dead ends: 1782 [2019-12-27 23:27:10,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=215, Invalid=714, Unknown=1, NotChecked=0, Total=930 [2019-12-27 23:27:10,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2019-12-27 23:27:10,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1111. [2019-12-27 23:27:10,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-12-27 23:27:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 2541 transitions. [2019-12-27 23:27:10,277 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 2541 transitions. Word has length 44 [2019-12-27 23:27:10,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:10,277 INFO L462 AbstractCegarLoop]: Abstraction has 1111 states and 2541 transitions. [2019-12-27 23:27:10,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 2541 transitions. [2019-12-27 23:27:10,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:27:10,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:10,279 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:10,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:10,482 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:10,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:10,483 INFO L82 PathProgramCache]: Analyzing trace with hash 826388830, now seen corresponding path program 44 times [2019-12-27 23:27:10,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:10,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747723879] [2019-12-27 23:27:10,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:10,641 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:10,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747723879] [2019-12-27 23:27:10,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686785304] [2019-12-27 23:27:10,641 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 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:27:10,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:27:10,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:10,715 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:27:10,716 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:10,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:10,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:10,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:10,881 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:10,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:10,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-12-27 23:27:10,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1119109111] [2019-12-27 23:27:10,882 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:10,885 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:10,936 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 206 transitions. [2019-12-27 23:27:10,936 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:10,938 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 23:27:10,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:27:10,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:10,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:27:10,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:27:10,939 INFO L87 Difference]: Start difference. First operand 1111 states and 2541 transitions. Second operand 11 states. [2019-12-27 23:27:11,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:11,330 INFO L93 Difference]: Finished difference Result 1750 states and 3892 transitions. [2019-12-27 23:27:11,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:27:11,331 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 23:27:11,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:11,332 INFO L225 Difference]: With dead ends: 1750 [2019-12-27 23:27:11,332 INFO L226 Difference]: Without dead ends: 1643 [2019-12-27 23:27:11,333 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:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2019-12-27 23:27:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1081. [2019-12-27 23:27:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2019-12-27 23:27:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 2451 transitions. [2019-12-27 23:27:11,345 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 2451 transitions. Word has length 44 [2019-12-27 23:27:11,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:11,345 INFO L462 AbstractCegarLoop]: Abstraction has 1081 states and 2451 transitions. [2019-12-27 23:27:11,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:27:11,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 2451 transitions. [2019-12-27 23:27:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:11,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:11,347 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:11,547 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:11,548 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:11,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1231912578, now seen corresponding path program 6 times [2019-12-27 23:27:11,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:11,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833550923] [2019-12-27 23:27:11,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 50 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:11,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833550923] [2019-12-27 23:27:11,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021380075] [2019-12-27 23:27:11,695 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 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:11,756 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-12-27 23:27:11,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:11,757 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:11,759 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:27:11,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-27 23:27:11,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 17 [2019-12-27 23:27:11,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [288459896] [2019-12-27 23:27:11,787 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:11,791 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:11,801 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-27 23:27:11,801 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:11,802 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:27:11,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:27:11,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:11,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:27:11,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:27:11,803 INFO L87 Difference]: Start difference. First operand 1081 states and 2451 transitions. Second operand 15 states. [2019-12-27 23:27:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:12,059 INFO L93 Difference]: Finished difference Result 1979 states and 4801 transitions. [2019-12-27 23:27:12,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 23:27:12,060 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2019-12-27 23:27:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:12,062 INFO L225 Difference]: With dead ends: 1979 [2019-12-27 23:27:12,062 INFO L226 Difference]: Without dead ends: 1886 [2019-12-27 23:27:12,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=249, Invalid=563, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:27:12,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2019-12-27 23:27:12,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1886. [2019-12-27 23:27:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2019-12-27 23:27:12,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 4614 transitions. [2019-12-27 23:27:12,083 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 4614 transitions. Word has length 48 [2019-12-27 23:27:12,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:12,083 INFO L462 AbstractCegarLoop]: Abstraction has 1886 states and 4614 transitions. [2019-12-27 23:27:12,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:27:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 4614 transitions. [2019-12-27 23:27:12,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:12,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:12,084 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:12,285 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:12,285 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:12,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash 678956547, now seen corresponding path program 6 times [2019-12-27 23:27:12,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:12,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250986117] [2019-12-27 23:27:12,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:12,475 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:12,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250986117] [2019-12-27 23:27:12,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118658471] [2019-12-27 23:27:12,476 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 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:12,555 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-12-27 23:27:12,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:12,556 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:12,559 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:15,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:15,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:15,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:15,139 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:15,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:15,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:15,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1300932825] [2019-12-27 23:27:15,140 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:15,143 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:15,166 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:27:15,166 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:15,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:27:15,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:15,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:15,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:15,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=295, Unknown=4, NotChecked=0, Total=380 [2019-12-27 23:27:15,168 INFO L87 Difference]: Start difference. First operand 1886 states and 4614 transitions. Second operand 12 states. [2019-12-27 23:27:16,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:16,389 INFO L93 Difference]: Finished difference Result 2616 states and 6158 transitions. [2019-12-27 23:27:16,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:27:16,390 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:16,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:16,392 INFO L225 Difference]: With dead ends: 2616 [2019-12-27 23:27:16,393 INFO L226 Difference]: Without dead ends: 2429 [2019-12-27 23:27:16,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=207, Invalid=599, Unknown=6, NotChecked=0, Total=812 [2019-12-27 23:27:16,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2019-12-27 23:27:16,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 1902. [2019-12-27 23:27:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1902 states. [2019-12-27 23:27:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 4650 transitions. [2019-12-27 23:27:16,413 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 4650 transitions. Word has length 48 [2019-12-27 23:27:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:16,413 INFO L462 AbstractCegarLoop]: Abstraction has 1902 states and 4650 transitions. [2019-12-27 23:27:16,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:16,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 4650 transitions. [2019-12-27 23:27:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:16,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:16,415 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:16,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:16,616 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:16,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:16,616 INFO L82 PathProgramCache]: Analyzing trace with hash -457322979, now seen corresponding path program 45 times [2019-12-27 23:27:16,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:16,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421805824] [2019-12-27 23:27:16,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:16,770 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:16,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421805824] [2019-12-27 23:27:16,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481271760] [2019-12-27 23:27:16,771 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 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:16,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 23:27:16,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:16,840 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:16,841 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:17,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:17,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:17,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:17,035 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:17,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:17,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:17,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [628232568] [2019-12-27 23:27:17,036 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:17,039 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:17,063 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:27:17,063 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:17,064 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:27:17,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:17,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:17,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:17,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:27:17,065 INFO L87 Difference]: Start difference. First operand 1902 states and 4650 transitions. Second operand 12 states. [2019-12-27 23:27:17,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:17,481 INFO L93 Difference]: Finished difference Result 2876 states and 6711 transitions. [2019-12-27 23:27:17,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:27:17,481 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:17,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:17,484 INFO L225 Difference]: With dead ends: 2876 [2019-12-27 23:27:17,484 INFO L226 Difference]: Without dead ends: 2685 [2019-12-27 23:27:17,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:27:17,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2019-12-27 23:27:17,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 1918. [2019-12-27 23:27:17,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1918 states. [2019-12-27 23:27:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 4690 transitions. [2019-12-27 23:27:17,506 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 4690 transitions. Word has length 48 [2019-12-27 23:27:17,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:17,506 INFO L462 AbstractCegarLoop]: Abstraction has 1918 states and 4690 transitions. [2019-12-27 23:27:17,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 4690 transitions. [2019-12-27 23:27:17,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:17,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:17,508 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:17,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:17,708 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:17,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:17,709 INFO L82 PathProgramCache]: Analyzing trace with hash -447491949, now seen corresponding path program 46 times [2019-12-27 23:27:17,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:17,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223920655] [2019-12-27 23:27:17,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:17,859 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:17,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223920655] [2019-12-27 23:27:17,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646896153] [2019-12-27 23:27:17,860 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:17,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:27:17,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:17,909 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:17,910 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:19,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:19,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:19,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:19,766 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:19,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:19,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:19,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [826008364] [2019-12-27 23:27:19,767 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:19,770 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:19,791 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:27:19,792 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:19,793 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:27:19,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:19,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:19,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:19,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=297, Unknown=2, NotChecked=0, Total=380 [2019-12-27 23:27:19,794 INFO L87 Difference]: Start difference. First operand 1918 states and 4690 transitions. Second operand 12 states. [2019-12-27 23:27:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:21,012 INFO L93 Difference]: Finished difference Result 2628 states and 6146 transitions. [2019-12-27 23:27:21,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:27:21,012 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:21,015 INFO L225 Difference]: With dead ends: 2628 [2019-12-27 23:27:21,015 INFO L226 Difference]: Without dead ends: 2493 [2019-12-27 23:27:21,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=223, Invalid=645, Unknown=2, NotChecked=0, Total=870 [2019-12-27 23:27:21,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2019-12-27 23:27:21,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1934. [2019-12-27 23:27:21,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2019-12-27 23:27:21,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 4730 transitions. [2019-12-27 23:27:21,037 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 4730 transitions. Word has length 48 [2019-12-27 23:27:21,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:21,037 INFO L462 AbstractCegarLoop]: Abstraction has 1934 states and 4730 transitions. [2019-12-27 23:27:21,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 4730 transitions. [2019-12-27 23:27:21,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:21,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:21,039 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:21,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:21,239 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:21,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:21,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2041734531, now seen corresponding path program 7 times [2019-12-27 23:27:21,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:21,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123078858] [2019-12-27 23:27:21,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:21,395 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:21,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123078858] [2019-12-27 23:27:21,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295762300] [2019-12-27 23:27:21,395 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 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:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:21,443 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:21,444 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:25,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:25,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:25,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:25,176 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:25,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:25,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:25,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1462969720] [2019-12-27 23:27:25,177 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:25,180 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:25,201 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 186 transitions. [2019-12-27 23:27:25,202 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:25,202 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:27:25,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:25,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:25,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:25,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=292, Unknown=6, NotChecked=0, Total=380 [2019-12-27 23:27:25,203 INFO L87 Difference]: Start difference. First operand 1934 states and 4730 transitions. Second operand 12 states. [2019-12-27 23:27:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:25,916 INFO L93 Difference]: Finished difference Result 2644 states and 6169 transitions. [2019-12-27 23:27:25,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:27:25,917 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:25,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:25,919 INFO L225 Difference]: With dead ends: 2644 [2019-12-27 23:27:25,919 INFO L226 Difference]: Without dead ends: 2501 [2019-12-27 23:27:25,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=222, Invalid=642, Unknown=6, NotChecked=0, Total=870 [2019-12-27 23:27:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2019-12-27 23:27:25,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 1918. [2019-12-27 23:27:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1918 states. [2019-12-27 23:27:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 4686 transitions. [2019-12-27 23:27:25,941 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 4686 transitions. Word has length 48 [2019-12-27 23:27:25,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:25,941 INFO L462 AbstractCegarLoop]: Abstraction has 1918 states and 4686 transitions. [2019-12-27 23:27:25,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 4686 transitions. [2019-12-27 23:27:25,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:25,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:25,943 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:26,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:26,144 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:26,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:26,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1986924233, now seen corresponding path program 47 times [2019-12-27 23:27:26,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:26,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339173493] [2019-12-27 23:27:26,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:26,289 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:26,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339173493] [2019-12-27 23:27:26,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462657206] [2019-12-27 23:27:26,290 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 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:26,335 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 23:27:26,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:26,337 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:26,337 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:27,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:27,436 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:27,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:27,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:27,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1472099889] [2019-12-27 23:27:27,436 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:27,439 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:27,461 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:27:27,461 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:27,462 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:27:27,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:27,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:27,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:27,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=299, Unknown=1, NotChecked=0, Total=380 [2019-12-27 23:27:27,463 INFO L87 Difference]: Start difference. First operand 1918 states and 4686 transitions. Second operand 12 states. [2019-12-27 23:27:28,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:28,365 INFO L93 Difference]: Finished difference Result 3088 states and 7158 transitions. [2019-12-27 23:27:28,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:27:28,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:28,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:28,368 INFO L225 Difference]: With dead ends: 3088 [2019-12-27 23:27:28,369 INFO L226 Difference]: Without dead ends: 2869 [2019-12-27 23:27:28,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=237, Invalid=691, Unknown=2, NotChecked=0, Total=930 [2019-12-27 23:27:28,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2019-12-27 23:27:28,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 1950. [2019-12-27 23:27:28,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-12-27 23:27:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 4766 transitions. [2019-12-27 23:27:28,391 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 4766 transitions. Word has length 48 [2019-12-27 23:27:28,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:28,391 INFO L462 AbstractCegarLoop]: Abstraction has 1950 states and 4766 transitions. [2019-12-27 23:27:28,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:28,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 4766 transitions. [2019-12-27 23:27:28,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:28,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:28,393 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:28,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:28,594 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:28,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:28,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1977093203, now seen corresponding path program 48 times [2019-12-27 23:27:28,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:28,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245579281] [2019-12-27 23:27:28,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:28,733 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:28,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245579281] [2019-12-27 23:27:28,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14278127] [2019-12-27 23:27:28,733 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 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:28,780 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 23:27:28,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:28,781 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:28,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:32,764 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-12-27 23:27:32,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:32,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:32,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:32,775 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:32,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:32,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:32,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [781095507] [2019-12-27 23:27:32,776 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:32,779 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:32,837 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:27:32,837 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:32,844 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:27:32,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:32,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:32,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:32,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=296, Unknown=2, NotChecked=0, Total=380 [2019-12-27 23:27:32,845 INFO L87 Difference]: Start difference. First operand 1950 states and 4766 transitions. Second operand 12 states. [2019-12-27 23:27:34,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:34,926 INFO L93 Difference]: Finished difference Result 2924 states and 6781 transitions. [2019-12-27 23:27:34,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:27:34,927 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:34,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:34,929 INFO L225 Difference]: With dead ends: 2924 [2019-12-27 23:27:34,930 INFO L226 Difference]: Without dead ends: 2761 [2019-12-27 23:27:34,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=239, Invalid=687, Unknown=4, NotChecked=0, Total=930 [2019-12-27 23:27:34,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2761 states. [2019-12-27 23:27:34,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2761 to 1966. [2019-12-27 23:27:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2019-12-27 23:27:34,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 4806 transitions. [2019-12-27 23:27:34,950 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 4806 transitions. Word has length 48 [2019-12-27 23:27:34,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:34,951 INFO L462 AbstractCegarLoop]: Abstraction has 1966 states and 4806 transitions. [2019-12-27 23:27:34,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 4806 transitions. [2019-12-27 23:27:34,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:34,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:34,952 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:35,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:35,153 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:35,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:35,154 INFO L82 PathProgramCache]: Analyzing trace with hash 512133277, now seen corresponding path program 49 times [2019-12-27 23:27:35,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:35,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115511650] [2019-12-27 23:27:35,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:35,314 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:35,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115511650] [2019-12-27 23:27:35,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698167453] [2019-12-27 23:27:35,315 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 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:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:35,361 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:35,361 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:36,902 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-12-27 23:27:37,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:37,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:37,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:37,144 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:37,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:37,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:37,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [283965755] [2019-12-27 23:27:37,145 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:37,147 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:37,166 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 186 transitions. [2019-12-27 23:27:37,166 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:37,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:27:37,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:37,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:37,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:37,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:27:37,168 INFO L87 Difference]: Start difference. First operand 1966 states and 4806 transitions. Second operand 12 states. [2019-12-27 23:27:37,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:37,621 INFO L93 Difference]: Finished difference Result 2900 states and 6738 transitions. [2019-12-27 23:27:37,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:27:37,621 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:37,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:37,624 INFO L225 Difference]: With dead ends: 2900 [2019-12-27 23:27:37,624 INFO L226 Difference]: Without dead ends: 2765 [2019-12-27 23:27:37,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:27:37,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2019-12-27 23:27:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 1934. [2019-12-27 23:27:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2019-12-27 23:27:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 4726 transitions. [2019-12-27 23:27:37,644 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 4726 transitions. Word has length 48 [2019-12-27 23:27:37,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:37,644 INFO L462 AbstractCegarLoop]: Abstraction has 1934 states and 4726 transitions. [2019-12-27 23:27:37,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:37,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 4726 transitions. [2019-12-27 23:27:37,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:37,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:37,646 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:37,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:37,847 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:37,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:37,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1653773161, now seen corresponding path program 50 times [2019-12-27 23:27:37,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:37,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565935190] [2019-12-27 23:27:37,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:37,998 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:37,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565935190] [2019-12-27 23:27:37,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33899801] [2019-12-27 23:27:37,998 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 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:38,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:27:38,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:38,041 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:38,042 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:41,504 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-12-27 23:27:43,405 WARN L192 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-12-27 23:27:43,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:43,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:43,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:43,418 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,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:43,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:43,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [589720454] [2019-12-27 23:27:43,419 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:43,422 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:43,444 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:27:43,444 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:43,445 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:27:43,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:43,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:43,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:43,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=294, Unknown=3, NotChecked=0, Total=380 [2019-12-27 23:27:43,446 INFO L87 Difference]: Start difference. First operand 1934 states and 4726 transitions. Second operand 12 states. [2019-12-27 23:27:46,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:46,317 INFO L93 Difference]: Finished difference Result 2964 states and 6895 transitions. [2019-12-27 23:27:46,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:27:46,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:46,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:46,322 INFO L225 Difference]: With dead ends: 2964 [2019-12-27 23:27:46,322 INFO L226 Difference]: Without dead ends: 2773 [2019-12-27 23:27:46,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=238, Invalid=685, Unknown=7, NotChecked=0, Total=930 [2019-12-27 23:27:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2773 states. [2019-12-27 23:27:46,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2773 to 1950. [2019-12-27 23:27:46,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-12-27 23:27:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 4766 transitions. [2019-12-27 23:27:46,365 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 4766 transitions. Word has length 48 [2019-12-27 23:27:46,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:46,366 INFO L462 AbstractCegarLoop]: Abstraction has 1950 states and 4766 transitions. [2019-12-27 23:27:46,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:46,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 4766 transitions. [2019-12-27 23:27:46,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:46,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:46,369 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:46,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:46,573 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:46,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:46,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1200652051, now seen corresponding path program 51 times [2019-12-27 23:27:46,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:46,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800231838] [2019-12-27 23:27:46,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:46,719 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:46,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800231838] [2019-12-27 23:27:46,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071667271] [2019-12-27 23:27:46,719 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:46,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 23:27:46,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:46,771 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-27 23:27:46,772 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:46,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:46,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:46,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:46,950 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:46,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:46,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-12-27 23:27:46,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [940841208] [2019-12-27 23:27:46,951 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:46,954 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:46,976 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:27:46,976 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:46,977 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:27:46,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:46,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:46,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:46,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:27:46,978 INFO L87 Difference]: Start difference. First operand 1950 states and 4766 transitions. Second operand 12 states. [2019-12-27 23:27:47,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:47,413 INFO L93 Difference]: Finished difference Result 2728 states and 6358 transitions. [2019-12-27 23:27:47,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:27:47,413 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:47,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:47,416 INFO L225 Difference]: With dead ends: 2728 [2019-12-27 23:27:47,416 INFO L226 Difference]: Without dead ends: 2593 [2019-12-27 23:27:47,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=742, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:27:47,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2019-12-27 23:27:47,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 1966. [2019-12-27 23:27:47,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2019-12-27 23:27:47,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 4806 transitions. [2019-12-27 23:27:47,441 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 4806 transitions. Word has length 48 [2019-12-27 23:27:47,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:47,441 INFO L462 AbstractCegarLoop]: Abstraction has 1966 states and 4806 transitions. [2019-12-27 23:27:47,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:47,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 4806 transitions. [2019-12-27 23:27:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:47,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:47,443 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:47,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:47,644 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:47,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:47,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1861549315, now seen corresponding path program 8 times [2019-12-27 23:27:47,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:47,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462928859] [2019-12-27 23:27:47,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:47,800 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:47,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462928859] [2019-12-27 23:27:47,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039064495] [2019-12-27 23:27:47,801 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 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:47,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:27:47,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:47,848 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:47,849 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:49,583 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-12-27 23:27:50,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:50,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:50,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:50,028 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:50,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:50,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:50,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1923759060] [2019-12-27 23:27:50,029 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:50,032 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:50,049 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 162 transitions. [2019-12-27 23:27:50,049 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:50,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:27:50,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:50,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:50,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:50,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=295, Unknown=3, NotChecked=0, Total=380 [2019-12-27 23:27:50,051 INFO L87 Difference]: Start difference. First operand 1966 states and 4806 transitions. Second operand 12 states. [2019-12-27 23:27:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:51,333 INFO L93 Difference]: Finished difference Result 2688 states and 6261 transitions. [2019-12-27 23:27:51,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:27:51,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:51,336 INFO L225 Difference]: With dead ends: 2688 [2019-12-27 23:27:51,336 INFO L226 Difference]: Without dead ends: 2533 [2019-12-27 23:27:51,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=233, Invalid=692, Unknown=5, NotChecked=0, Total=930 [2019-12-27 23:27:51,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2019-12-27 23:27:51,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 1934. [2019-12-27 23:27:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2019-12-27 23:27:51,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 4722 transitions. [2019-12-27 23:27:51,358 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 4722 transitions. Word has length 48 [2019-12-27 23:27:51,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:51,359 INFO L462 AbstractCegarLoop]: Abstraction has 1934 states and 4722 transitions. [2019-12-27 23:27:51,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:51,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 4722 transitions. [2019-12-27 23:27:51,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:51,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:51,360 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:51,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:51,561 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:51,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:51,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1827997871, now seen corresponding path program 52 times [2019-12-27 23:27:51,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:51,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420602465] [2019-12-27 23:27:51,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:51,798 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:51,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420602465] [2019-12-27 23:27:51,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399442279] [2019-12-27 23:27:51,799 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 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:51,849 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:27:51,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:51,850 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:51,851 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:52,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:52,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:52,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:52,094 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:52,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:52,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:52,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [95225309] [2019-12-27 23:27:52,095 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:52,097 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:52,119 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:27:52,119 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:52,120 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:27:52,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:52,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:52,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:52,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:27:52,121 INFO L87 Difference]: Start difference. First operand 1934 states and 4722 transitions. Second operand 12 states. [2019-12-27 23:27:52,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:52,605 INFO L93 Difference]: Finished difference Result 3092 states and 7173 transitions. [2019-12-27 23:27:52,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:27:52,606 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:52,608 INFO L225 Difference]: With dead ends: 3092 [2019-12-27 23:27:52,609 INFO L226 Difference]: Without dead ends: 2845 [2019-12-27 23:27:52,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:27:52,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2019-12-27 23:27:52,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 1982. [2019-12-27 23:27:52,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-27 23:27:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4842 transitions. [2019-12-27 23:27:52,631 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4842 transitions. Word has length 48 [2019-12-27 23:27:52,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:52,631 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4842 transitions. [2019-12-27 23:27:52,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4842 transitions. [2019-12-27 23:27:52,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:52,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:52,633 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:52,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:52,834 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:52,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:52,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1818166841, now seen corresponding path program 53 times [2019-12-27 23:27:52,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:52,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541749378] [2019-12-27 23:27:52,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:52,986 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:52,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541749378] [2019-12-27 23:27:52,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401204861] [2019-12-27 23:27:52,986 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 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:53,034 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 23:27:53,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:53,035 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:53,036 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:53,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:53,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:53,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:53,268 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:53,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:53,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:53,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [625525174] [2019-12-27 23:27:53,269 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:53,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:53,294 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:27:53,294 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:53,295 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:27:53,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:53,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:53,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:53,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:27:53,296 INFO L87 Difference]: Start difference. First operand 1982 states and 4842 transitions. Second operand 12 states. [2019-12-27 23:27:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:53,882 INFO L93 Difference]: Finished difference Result 3140 states and 7252 transitions. [2019-12-27 23:27:53,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:27:53,883 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:53,886 INFO L225 Difference]: With dead ends: 3140 [2019-12-27 23:27:53,886 INFO L226 Difference]: Without dead ends: 2949 [2019-12-27 23:27:53,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=252, Invalid=740, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:27:53,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-12-27 23:27:53,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1998. [2019-12-27 23:27:53,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 23:27:53,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 4882 transitions. [2019-12-27 23:27:53,910 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 4882 transitions. Word has length 48 [2019-12-27 23:27:53,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:53,911 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 4882 transitions. [2019-12-27 23:27:53,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:53,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 4882 transitions. [2019-12-27 23:27:53,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:53,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:53,913 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:54,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:54,113 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:54,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:54,114 INFO L82 PathProgramCache]: Analyzing trace with hash 671059639, now seen corresponding path program 54 times [2019-12-27 23:27:54,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:54,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760776255] [2019-12-27 23:27:54,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:54,268 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:54,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760776255] [2019-12-27 23:27:54,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593707089] [2019-12-27 23:27:54,268 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 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:54,317 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-27 23:27:54,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:54,319 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:54,320 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:54,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:54,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:54,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:54,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:27:54,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:54,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:54,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2145315725] [2019-12-27 23:27:54,532 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:54,535 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:54,555 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 186 transitions. [2019-12-27 23:27:54,555 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:54,556 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:27:54,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:54,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:54,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:54,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:27:54,557 INFO L87 Difference]: Start difference. First operand 1998 states and 4882 transitions. Second operand 12 states. [2019-12-27 23:27:55,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:55,070 INFO L93 Difference]: Finished difference Result 3100 states and 7173 transitions. [2019-12-27 23:27:55,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:27:55,070 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:55,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:55,073 INFO L225 Difference]: With dead ends: 3100 [2019-12-27 23:27:55,073 INFO L226 Difference]: Without dead ends: 2937 [2019-12-27 23:27:55,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=250, Invalid=742, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:27:55,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2019-12-27 23:27:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1966. [2019-12-27 23:27:55,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2019-12-27 23:27:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 4802 transitions. [2019-12-27 23:27:55,097 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 4802 transitions. Word has length 48 [2019-12-27 23:27:55,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:55,097 INFO L462 AbstractCegarLoop]: Abstraction has 1966 states and 4802 transitions. [2019-12-27 23:27:55,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:55,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 4802 transitions. [2019-12-27 23:27:55,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:55,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:55,099 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:55,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:55,300 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:55,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:55,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1494846799, now seen corresponding path program 55 times [2019-12-27 23:27:55,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:55,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047642069] [2019-12-27 23:27:55,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:55,458 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:55,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047642069] [2019-12-27 23:27:55,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180350087] [2019-12-27 23:27:55,459 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 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:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:55,504 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:55,505 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:27:55,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:55,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:55,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:27:55,788 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:55,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:27:55,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:27:55,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1634152190] [2019-12-27 23:27:55,788 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:27:55,791 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:27:55,814 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:27:55,814 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:27:55,815 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:27:55,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:27:55,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:27:55,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:27:55,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:27:55,816 INFO L87 Difference]: Start difference. First operand 1966 states and 4802 transitions. Second operand 12 states. [2019-12-27 23:27:56,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:27:56,404 INFO L93 Difference]: Finished difference Result 3180 states and 7370 transitions. [2019-12-27 23:27:56,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:27:56,405 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:27:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:27:56,408 INFO L225 Difference]: With dead ends: 3180 [2019-12-27 23:27:56,408 INFO L226 Difference]: Without dead ends: 2961 [2019-12-27 23:27:56,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=252, Invalid=740, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:27:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2019-12-27 23:27:56,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1982. [2019-12-27 23:27:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-27 23:27:56,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4842 transitions. [2019-12-27 23:27:56,441 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4842 transitions. Word has length 48 [2019-12-27 23:27:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:27:56,441 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4842 transitions. [2019-12-27 23:27:56,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:27:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4842 transitions. [2019-12-27 23:27:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:27:56,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:27:56,443 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:56,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 78 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:27:56,644 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:27:56,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:27:56,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1041725689, now seen corresponding path program 56 times [2019-12-27 23:27:56,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:27:56,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538188753] [2019-12-27 23:27:56,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:27:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:27:56,782 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:56,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538188753] [2019-12-27 23:27:56,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715570412] [2019-12-27 23:27:56,783 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 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:56,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:27:56,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:27:56,827 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:27:56,828 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:28:03,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:03,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:03,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:03,218 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:03,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:28:03,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:28:03,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [524235538] [2019-12-27 23:28:03,219 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:28:03,222 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:28:03,244 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:28:03,244 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:28:03,246 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:28:03,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:28:03,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:28:03,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:28:03,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=297, Unknown=2, NotChecked=0, Total=380 [2019-12-27 23:28:03,246 INFO L87 Difference]: Start difference. First operand 1982 states and 4842 transitions. Second operand 12 states. [2019-12-27 23:28:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:28:13,892 INFO L93 Difference]: Finished difference Result 3016 states and 6989 transitions. [2019-12-27 23:28:13,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:28:13,892 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:28:13,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:28:13,896 INFO L225 Difference]: With dead ends: 3016 [2019-12-27 23:28:13,896 INFO L226 Difference]: Without dead ends: 2853 [2019-12-27 23:28:13,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=252, Invalid=733, Unknown=7, NotChecked=0, Total=992 [2019-12-27 23:28:13,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2019-12-27 23:28:13,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 1998. [2019-12-27 23:28:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 23:28:13,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 4882 transitions. [2019-12-27 23:28:13,919 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 4882 transitions. Word has length 48 [2019-12-27 23:28:13,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:28:13,919 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 4882 transitions. [2019-12-27 23:28:13,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:28:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 4882 transitions. [2019-12-27 23:28:13,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:28:13,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:28:13,921 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:14,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 79 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:14,122 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:28:14,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:28:14,122 INFO L82 PathProgramCache]: Analyzing trace with hash 2020475677, now seen corresponding path program 57 times [2019-12-27 23:28:14,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:28:14,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573312165] [2019-12-27 23:28:14,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:28:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:14,286 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:14,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573312165] [2019-12-27 23:28:14,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906600066] [2019-12-27 23:28:14,287 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 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:28:14,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 23:28:14,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:28:14,336 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:28:14,336 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:28:14,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:14,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:14,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:14,592 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:14,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:28:14,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:28:14,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [686916985] [2019-12-27 23:28:14,593 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:28:14,596 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:28:14,613 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 162 transitions. [2019-12-27 23:28:14,613 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:28:14,614 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:28:14,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:28:14,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:28:14,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:28:14,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:28:14,615 INFO L87 Difference]: Start difference. First operand 1998 states and 4882 transitions. Second operand 12 states. [2019-12-27 23:28:15,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:28:15,129 INFO L93 Difference]: Finished difference Result 2948 states and 6846 transitions. [2019-12-27 23:28:15,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:28:15,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:28:15,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:28:15,132 INFO L225 Difference]: With dead ends: 2948 [2019-12-27 23:28:15,132 INFO L226 Difference]: Without dead ends: 2813 [2019-12-27 23:28:15,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=250, Invalid=742, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:28:15,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2019-12-27 23:28:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 1950. [2019-12-27 23:28:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-12-27 23:28:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 4762 transitions. [2019-12-27 23:28:15,156 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 4762 transitions. Word has length 48 [2019-12-27 23:28:15,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:28:15,156 INFO L462 AbstractCegarLoop]: Abstraction has 1950 states and 4762 transitions. [2019-12-27 23:28:15,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:28:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 4762 transitions. [2019-12-27 23:28:15,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:28:15,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:28:15,158 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,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:15,359 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:28:15,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:28:15,359 INFO L82 PathProgramCache]: Analyzing trace with hash 200917681, now seen corresponding path program 58 times [2019-12-27 23:28:15,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:28:15,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476828181] [2019-12-27 23:28:15,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:28:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:15,520 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,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476828181] [2019-12-27 23:28:15,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913826718] [2019-12-27 23:28:15,521 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 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:28:15,569 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:28:15,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:28:15,570 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:28:15,571 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:28:22,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:22,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:22,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:22,065 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:22,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:28:22,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:28:22,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2118653120] [2019-12-27 23:28:22,066 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:28:22,068 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:28:22,100 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:28:22,100 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:28:22,102 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:28:22,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:28:22,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:28:22,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:28:22,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=296, Unknown=2, NotChecked=0, Total=380 [2019-12-27 23:28:22,103 INFO L87 Difference]: Start difference. First operand 1950 states and 4762 transitions. Second operand 12 states. [2019-12-27 23:28:28,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:28:28,878 INFO L93 Difference]: Finished difference Result 3192 states and 7386 transitions. [2019-12-27 23:28:28,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:28:28,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:28:28,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:28:28,881 INFO L225 Difference]: With dead ends: 3192 [2019-12-27 23:28:28,881 INFO L226 Difference]: Without dead ends: 2973 [2019-12-27 23:28:28,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=247, Invalid=740, Unknown=5, NotChecked=0, Total=992 [2019-12-27 23:28:28,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2019-12-27 23:28:28,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 1982. [2019-12-27 23:28:28,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-27 23:28:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4842 transitions. [2019-12-27 23:28:28,907 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4842 transitions. Word has length 48 [2019-12-27 23:28:28,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:28:28,907 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4842 transitions. [2019-12-27 23:28:28,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:28:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4842 transitions. [2019-12-27 23:28:28,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:28:28,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:28:28,909 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:29,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:29,110 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:28:29,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:28:29,111 INFO L82 PathProgramCache]: Analyzing trace with hash 210748711, now seen corresponding path program 59 times [2019-12-27 23:28:29,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:28:29,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444376011] [2019-12-27 23:28:29,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:28:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:29,258 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,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444376011] [2019-12-27 23:28:29,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193531383] [2019-12-27 23:28:29,259 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 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:28:29,308 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 23:28:29,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:28:29,310 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:28:29,310 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:28:29,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:29,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:29,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:29,747 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,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:28:29,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:28:29,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [997567900] [2019-12-27 23:28:29,748 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:28:29,751 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:28:29,773 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:28:29,773 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:28:29,775 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:28:29,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:28:29,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:28:29,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:28:29,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:28:29,775 INFO L87 Difference]: Start difference. First operand 1982 states and 4842 transitions. Second operand 12 states. [2019-12-27 23:28:30,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:28:30,348 INFO L93 Difference]: Finished difference Result 2904 states and 6749 transitions. [2019-12-27 23:28:30,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:28:30,349 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:28:30,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:28:30,353 INFO L225 Difference]: With dead ends: 2904 [2019-12-27 23:28:30,353 INFO L226 Difference]: Without dead ends: 2741 [2019-12-27 23:28:30,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:28:30,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2019-12-27 23:28:30,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 1998. [2019-12-27 23:28:30,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 23:28:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 4882 transitions. [2019-12-27 23:28:30,377 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 4882 transitions. Word has length 48 [2019-12-27 23:28:30,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:28:30,377 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 4882 transitions. [2019-12-27 23:28:30,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:28:30,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 4882 transitions. [2019-12-27 23:28:30,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:28:30,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:28:30,379 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:30,580 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:30,580 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:28:30,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:28:30,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1594992105, now seen corresponding path program 60 times [2019-12-27 23:28:30,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:28:30,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398451441] [2019-12-27 23:28:30,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:28:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:30,731 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:30,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398451441] [2019-12-27 23:28:30,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147367719] [2019-12-27 23:28:30,731 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 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:28:30,778 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-27 23:28:30,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:28:30,779 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:28:30,780 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:28:31,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:31,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:31,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:31,148 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:31,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:28:31,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:28:31,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1200197142] [2019-12-27 23:28:31,149 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:28:31,152 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:28:31,172 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 186 transitions. [2019-12-27 23:28:31,172 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:28:31,176 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:28:31,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:28:31,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:28:31,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:28:31,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:28:31,177 INFO L87 Difference]: Start difference. First operand 1998 states and 4882 transitions. Second operand 12 states. [2019-12-27 23:28:31,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:28:31,702 INFO L93 Difference]: Finished difference Result 2848 states and 6630 transitions. [2019-12-27 23:28:31,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:28:31,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:28:31,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:28:31,705 INFO L225 Difference]: With dead ends: 2848 [2019-12-27 23:28:31,705 INFO L226 Difference]: Without dead ends: 2713 [2019-12-27 23:28:31,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=250, Invalid=742, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:28:31,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2019-12-27 23:28:31,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 1966. [2019-12-27 23:28:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2019-12-27 23:28:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 4802 transitions. [2019-12-27 23:28:31,729 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 4802 transitions. Word has length 48 [2019-12-27 23:28:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:28:31,729 INFO L462 AbstractCegarLoop]: Abstraction has 1966 states and 4802 transitions. [2019-12-27 23:28:31,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:28:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 4802 transitions. [2019-12-27 23:28:31,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:28:31,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:28:31,732 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:31,932 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:31,933 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:28:31,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:28:31,933 INFO L82 PathProgramCache]: Analyzing trace with hash 539320305, now seen corresponding path program 61 times [2019-12-27 23:28:31,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:28:31,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140621999] [2019-12-27 23:28:31,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:28:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:32,086 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:32,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140621999] [2019-12-27 23:28:32,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544577257] [2019-12-27 23:28:32,086 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:28:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:32,135 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:28:32,136 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:28:37,813 WARN L192 SmtUtils]: Spent 668.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-12-27 23:28:37,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:37,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:37,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:37,828 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:37,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:28:37,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:28:37,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1417634487] [2019-12-27 23:28:37,828 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:28:37,831 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:28:37,854 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:28:37,855 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:28:37,856 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:28:37,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:28:37,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:28:37,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:28:37,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:28:37,857 INFO L87 Difference]: Start difference. First operand 1966 states and 4802 transitions. Second operand 12 states. [2019-12-27 23:28:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:28:42,598 INFO L93 Difference]: Finished difference Result 2984 states and 6943 transitions. [2019-12-27 23:28:42,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:28:42,599 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:28:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:28:42,601 INFO L225 Difference]: With dead ends: 2984 [2019-12-27 23:28:42,602 INFO L226 Difference]: Without dead ends: 2793 [2019-12-27 23:28:42,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=249, Invalid=741, Unknown=2, NotChecked=0, Total=992 [2019-12-27 23:28:42,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2019-12-27 23:28:42,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 1982. [2019-12-27 23:28:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-27 23:28:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4842 transitions. [2019-12-27 23:28:42,626 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4842 transitions. Word has length 48 [2019-12-27 23:28:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:28:42,627 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4842 transitions. [2019-12-27 23:28:42,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:28:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4842 transitions. [2019-12-27 23:28:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:28:42,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:28:42,629 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:42,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 84 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:28:42,831 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:28:42,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:28:42,831 INFO L82 PathProgramCache]: Analyzing trace with hash 992441415, now seen corresponding path program 62 times [2019-12-27 23:28:42,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:28:42,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830815975] [2019-12-27 23:28:42,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:28:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:28:42,972 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:42,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830815975] [2019-12-27 23:28:42,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689977150] [2019-12-27 23:28:42,972 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 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:28:43,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:28:43,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:28:43,018 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:28:43,019 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:28:49,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:49,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:49,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:28:49,342 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:49,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:28:49,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:28:49,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [625545538] [2019-12-27 23:28:49,342 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:28:49,345 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:28:49,367 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:28:49,367 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:28:49,368 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:28:49,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:28:49,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:28:49,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:28:49,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:28:49,369 INFO L87 Difference]: Start difference. First operand 1982 states and 4842 transitions. Second operand 12 states. [2019-12-27 23:29:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:01,933 INFO L93 Difference]: Finished difference Result 2776 states and 6470 transitions. [2019-12-27 23:29:01,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:29:01,934 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:01,936 INFO L225 Difference]: With dead ends: 2776 [2019-12-27 23:29:01,936 INFO L226 Difference]: Without dead ends: 2641 [2019-12-27 23:29:01,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=251, Invalid=735, Unknown=6, NotChecked=0, Total=992 [2019-12-27 23:29:01,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2019-12-27 23:29:01,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 1998. [2019-12-27 23:29:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 23:29:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 4882 transitions. [2019-12-27 23:29:01,962 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 4882 transitions. Word has length 48 [2019-12-27 23:29:01,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:01,962 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 4882 transitions. [2019-12-27 23:29:01,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 4882 transitions. [2019-12-27 23:29:01,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:01,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:01,965 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:02,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:02,168 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:02,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:02,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1243600003, now seen corresponding path program 9 times [2019-12-27 23:29:02,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:02,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510177219] [2019-12-27 23:29:02,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:02,338 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:02,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510177219] [2019-12-27 23:29:02,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331314924] [2019-12-27 23:29:02,339 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 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:29:02,390 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-27 23:29:02,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:02,392 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:02,393 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:02,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:02,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:02,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:02,715 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:02,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:02,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:02,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1120861827] [2019-12-27 23:29:02,716 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:02,718 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:02,763 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 138 transitions. [2019-12-27 23:29:02,763 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:02,764 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:29:02,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:02,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:02,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:02,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:02,765 INFO L87 Difference]: Start difference. First operand 1998 states and 4882 transitions. Second operand 12 states. [2019-12-27 23:29:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:03,257 INFO L93 Difference]: Finished difference Result 2764 states and 6433 transitions. [2019-12-27 23:29:03,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:29:03,258 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:03,261 INFO L225 Difference]: With dead ends: 2764 [2019-12-27 23:29:03,261 INFO L226 Difference]: Without dead ends: 2597 [2019-12-27 23:29:03,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=238, Invalid=754, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:29:03,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2019-12-27 23:29:03,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 1950. [2019-12-27 23:29:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-12-27 23:29:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 4758 transitions. [2019-12-27 23:29:03,283 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 4758 transitions. Word has length 48 [2019-12-27 23:29:03,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:03,283 INFO L462 AbstractCegarLoop]: Abstraction has 1950 states and 4758 transitions. [2019-12-27 23:29:03,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 4758 transitions. [2019-12-27 23:29:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:03,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:03,284 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:03,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:03,485 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:03,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:03,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1912643477, now seen corresponding path program 63 times [2019-12-27 23:29:03,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:03,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418362453] [2019-12-27 23:29:03,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:03,642 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,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418362453] [2019-12-27 23:29:03,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202455805] [2019-12-27 23:29:03,643 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:29:03,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-27 23:29:03,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:03,697 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:03,697 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:03,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:03,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:03,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:03,850 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,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:03,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:03,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1145089661] [2019-12-27 23:29:03,851 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:03,853 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:03,875 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:03,875 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:03,876 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:03,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:03,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:03,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:03,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:03,877 INFO L87 Difference]: Start difference. First operand 1950 states and 4758 transitions. Second operand 12 states. [2019-12-27 23:29:04,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:04,393 INFO L93 Difference]: Finished difference Result 3124 states and 7244 transitions. [2019-12-27 23:29:04,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:29:04,393 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:04,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:04,396 INFO L225 Difference]: With dead ends: 3124 [2019-12-27 23:29:04,396 INFO L226 Difference]: Without dead ends: 2849 [2019-12-27 23:29:04,398 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:04,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2019-12-27 23:29:04,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2014. [2019-12-27 23:29:04,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-12-27 23:29:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 4918 transitions. [2019-12-27 23:29:04,421 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 4918 transitions. Word has length 48 [2019-12-27 23:29:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:04,422 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 4918 transitions. [2019-12-27 23:29:04,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 4918 transitions. [2019-12-27 23:29:04,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:04,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:04,423 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:04,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 87 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:04,624 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:04,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:04,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1902812447, now seen corresponding path program 64 times [2019-12-27 23:29:04,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:04,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827730451] [2019-12-27 23:29:04,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:04,767 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:04,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827730451] [2019-12-27 23:29:04,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171637108] [2019-12-27 23:29:04,768 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:29:04,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:29:04,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:04,815 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:04,815 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:06,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:06,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:06,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:06,372 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:06,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:06,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:06,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1075246196] [2019-12-27 23:29:06,373 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:06,398 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:06,420 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:06,420 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:06,421 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:06,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:06,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:06,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:06,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=299, Unknown=1, NotChecked=0, Total=380 [2019-12-27 23:29:06,422 INFO L87 Difference]: Start difference. First operand 2014 states and 4918 transitions. Second operand 12 states. [2019-12-27 23:29:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:08,989 INFO L93 Difference]: Finished difference Result 3072 states and 7115 transitions. [2019-12-27 23:29:08,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:29:08,990 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:08,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:08,993 INFO L225 Difference]: With dead ends: 3072 [2019-12-27 23:29:08,993 INFO L226 Difference]: Without dead ends: 2853 [2019-12-27 23:29:08,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=242, Invalid=748, Unknown=2, NotChecked=0, Total=992 [2019-12-27 23:29:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2019-12-27 23:29:09,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 2030. [2019-12-27 23:29:09,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2030 states. [2019-12-27 23:29:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 4958 transitions. [2019-12-27 23:29:09,016 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 4958 transitions. Word has length 48 [2019-12-27 23:29:09,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:09,016 INFO L462 AbstractCegarLoop]: Abstraction has 2030 states and 4958 transitions. [2019-12-27 23:29:09,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 4958 transitions. [2019-12-27 23:29:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:09,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:09,017 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:09,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 88 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:09,218 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:09,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:09,219 INFO L82 PathProgramCache]: Analyzing trace with hash 586414033, now seen corresponding path program 65 times [2019-12-27 23:29:09,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:09,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575289964] [2019-12-27 23:29:09,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:09,387 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,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575289964] [2019-12-27 23:29:09,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411084349] [2019-12-27 23:29:09,388 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 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:29:09,438 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-12-27 23:29:09,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:09,439 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:09,440 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:09,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:09,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:09,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:09,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:29:09,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:09,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:09,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1109750988] [2019-12-27 23:29:09,604 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:09,607 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:09,626 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 186 transitions. [2019-12-27 23:29:09,626 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:09,627 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:29:09,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:09,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:09,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:09,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:09,628 INFO L87 Difference]: Start difference. First operand 2030 states and 4958 transitions. Second operand 12 states. [2019-12-27 23:29:10,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:10,121 INFO L93 Difference]: Finished difference Result 3048 states and 7068 transitions. [2019-12-27 23:29:10,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:29:10,122 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:10,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:10,125 INFO L225 Difference]: With dead ends: 3048 [2019-12-27 23:29:10,125 INFO L226 Difference]: Without dead ends: 2857 [2019-12-27 23:29:10,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=806, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:29:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2019-12-27 23:29:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 1998. [2019-12-27 23:29:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 23:29:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 4878 transitions. [2019-12-27 23:29:10,154 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 4878 transitions. Word has length 48 [2019-12-27 23:29:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:10,154 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 4878 transitions. [2019-12-27 23:29:10,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 4878 transitions. [2019-12-27 23:29:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:10,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:10,156 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:10,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:10,359 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:10,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:10,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1579492405, now seen corresponding path program 66 times [2019-12-27 23:29:10,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:10,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67759971] [2019-12-27 23:29:10,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:10,526 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:10,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67759971] [2019-12-27 23:29:10,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720970131] [2019-12-27 23:29:10,527 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 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:29:10,575 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-27 23:29:10,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:10,576 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:10,577 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:13,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:13,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:13,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:14,006 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:14,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:14,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:14,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2011623135] [2019-12-27 23:29:14,006 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:14,009 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:14,030 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:14,030 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:14,031 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:29:14,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:14,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:14,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:14,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=297, Unknown=2, NotChecked=0, Total=380 [2019-12-27 23:29:14,032 INFO L87 Difference]: Start difference. First operand 1998 states and 4878 transitions. Second operand 12 states. [2019-12-27 23:29:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:19,114 INFO L93 Difference]: Finished difference Result 3156 states and 7325 transitions. [2019-12-27 23:29:19,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:29:19,115 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:19,118 INFO L225 Difference]: With dead ends: 3156 [2019-12-27 23:29:19,118 INFO L226 Difference]: Without dead ends: 2909 [2019-12-27 23:29:19,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=253, Invalid=794, Unknown=9, NotChecked=0, Total=1056 [2019-12-27 23:29:19,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2019-12-27 23:29:19,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2014. [2019-12-27 23:29:19,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-12-27 23:29:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 4918 transitions. [2019-12-27 23:29:19,141 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 4918 transitions. Word has length 48 [2019-12-27 23:29:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:19,141 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 4918 transitions. [2019-12-27 23:29:19,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:19,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 4918 transitions. [2019-12-27 23:29:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:19,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:19,143 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:19,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:19,344 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:19,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:19,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1126371295, now seen corresponding path program 67 times [2019-12-27 23:29:19,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:19,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016657035] [2019-12-27 23:29:19,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:19,497 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,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016657035] [2019-12-27 23:29:19,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437416871] [2019-12-27 23:29:19,498 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 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:29:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:19,546 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:19,547 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:21,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:21,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:21,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:21,089 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:21,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:21,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:21,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [687670837] [2019-12-27 23:29:21,090 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:21,093 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:21,114 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:21,114 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:21,115 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:21,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:21,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:21,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:21,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:21,116 INFO L87 Difference]: Start difference. First operand 2014 states and 4918 transitions. Second operand 12 states. [2019-12-27 23:29:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:23,493 INFO L93 Difference]: Finished difference Result 3060 states and 7092 transitions. [2019-12-27 23:29:23,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:29:23,494 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:23,496 INFO L225 Difference]: With dead ends: 3060 [2019-12-27 23:29:23,497 INFO L226 Difference]: Without dead ends: 2869 [2019-12-27 23:29:23,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=241, Invalid=748, Unknown=3, NotChecked=0, Total=992 [2019-12-27 23:29:23,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2019-12-27 23:29:23,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 2030. [2019-12-27 23:29:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2030 states. [2019-12-27 23:29:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 4958 transitions. [2019-12-27 23:29:23,519 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 4958 transitions. Word has length 48 [2019-12-27 23:29:23,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:23,519 INFO L462 AbstractCegarLoop]: Abstraction has 2030 states and 4958 transitions. [2019-12-27 23:29:23,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:23,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 4958 transitions. [2019-12-27 23:29:23,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:23,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:23,521 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:23,721 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 91 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:23,721 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:23,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:23,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1935830071, now seen corresponding path program 68 times [2019-12-27 23:29:23,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:23,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964696004] [2019-12-27 23:29:23,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:23,880 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:23,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964696004] [2019-12-27 23:29:23,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545632526] [2019-12-27 23:29:23,880 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 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:29:23,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:29:23,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:23,927 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:23,927 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:24,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:24,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:24,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:24,087 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,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:24,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:24,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1091924280] [2019-12-27 23:29:24,088 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:24,091 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:24,108 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 162 transitions. [2019-12-27 23:29:24,108 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:24,109 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 23:29:24,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:24,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:24,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:24,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:24,110 INFO L87 Difference]: Start difference. First operand 2030 states and 4958 transitions. Second operand 12 states. [2019-12-27 23:29:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:24,566 INFO L93 Difference]: Finished difference Result 3064 states and 7101 transitions. [2019-12-27 23:29:24,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:29:24,566 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:24,569 INFO L225 Difference]: With dead ends: 3064 [2019-12-27 23:29:24,569 INFO L226 Difference]: Without dead ends: 2901 [2019-12-27 23:29:24,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=806, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:29:24,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2019-12-27 23:29:24,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1982. [2019-12-27 23:29:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-27 23:29:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4838 transitions. [2019-12-27 23:29:24,592 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4838 transitions. Word has length 48 [2019-12-27 23:29:24,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:24,593 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4838 transitions. [2019-12-27 23:29:24,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:24,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4838 transitions. [2019-12-27 23:29:24,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:24,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:24,594 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:24,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:24,795 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:24,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:24,795 INFO L82 PathProgramCache]: Analyzing trace with hash 116272075, now seen corresponding path program 69 times [2019-12-27 23:29:24,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:24,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170629131] [2019-12-27 23:29:24,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:24,961 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,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170629131] [2019-12-27 23:29:24,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912631885] [2019-12-27 23:29:24,962 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 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:29:25,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:29:25,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:25,012 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:25,013 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:28,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:28,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:28,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:28,791 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,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:28,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:28,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1025611003] [2019-12-27 23:29:28,791 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:28,794 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:28,815 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:28,815 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:28,816 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:29:28,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:28,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:28,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:28,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=297, Unknown=2, NotChecked=0, Total=380 [2019-12-27 23:29:28,817 INFO L87 Difference]: Start difference. First operand 1982 states and 4838 transitions. Second operand 12 states. [2019-12-27 23:29:30,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:30,956 INFO L93 Difference]: Finished difference Result 3380 states and 7797 transitions. [2019-12-27 23:29:30,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:29:30,957 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:30,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:30,960 INFO L225 Difference]: With dead ends: 3380 [2019-12-27 23:29:30,960 INFO L226 Difference]: Without dead ends: 3133 [2019-12-27 23:29:30,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=273, Invalid=845, Unknown=4, NotChecked=0, Total=1122 [2019-12-27 23:29:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2019-12-27 23:29:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 2014. [2019-12-27 23:29:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-12-27 23:29:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 4918 transitions. [2019-12-27 23:29:30,982 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 4918 transitions. Word has length 48 [2019-12-27 23:29:30,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:30,982 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 4918 transitions. [2019-12-27 23:29:30,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 4918 transitions. [2019-12-27 23:29:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:30,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:30,984 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,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 93 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:31,184 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:31,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:31,185 INFO L82 PathProgramCache]: Analyzing trace with hash 126103105, now seen corresponding path program 70 times [2019-12-27 23:29:31,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:31,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182888364] [2019-12-27 23:29:31,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:31,325 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,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182888364] [2019-12-27 23:29:31,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001059639] [2019-12-27 23:29:31,325 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 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:29:31,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:29:31,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:31,370 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:31,370 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:32,433 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_~i~0_243 Int)) (and (<= c_~i~0 (+ (* 2 v_~i~0_243) c_~j~0 2)) (<= c_~j~0 (+ (* 3 v_~i~0_243) 4)) (<= (div (+ (* v_~i~0_243 (- 1)) 1) (- 2)) 2))) is different from true [2019-12-27 23:29:32,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:32,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:32,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:32,445 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,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:32,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:32,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1309381012] [2019-12-27 23:29:32,446 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:32,449 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:32,472 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:32,472 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:32,474 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:29:32,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:32,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:32,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:32,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=266, Unknown=1, NotChecked=34, Total=380 [2019-12-27 23:29:32,476 INFO L87 Difference]: Start difference. First operand 2014 states and 4918 transitions. Second operand 12 states. [2019-12-27 23:29:33,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:33,661 INFO L93 Difference]: Finished difference Result 3192 states and 7380 transitions. [2019-12-27 23:29:33,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:29:33,662 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:33,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:33,664 INFO L225 Difference]: With dead ends: 3192 [2019-12-27 23:29:33,665 INFO L226 Difference]: Without dead ends: 3001 [2019-12-27 23:29:33,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=259, Invalid=735, Unknown=2, NotChecked=60, Total=1056 [2019-12-27 23:29:33,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2019-12-27 23:29:33,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 2030. [2019-12-27 23:29:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2030 states. [2019-12-27 23:29:33,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 4958 transitions. [2019-12-27 23:29:33,686 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 4958 transitions. Word has length 48 [2019-12-27 23:29:33,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:33,686 INFO L462 AbstractCegarLoop]: Abstraction has 2030 states and 4958 transitions. [2019-12-27 23:29:33,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:33,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 4958 transitions. [2019-12-27 23:29:33,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:33,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:33,688 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,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 94 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:33,888 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:33,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:33,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1679637711, now seen corresponding path program 71 times [2019-12-27 23:29:33,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:33,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933461393] [2019-12-27 23:29:33,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:34,035 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,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933461393] [2019-12-27 23:29:34,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414018335] [2019-12-27 23:29:34,035 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 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:29:34,080 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-27 23:29:34,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:34,081 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:34,082 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:35,997 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-12-27 23:29:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:36,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:36,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:36,053 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,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:36,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:36,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [118077376] [2019-12-27 23:29:36,054 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:36,057 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:36,075 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 186 transitions. [2019-12-27 23:29:36,076 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:36,077 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:29:36,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:36,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:36,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:36,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=299, Unknown=1, NotChecked=0, Total=380 [2019-12-27 23:29:36,078 INFO L87 Difference]: Start difference. First operand 2030 states and 4958 transitions. Second operand 12 states. [2019-12-27 23:29:38,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:38,383 INFO L93 Difference]: Finished difference Result 3112 states and 7217 transitions. [2019-12-27 23:29:38,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:29:38,384 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:38,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:38,386 INFO L225 Difference]: With dead ends: 3112 [2019-12-27 23:29:38,387 INFO L226 Difference]: Without dead ends: 2949 [2019-12-27 23:29:38,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=260, Invalid=792, Unknown=4, NotChecked=0, Total=1056 [2019-12-27 23:29:38,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-12-27 23:29:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1998. [2019-12-27 23:29:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 23:29:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 4878 transitions. [2019-12-27 23:29:38,408 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 4878 transitions. Word has length 48 [2019-12-27 23:29:38,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:38,409 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 4878 transitions. [2019-12-27 23:29:38,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 4878 transitions. [2019-12-27 23:29:38,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:38,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:38,410 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:38,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:38,611 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:38,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:38,611 INFO L82 PathProgramCache]: Analyzing trace with hash 454674699, now seen corresponding path program 72 times [2019-12-27 23:29:38,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:38,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482978504] [2019-12-27 23:29:38,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:38,766 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:38,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482978504] [2019-12-27 23:29:38,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410567962] [2019-12-27 23:29:38,767 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 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:29:38,831 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-27 23:29:38,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:38,832 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:38,832 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:40,056 WARN L192 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-12-27 23:29:40,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:40,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:40,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:40,093 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:40,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:40,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:40,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1602293742] [2019-12-27 23:29:40,094 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:40,097 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:40,121 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:40,121 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:40,123 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:29:40,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:40,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:40,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:40,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:40,123 INFO L87 Difference]: Start difference. First operand 1998 states and 4878 transitions. Second operand 12 states. [2019-12-27 23:29:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:41,356 INFO L93 Difference]: Finished difference Result 3216 states and 7454 transitions. [2019-12-27 23:29:41,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:29:41,357 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:41,361 INFO L225 Difference]: With dead ends: 3216 [2019-12-27 23:29:41,361 INFO L226 Difference]: Without dead ends: 2997 [2019-12-27 23:29:41,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=279, Invalid=842, Unknown=1, NotChecked=0, Total=1122 [2019-12-27 23:29:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-12-27 23:29:41,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 2014. [2019-12-27 23:29:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-12-27 23:29:41,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 4918 transitions. [2019-12-27 23:29:41,388 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 4918 transitions. Word has length 48 [2019-12-27 23:29:41,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:41,389 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 4918 transitions. [2019-12-27 23:29:41,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:41,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 4918 transitions. [2019-12-27 23:29:41,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:41,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:41,390 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:41,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:41,591 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:41,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:41,591 INFO L82 PathProgramCache]: Analyzing trace with hash 907795809, now seen corresponding path program 73 times [2019-12-27 23:29:41,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:41,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145254466] [2019-12-27 23:29:41,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:41,734 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,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145254466] [2019-12-27 23:29:41,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819075170] [2019-12-27 23:29:41,734 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 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:29:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:41,779 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:41,780 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:42,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:42,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:42,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:42,913 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,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:42,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:42,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1390518895] [2019-12-27 23:29:42,914 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:42,917 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:42,937 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:42,938 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:42,939 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 23:29:42,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:42,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:42,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:42,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:42,940 INFO L87 Difference]: Start difference. First operand 2014 states and 4918 transitions. Second operand 12 states. [2019-12-27 23:29:43,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:43,833 INFO L93 Difference]: Finished difference Result 3012 states and 6997 transitions. [2019-12-27 23:29:43,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:29:43,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:43,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:43,837 INFO L225 Difference]: With dead ends: 3012 [2019-12-27 23:29:43,837 INFO L226 Difference]: Without dead ends: 2849 [2019-12-27 23:29:43,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=262, Invalid=793, Unknown=1, NotChecked=0, Total=1056 [2019-12-27 23:29:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2019-12-27 23:29:43,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 2030. [2019-12-27 23:29:43,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2030 states. [2019-12-27 23:29:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 4958 transitions. [2019-12-27 23:29:43,858 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 4958 transitions. Word has length 48 [2019-12-27 23:29:43,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:43,858 INFO L462 AbstractCegarLoop]: Abstraction has 2030 states and 4958 transitions. [2019-12-27 23:29:43,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:43,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 4958 transitions. [2019-12-27 23:29:43,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:43,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:43,859 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:44,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:44,060 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:44,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:44,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1158954397, now seen corresponding path program 74 times [2019-12-27 23:29:44,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:44,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929919505] [2019-12-27 23:29:44,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:44,215 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:44,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929919505] [2019-12-27 23:29:44,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866088247] [2019-12-27 23:29:44,215 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 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:29:44,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:29:44,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:44,260 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:44,261 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:44,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:44,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:44,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:44,418 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:44,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:44,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:44,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1733776823] [2019-12-27 23:29:44,419 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:44,422 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:44,436 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 138 transitions. [2019-12-27 23:29:44,436 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:44,437 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:29:44,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:44,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:44,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:44,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:44,438 INFO L87 Difference]: Start difference. First operand 2030 states and 4958 transitions. Second operand 12 states. [2019-12-27 23:29:44,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:44,875 INFO L93 Difference]: Finished difference Result 2972 states and 6914 transitions. [2019-12-27 23:29:44,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:29:44,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:44,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:44,878 INFO L225 Difference]: With dead ends: 2972 [2019-12-27 23:29:44,878 INFO L226 Difference]: Without dead ends: 2837 [2019-12-27 23:29:44,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:29:44,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2019-12-27 23:29:44,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 1966. [2019-12-27 23:29:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2019-12-27 23:29:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 4798 transitions. [2019-12-27 23:29:44,914 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 4798 transitions. Word has length 48 [2019-12-27 23:29:44,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:44,914 INFO L462 AbstractCegarLoop]: Abstraction has 1966 states and 4798 transitions. [2019-12-27 23:29:44,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:44,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 4798 transitions. [2019-12-27 23:29:44,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:44,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:44,916 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,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 98 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:45,116 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:45,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:45,117 INFO L82 PathProgramCache]: Analyzing trace with hash 299465675, now seen corresponding path program 75 times [2019-12-27 23:29:45,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:45,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484230839] [2019-12-27 23:29:45,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:45,257 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,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484230839] [2019-12-27 23:29:45,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354571605] [2019-12-27 23:29:45,257 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 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:29:45,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:29:45,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:45,305 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:45,305 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:45,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:45,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:45,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:45,468 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,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:45,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:45,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1305742567] [2019-12-27 23:29:45,469 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:45,473 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:45,502 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:45,502 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:45,504 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:29:45,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:45,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:45,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:45,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:45,504 INFO L87 Difference]: Start difference. First operand 1966 states and 4798 transitions. Second operand 12 states. [2019-12-27 23:29:46,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:46,021 INFO L93 Difference]: Finished difference Result 3348 states and 7717 transitions. [2019-12-27 23:29:46,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:29:46,021 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:46,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:46,025 INFO L225 Difference]: With dead ends: 3348 [2019-12-27 23:29:46,025 INFO L226 Difference]: Without dead ends: 3101 [2019-12-27 23:29:46,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=271, Invalid=851, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 23:29:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2019-12-27 23:29:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 2014. [2019-12-27 23:29:46,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-12-27 23:29:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 4918 transitions. [2019-12-27 23:29:46,047 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 4918 transitions. Word has length 48 [2019-12-27 23:29:46,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:46,047 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 4918 transitions. [2019-12-27 23:29:46,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:46,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 4918 transitions. [2019-12-27 23:29:46,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:46,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:46,049 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:46,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:46,252 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:46,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:46,253 INFO L82 PathProgramCache]: Analyzing trace with hash 309296705, now seen corresponding path program 76 times [2019-12-27 23:29:46,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:46,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858348844] [2019-12-27 23:29:46,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:46,395 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:46,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858348844] [2019-12-27 23:29:46,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723247450] [2019-12-27 23:29:46,396 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 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:29:46,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:29:46,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:46,458 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:46,458 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:47,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:47,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:47,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:47,773 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:47,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:47,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:47,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [903241543] [2019-12-27 23:29:47,773 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:47,776 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:47,797 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:47,797 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:47,799 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:29:47,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:47,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:47,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:47,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=297, Unknown=1, NotChecked=0, Total=380 [2019-12-27 23:29:47,800 INFO L87 Difference]: Start difference. First operand 2014 states and 4918 transitions. Second operand 12 states. [2019-12-27 23:29:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:51,921 INFO L93 Difference]: Finished difference Result 3172 states and 7320 transitions. [2019-12-27 23:29:51,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:29:51,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:51,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:51,924 INFO L225 Difference]: With dead ends: 3172 [2019-12-27 23:29:51,924 INFO L226 Difference]: Without dead ends: 2981 [2019-12-27 23:29:51,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=278, Invalid=836, Unknown=8, NotChecked=0, Total=1122 [2019-12-27 23:29:51,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2019-12-27 23:29:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2030. [2019-12-27 23:29:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2030 states. [2019-12-27 23:29:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 4958 transitions. [2019-12-27 23:29:51,948 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 4958 transitions. Word has length 48 [2019-12-27 23:29:51,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:51,949 INFO L462 AbstractCegarLoop]: Abstraction has 2030 states and 4958 transitions. [2019-12-27 23:29:51,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 4958 transitions. [2019-12-27 23:29:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:51,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:51,950 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:52,152 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:52,153 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:52,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:52,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1496444111, now seen corresponding path program 77 times [2019-12-27 23:29:52,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:52,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805485448] [2019-12-27 23:29:52,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:52,310 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:52,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805485448] [2019-12-27 23:29:52,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136597293] [2019-12-27 23:29:52,311 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 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:29:52,357 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-27 23:29:52,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:52,358 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:52,359 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:52,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:52,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:52,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:52,537 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:52,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:52,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:52,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1912437818] [2019-12-27 23:29:52,538 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:52,541 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:52,560 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 186 transitions. [2019-12-27 23:29:52,560 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:52,561 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:29:52,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:52,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:52,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:52,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:52,562 INFO L87 Difference]: Start difference. First operand 2030 states and 4958 transitions. Second operand 12 states. [2019-12-27 23:29:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:53,089 INFO L93 Difference]: Finished difference Result 3148 states and 7277 transitions. [2019-12-27 23:29:53,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:29:53,089 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:53,092 INFO L225 Difference]: With dead ends: 3148 [2019-12-27 23:29:53,092 INFO L226 Difference]: Without dead ends: 2985 [2019-12-27 23:29:53,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=847, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 23:29:53,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2019-12-27 23:29:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1998. [2019-12-27 23:29:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 23:29:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 4878 transitions. [2019-12-27 23:29:53,116 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 4878 transitions. Word has length 48 [2019-12-27 23:29:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:53,116 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 4878 transitions. [2019-12-27 23:29:53,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 4878 transitions. [2019-12-27 23:29:53,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:53,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:53,117 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:53,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 101 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:53,318 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:53,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:53,319 INFO L82 PathProgramCache]: Analyzing trace with hash 632616747, now seen corresponding path program 78 times [2019-12-27 23:29:53,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:53,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362936638] [2019-12-27 23:29:53,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:53,463 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:53,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362936638] [2019-12-27 23:29:53,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566271168] [2019-12-27 23:29:53,464 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 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:53,511 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 23:29:53,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:53,512 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:53,513 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:53,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:53,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:53,675 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:53,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:53,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:53,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1732597559] [2019-12-27 23:29:53,676 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:53,680 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:53,708 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:53,708 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:53,710 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 23:29:53,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:53,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:53,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:53,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:53,710 INFO L87 Difference]: Start difference. First operand 1998 states and 4878 transitions. Second operand 12 states. [2019-12-27 23:29:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:54,233 INFO L93 Difference]: Finished difference Result 3104 states and 7214 transitions. [2019-12-27 23:29:54,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:29:54,233 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:54,237 INFO L225 Difference]: With dead ends: 3104 [2019-12-27 23:29:54,237 INFO L226 Difference]: Without dead ends: 2885 [2019-12-27 23:29:54,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:29:54,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2019-12-27 23:29:54,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 2014. [2019-12-27 23:29:54,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-12-27 23:29:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 4918 transitions. [2019-12-27 23:29:54,259 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 4918 transitions. Word has length 48 [2019-12-27 23:29:54,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:54,260 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 4918 transitions. [2019-12-27 23:29:54,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 4918 transitions. [2019-12-27 23:29:54,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:54,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:54,261 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:54,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:54,462 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:54,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:54,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1085737857, now seen corresponding path program 79 times [2019-12-27 23:29:54,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:54,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551468871] [2019-12-27 23:29:54,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:54,599 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:54,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551468871] [2019-12-27 23:29:54,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228232200] [2019-12-27 23:29:54,600 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 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:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:54,647 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:54,648 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:54,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:54,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:54,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:54,791 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:54,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:54,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:54,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [174292261] [2019-12-27 23:29:54,791 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:54,794 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:54,816 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:54,816 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:54,817 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:29:54,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:54,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:54,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:54,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:54,818 INFO L87 Difference]: Start difference. First operand 2014 states and 4918 transitions. Second operand 12 states. [2019-12-27 23:29:55,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:55,334 INFO L93 Difference]: Finished difference Result 2992 states and 6937 transitions. [2019-12-27 23:29:55,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:29:55,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:55,337 INFO L225 Difference]: With dead ends: 2992 [2019-12-27 23:29:55,337 INFO L226 Difference]: Without dead ends: 2829 [2019-12-27 23:29:55,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=795, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:29:55,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2019-12-27 23:29:55,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2030. [2019-12-27 23:29:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2030 states. [2019-12-27 23:29:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 4958 transitions. [2019-12-27 23:29:55,361 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 4958 transitions. Word has length 48 [2019-12-27 23:29:55,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:55,361 INFO L462 AbstractCegarLoop]: Abstraction has 2030 states and 4958 transitions. [2019-12-27 23:29:55,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 4958 transitions. [2019-12-27 23:29:55,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:55,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:55,362 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,562 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:55,563 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:55,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:55,563 INFO L82 PathProgramCache]: Analyzing trace with hash -147028073, now seen corresponding path program 80 times [2019-12-27 23:29:55,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:55,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161956009] [2019-12-27 23:29:55,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:55,729 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,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161956009] [2019-12-27 23:29:55,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821210362] [2019-12-27 23:29:55,729 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 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:55,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:29:55,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:55,775 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:55,776 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:55,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:55,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:55,915 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,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:55,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:55,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [319963778] [2019-12-27 23:29:55,915 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:55,918 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:55,935 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 162 transitions. [2019-12-27 23:29:55,935 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:55,936 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:29:55,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:55,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:55,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:55,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:55,936 INFO L87 Difference]: Start difference. First operand 2030 states and 4958 transitions. Second operand 12 states. [2019-12-27 23:29:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:56,417 INFO L93 Difference]: Finished difference Result 2980 states and 6914 transitions. [2019-12-27 23:29:56,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:29:56,418 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:56,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:56,421 INFO L225 Difference]: With dead ends: 2980 [2019-12-27 23:29:56,422 INFO L226 Difference]: Without dead ends: 2845 [2019-12-27 23:29:56,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=797, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:29:56,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2019-12-27 23:29:56,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 1982. [2019-12-27 23:29:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-27 23:29:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4838 transitions. [2019-12-27 23:29:56,444 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4838 transitions. Word has length 48 [2019-12-27 23:29:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:56,444 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4838 transitions. [2019-12-27 23:29:56,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4838 transitions. [2019-12-27 23:29:56,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:56,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:56,446 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:56,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 104 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:56,646 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:56,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:56,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1066108661, now seen corresponding path program 81 times [2019-12-27 23:29:56,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:56,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827985025] [2019-12-27 23:29:56,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:56,807 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:56,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827985025] [2019-12-27 23:29:56,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798362726] [2019-12-27 23:29:56,807 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 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:56,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:29:56,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:56,857 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:56,858 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:29:57,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:57,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:57,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:29:57,952 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:57,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:29:57,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:29:57,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [401200858] [2019-12-27 23:29:57,952 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:29:57,955 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:29:57,977 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:29:57,978 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:29:57,979 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:29:57,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:29:57,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:29:57,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:29:57,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:29:57,979 INFO L87 Difference]: Start difference. First operand 1982 states and 4838 transitions. Second operand 12 states. [2019-12-27 23:29:59,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:29:59,507 INFO L93 Difference]: Finished difference Result 3144 states and 7294 transitions. [2019-12-27 23:29:59,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:29:59,508 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-27 23:29:59,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:29:59,512 INFO L225 Difference]: With dead ends: 3144 [2019-12-27 23:29:59,512 INFO L226 Difference]: Without dead ends: 2925 [2019-12-27 23:29:59,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=254, Invalid=801, Unknown=1, NotChecked=0, Total=1056 [2019-12-27 23:29:59,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2019-12-27 23:29:59,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2014. [2019-12-27 23:29:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-12-27 23:29:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 4918 transitions. [2019-12-27 23:29:59,547 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 4918 transitions. Word has length 48 [2019-12-27 23:29:59,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:29:59,547 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 4918 transitions. [2019-12-27 23:29:59,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:29:59,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 4918 transitions. [2019-12-27 23:29:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 23:29:59,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:29:59,549 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:59,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 105 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:29:59,752 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:29:59,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:29:59,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1056277631, now seen corresponding path program 82 times [2019-12-27 23:29:59,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:29:59,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404193043] [2019-12-27 23:29:59,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:29:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:29:59,898 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:59,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404193043] [2019-12-27 23:29:59,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400090149] [2019-12-27 23:29:59,899 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 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:59,945 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:29:59,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:29:59,946 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:29:59,947 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:01,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:01,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:01,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:01,764 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:30:01,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:01,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-27 23:30:01,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1820132029] [2019-12-27 23:30:01,764 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:01,767 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:01,790 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 210 transitions. [2019-12-27 23:30:01,790 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:01,791 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:30:01,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:30:01,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:01,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:30:01,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:30:01,792 INFO L87 Difference]: Start difference. First operand 2014 states and 4918 transitions. Second operand 12 states. Received shutdown request... [2019-12-27 23:30:05,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:30:05,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:05,742 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 23:30:05,748 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 23:30:05,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:30:05 BasicIcfg [2019-12-27 23:30:05,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:30:05,750 INFO L168 Benchmark]: Toolchain (without parser) took 276515.44 ms. Allocated memory was 142.6 MB in the beginning and 363.9 MB in the end (delta: 221.2 MB). Free memory was 101.3 MB in the beginning and 53.8 MB in the end (delta: 47.5 MB). Peak memory consumption was 268.7 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:05,750 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 142.6 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 23:30:05,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.03 ms. Allocated memory was 142.6 MB in the beginning and 202.4 MB in the end (delta: 59.8 MB). Free memory was 100.9 MB in the beginning and 161.6 MB in the end (delta: -60.7 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:05,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.94 ms. Allocated memory is still 202.4 MB. Free memory was 161.6 MB in the beginning and 159.6 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:05,751 INFO L168 Benchmark]: Boogie Preprocessor took 26.43 ms. Allocated memory is still 202.4 MB. Free memory was 159.6 MB in the beginning and 158.3 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:05,751 INFO L168 Benchmark]: RCFGBuilder took 413.16 ms. Allocated memory is still 202.4 MB. Free memory was 158.3 MB in the beginning and 138.9 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:05,752 INFO L168 Benchmark]: TraceAbstraction took 275342.90 ms. Allocated memory was 202.4 MB in the beginning and 363.9 MB in the end (delta: 161.5 MB). Free memory was 138.3 MB in the beginning and 53.8 MB in the end (delta: 84.4 MB). Peak memory consumption was 245.9 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:05,753 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.18 ms. Allocated memory is still 142.6 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 678.03 ms. Allocated memory was 142.6 MB in the beginning and 202.4 MB in the end (delta: 59.8 MB). Free memory was 100.9 MB in the beginning and 161.6 MB in the end (delta: -60.7 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.94 ms. Allocated memory is still 202.4 MB. Free memory was 161.6 MB in the beginning and 159.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.43 ms. Allocated memory is still 202.4 MB. Free memory was 159.6 MB in the beginning and 158.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 413.16 ms. Allocated memory is still 202.4 MB. Free memory was 158.3 MB in the beginning and 138.9 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 275342.90 ms. Allocated memory was 202.4 MB in the beginning and 363.9 MB in the end (delta: 161.5 MB). Free memory was 138.3 MB in the beginning and 53.8 MB in the end (delta: 84.4 MB). Peak memory consumption was 245.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 711]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 711). Cancelled while BasicCegarLoop was constructing difference of abstraction (2014states) and FLOYD_HOARE automaton (currently 14 states, 12 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 30 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 1 error locations. Result: TIMEOUT, OverallTime: 275.2s, OverallIterations: 108, TraceHistogramMax: 7, AutomataDifference: 122.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5825 SDtfs, 49600 SDslu, 44415 SDs, 0 SdLazy, 7657 SolverSat, 2986 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8017 GetRequests, 5168 SyntacticMatches, 0 SemanticMatches, 2848 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 12635 ImplicationChecksByTransitivity, 224.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2030occurred in iteration=90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 107 MinimizatonAttempts, 67001 StatesRemovedByMinimization, 106 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 117.7s InterpolantComputationTime, 9248 NumberOfCodeBlocks, 9248 NumberOfCodeBlocksAsserted, 409 NumberOfCheckSat, 9035 ConstructedInterpolants, 220 QuantifiedInterpolants, 4502000 SizeOfPredicates, 429 NumberOfNonLiveVariables, 12203 ConjunctsInSsa, 1370 ConjunctsInUnsatCore, 213 InterpolantComputations, 4 PerfectInterpolantSequences, 116/3772 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