/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:23:39,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:23:39,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:23:39,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:23:39,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:23:39,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:23:39,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:23:39,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:23:39,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:23:39,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:23:39,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:23:39,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:23:39,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:23:39,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:23:39,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:23:39,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:23:39,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:23:39,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:23:39,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:23:39,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:23:39,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:23:39,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:23:39,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:23:39,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:23:39,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:23:39,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:23:39,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:23:39,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:23:39,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:23:39,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:23:39,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:23:39,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:23:39,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:23:39,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:23:39,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:23:39,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:23:39,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:23:39,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:23:39,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:23:39,157 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:23:39,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:23:39,159 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-VariableLbe.epf [2019-12-18 23:23:39,173 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:23:39,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:23:39,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:23:39,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:23:39,175 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:23:39,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:23:39,175 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:23:39,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:23:39,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:23:39,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:23:39,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:23:39,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:23:39,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:23:39,176 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:23:39,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:23:39,177 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:23:39,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:23:39,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:23:39,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:23:39,178 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:23:39,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:23:39,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:23:39,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:23:39,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:23:39,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:23:39,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:23:39,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:23:39,179 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:23:39,179 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:23:39,179 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:23:39,460 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:23:39,483 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:23:39,487 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:23:39,489 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:23:39,489 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:23:39,490 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2019-12-18 23:23:39,565 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21aed2676/c290a6ab7f0a4f81aceae1eaf7f4d890/FLAG8359539ae [2019-12-18 23:23:40,165 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:23:40,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2019-12-18 23:23:40,183 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21aed2676/c290a6ab7f0a4f81aceae1eaf7f4d890/FLAG8359539ae [2019-12-18 23:23:40,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21aed2676/c290a6ab7f0a4f81aceae1eaf7f4d890 [2019-12-18 23:23:40,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:23:40,436 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:23:40,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:23:40,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:23:40,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:23:40,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:23:40" (1/1) ... [2019-12-18 23:23:40,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e483e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:40, skipping insertion in model container [2019-12-18 23:23:40,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:23:40" (1/1) ... [2019-12-18 23:23:40,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:23:40,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:23:40,684 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 23:23:41,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:23:41,046 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:23:41,070 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 23:23:41,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:23:41,232 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:23:41,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:41 WrapperNode [2019-12-18 23:23:41,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:23:41,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:23:41,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:23:41,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:23:41,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:41" (1/1) ... [2019-12-18 23:23:41,259 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:41" (1/1) ... [2019-12-18 23:23:41,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:23:41,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:23:41,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:23:41,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:23:41,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:41" (1/1) ... [2019-12-18 23:23:41,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:41" (1/1) ... [2019-12-18 23:23:41,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:41" (1/1) ... [2019-12-18 23:23:41,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:41" (1/1) ... [2019-12-18 23:23:41,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:41" (1/1) ... [2019-12-18 23:23:41,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:41" (1/1) ... [2019-12-18 23:23:41,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:41" (1/1) ... [2019-12-18 23:23:41,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:23:41,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:23:41,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:23:41,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:23:41,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:41" (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-18 23:23:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2019-12-18 23:23:41,395 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2019-12-18 23:23:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:23:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:23:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 23:23:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:23:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:23:41,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:23:41,398 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 23:23:41,899 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:23:41,899 INFO L287 CfgBuilder]: Removed 19 assume(true) statements. [2019-12-18 23:23:41,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:23:41 BoogieIcfgContainer [2019-12-18 23:23:41,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:23:41,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:23:41,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:23:41,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:23:41,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:23:40" (1/3) ... [2019-12-18 23:23:41,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cdec2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:23:41, skipping insertion in model container [2019-12-18 23:23:41,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:23:41" (2/3) ... [2019-12-18 23:23:41,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cdec2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:23:41, skipping insertion in model container [2019-12-18 23:23:41,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:23:41" (3/3) ... [2019-12-18 23:23:41,909 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2019-12-18 23:23:41,919 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:23:41,919 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:23:41,926 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-12-18 23:23:41,927 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:23:41,957 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,958 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,958 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,958 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,959 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,959 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,959 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,959 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,960 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,960 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,960 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,961 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,961 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,961 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,961 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,962 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,962 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,962 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,962 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,963 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,963 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,963 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,964 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,964 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,964 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,965 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,965 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,965 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,965 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,965 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,966 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,966 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,966 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,966 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,967 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,967 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,967 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,967 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,967 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,968 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,968 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,968 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,968 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,969 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,969 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,969 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,969 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,970 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,970 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,970 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,970 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,971 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,971 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,971 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,971 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,972 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,972 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,972 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,972 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,973 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,973 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,973 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,973 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,974 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,974 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,974 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,974 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,975 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,975 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,975 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,975 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,976 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,976 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,976 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,976 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,977 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,977 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,977 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,977 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,978 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,978 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,978 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,978 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,979 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,979 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,979 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,979 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,980 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,980 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,980 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,980 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,981 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,981 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,981 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,981 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,981 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,982 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,982 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,982 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,982 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,983 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,983 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,983 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,983 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,983 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,984 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,984 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,984 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,985 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,985 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,985 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,985 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,986 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,986 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,986 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,986 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,986 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,987 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,987 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,987 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,987 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,988 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,988 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,988 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,989 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,989 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,989 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,989 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,994 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,994 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,994 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,995 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,995 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,995 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,995 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,996 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,996 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,996 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,996 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,997 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,997 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,997 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,997 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,997 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,998 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,998 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,998 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,998 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,999 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,999 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,999 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,999 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:41,999 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:42,000 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:42,000 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:42,000 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:42,000 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:23:42,022 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 23:23:42,046 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:23:42,047 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:23:42,047 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:23:42,047 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:23:42,047 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:23:42,047 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:23:42,047 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:23:42,048 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:23:42,073 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 128 transitions [2019-12-18 23:23:42,075 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 122 places, 128 transitions [2019-12-18 23:23:42,158 INFO L126 PetriNetUnfolder]: 10/127 cut-off events. [2019-12-18 23:23:42,158 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:23:42,167 INFO L76 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 127 events. 10/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 245 event pairs. 6/120 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2019-12-18 23:23:42,176 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 122 places, 128 transitions [2019-12-18 23:23:42,201 INFO L126 PetriNetUnfolder]: 10/127 cut-off events. [2019-12-18 23:23:42,201 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:23:42,204 INFO L76 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 127 events. 10/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 245 event pairs. 6/120 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2019-12-18 23:23:42,211 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4968 [2019-12-18 23:23:42,213 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:23:44,251 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-12-18 23:23:44,706 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5914 [2019-12-18 23:23:44,706 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 23:23:44,710 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 34 transitions [2019-12-18 23:23:44,725 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 139 states. [2019-12-18 23:23:44,727 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-12-18 23:23:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 23:23:44,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:23:44,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 23:23:44,735 INFO L410 AbstractCegarLoop]: === Iteration 1 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:23:44,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:23:44,741 INFO L82 PathProgramCache]: Analyzing trace with hash 485339031, now seen corresponding path program 1 times [2019-12-18 23:23:44,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:23:44,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929756503] [2019-12-18 23:23:44,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:23:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:23:44,915 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-18 23:23:44,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929756503] [2019-12-18 23:23:44,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:23:44,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:23:44,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112297874] [2019-12-18 23:23:44,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-18 23:23:44,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:23:44,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-18 23:23:44,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 23:23:44,941 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 2 states. [2019-12-18 23:23:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:23:44,963 INFO L93 Difference]: Finished difference Result 139 states and 298 transitions. [2019-12-18 23:23:44,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-18 23:23:44,965 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-12-18 23:23:44,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:23:44,986 INFO L225 Difference]: With dead ends: 139 [2019-12-18 23:23:44,987 INFO L226 Difference]: Without dead ends: 128 [2019-12-18 23:23:44,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 23:23:45,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-18 23:23:45,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-12-18 23:23:45,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-18 23:23:45,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 277 transitions. [2019-12-18 23:23:45,043 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 277 transitions. Word has length 5 [2019-12-18 23:23:45,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:23:45,044 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 277 transitions. [2019-12-18 23:23:45,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-18 23:23:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 277 transitions. [2019-12-18 23:23:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-18 23:23:45,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:23:45,045 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-18 23:23:45,045 INFO L410 AbstractCegarLoop]: === Iteration 2 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:23:45,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:23:45,046 INFO L82 PathProgramCache]: Analyzing trace with hash -2134363384, now seen corresponding path program 1 times [2019-12-18 23:23:45,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:23:45,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160661884] [2019-12-18 23:23:45,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:23:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:23:45,157 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-18 23:23:45,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160661884] [2019-12-18 23:23:45,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:23:45,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:23:45,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562782315] [2019-12-18 23:23:45,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:23:45,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:23:45,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:23:45,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:23:45,161 INFO L87 Difference]: Start difference. First operand 128 states and 277 transitions. Second operand 3 states. [2019-12-18 23:23:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:23:45,221 INFO L93 Difference]: Finished difference Result 200 states and 438 transitions. [2019-12-18 23:23:45,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:23:45,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-18 23:23:45,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:23:45,227 INFO L225 Difference]: With dead ends: 200 [2019-12-18 23:23:45,227 INFO L226 Difference]: Without dead ends: 200 [2019-12-18 23:23:45,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:23:45,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-12-18 23:23:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 155. [2019-12-18 23:23:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-18 23:23:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 343 transitions. [2019-12-18 23:23:45,273 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 343 transitions. Word has length 6 [2019-12-18 23:23:45,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:23:45,274 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 343 transitions. [2019-12-18 23:23:45,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:23:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 343 transitions. [2019-12-18 23:23:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-18 23:23:45,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:23:45,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:23:45,275 INFO L410 AbstractCegarLoop]: === Iteration 3 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:23:45,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:23:45,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1264596255, now seen corresponding path program 1 times [2019-12-18 23:23:45,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:23:45,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739775171] [2019-12-18 23:23:45,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:23:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:23:45,453 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-18 23:23:45,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739775171] [2019-12-18 23:23:45,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:23:45,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:23:45,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421850110] [2019-12-18 23:23:45,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:23:45,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:23:45,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:23:45,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:23:45,457 INFO L87 Difference]: Start difference. First operand 155 states and 343 transitions. Second operand 7 states. [2019-12-18 23:23:45,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:23:45,783 INFO L93 Difference]: Finished difference Result 181 states and 391 transitions. [2019-12-18 23:23:45,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 23:23:45,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-18 23:23:45,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:23:45,787 INFO L225 Difference]: With dead ends: 181 [2019-12-18 23:23:45,787 INFO L226 Difference]: Without dead ends: 162 [2019-12-18 23:23:45,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-18 23:23:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-18 23:23:45,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-12-18 23:23:45,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-18 23:23:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 359 transitions. [2019-12-18 23:23:45,802 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 359 transitions. Word has length 10 [2019-12-18 23:23:45,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:23:45,802 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 359 transitions. [2019-12-18 23:23:45,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:23:45,802 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 359 transitions. [2019-12-18 23:23:45,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 23:23:45,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:23:45,809 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:23:45,810 INFO L410 AbstractCegarLoop]: === Iteration 4 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:23:45,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:23:45,810 INFO L82 PathProgramCache]: Analyzing trace with hash -328941052, now seen corresponding path program 1 times [2019-12-18 23:23:45,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:23:45,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860355490] [2019-12-18 23:23:45,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:23:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:23:46,354 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-18 23:23:46,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860355490] [2019-12-18 23:23:46,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:23:46,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:23:46,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584174492] [2019-12-18 23:23:46,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:23:46,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:23:46,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:23:46,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:23:46,357 INFO L87 Difference]: Start difference. First operand 162 states and 359 transitions. Second operand 13 states. [2019-12-18 23:23:48,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:23:48,108 INFO L93 Difference]: Finished difference Result 205 states and 441 transitions. [2019-12-18 23:23:48,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 23:23:48,110 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-18 23:23:48,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:23:48,111 INFO L225 Difference]: With dead ends: 205 [2019-12-18 23:23:48,111 INFO L226 Difference]: Without dead ends: 195 [2019-12-18 23:23:48,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2019-12-18 23:23:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-12-18 23:23:48,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 183. [2019-12-18 23:23:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-12-18 23:23:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 401 transitions. [2019-12-18 23:23:48,125 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 401 transitions. Word has length 16 [2019-12-18 23:23:48,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:23:48,125 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 401 transitions. [2019-12-18 23:23:48,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:23:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 401 transitions. [2019-12-18 23:23:48,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 23:23:48,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:23:48,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:23:48,127 INFO L410 AbstractCegarLoop]: === Iteration 5 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:23:48,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:23:48,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1380096900, now seen corresponding path program 2 times [2019-12-18 23:23:48,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:23:48,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238155668] [2019-12-18 23:23:48,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:23:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:23:48,459 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-18 23:23:48,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238155668] [2019-12-18 23:23:48,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:23:48,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 23:23:48,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487074124] [2019-12-18 23:23:48,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 23:23:48,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:23:48,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 23:23:48,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:23:48,461 INFO L87 Difference]: Start difference. First operand 183 states and 401 transitions. Second operand 12 states. [2019-12-18 23:23:49,940 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-12-18 23:23:50,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:23:50,411 INFO L93 Difference]: Finished difference Result 218 states and 464 transitions. [2019-12-18 23:23:50,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 23:23:50,412 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-12-18 23:23:50,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:23:50,414 INFO L225 Difference]: With dead ends: 218 [2019-12-18 23:23:50,414 INFO L226 Difference]: Without dead ends: 208 [2019-12-18 23:23:50,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2019-12-18 23:23:50,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-12-18 23:23:50,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 185. [2019-12-18 23:23:50,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-12-18 23:23:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 401 transitions. [2019-12-18 23:23:50,438 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 401 transitions. Word has length 16 [2019-12-18 23:23:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:23:50,439 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 401 transitions. [2019-12-18 23:23:50,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 23:23:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 401 transitions. [2019-12-18 23:23:50,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 23:23:50,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:23:50,443 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:23:50,444 INFO L410 AbstractCegarLoop]: === Iteration 6 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:23:50,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:23:50,444 INFO L82 PathProgramCache]: Analyzing trace with hash 391036352, now seen corresponding path program 3 times [2019-12-18 23:23:50,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:23:50,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568233513] [2019-12-18 23:23:50,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:23:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:23:50,821 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-18 23:23:50,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568233513] [2019-12-18 23:23:50,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:23:50,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 23:23:50,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109169807] [2019-12-18 23:23:50,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 23:23:50,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:23:50,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 23:23:50,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:23:50,823 INFO L87 Difference]: Start difference. First operand 185 states and 401 transitions. Second operand 12 states. [2019-12-18 23:23:52,243 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-12-18 23:23:52,464 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-12-18 23:23:52,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:23:52,886 INFO L93 Difference]: Finished difference Result 216 states and 456 transitions. [2019-12-18 23:23:52,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 23:23:52,887 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-12-18 23:23:52,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:23:52,889 INFO L225 Difference]: With dead ends: 216 [2019-12-18 23:23:52,889 INFO L226 Difference]: Without dead ends: 206 [2019-12-18 23:23:52,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=277, Invalid=653, Unknown=0, NotChecked=0, Total=930 [2019-12-18 23:23:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-12-18 23:23:52,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 185. [2019-12-18 23:23:52,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-12-18 23:23:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 401 transitions. [2019-12-18 23:23:52,897 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 401 transitions. Word has length 16 [2019-12-18 23:23:52,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:23:52,897 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 401 transitions. [2019-12-18 23:23:52,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 23:23:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 401 transitions. [2019-12-18 23:23:52,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 23:23:52,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:23:52,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:23:52,899 INFO L410 AbstractCegarLoop]: === Iteration 7 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:23:52,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:23:52,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1177563524, now seen corresponding path program 4 times [2019-12-18 23:23:52,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:23:52,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956157815] [2019-12-18 23:23:52,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:23:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:23:53,345 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-18 23:23:53,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956157815] [2019-12-18 23:23:53,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:23:53,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:23:53,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776705830] [2019-12-18 23:23:53,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:23:53,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:23:53,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:23:53,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:23:53,348 INFO L87 Difference]: Start difference. First operand 185 states and 401 transitions. Second operand 13 states. [2019-12-18 23:23:54,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:23:54,743 INFO L93 Difference]: Finished difference Result 201 states and 426 transitions. [2019-12-18 23:23:54,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:23:54,744 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-18 23:23:54,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:23:54,746 INFO L225 Difference]: With dead ends: 201 [2019-12-18 23:23:54,746 INFO L226 Difference]: Without dead ends: 191 [2019-12-18 23:23:54,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2019-12-18 23:23:54,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-18 23:23:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2019-12-18 23:23:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-18 23:23:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 371 transitions. [2019-12-18 23:23:54,754 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 371 transitions. Word has length 16 [2019-12-18 23:23:54,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:23:54,754 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 371 transitions. [2019-12-18 23:23:54,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:23:54,755 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 371 transitions. [2019-12-18 23:23:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 23:23:54,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:23:54,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:23:54,756 INFO L410 AbstractCegarLoop]: === Iteration 8 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:23:54,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:23:54,757 INFO L82 PathProgramCache]: Analyzing trace with hash -960067854, now seen corresponding path program 1 times [2019-12-18 23:23:54,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:23:54,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847410049] [2019-12-18 23:23:54,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:23:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:23:55,318 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 36 [2019-12-18 23:23:55,644 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-18 23:23:55,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847410049] [2019-12-18 23:23:55,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:23:55,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:23:55,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862181210] [2019-12-18 23:23:55,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:23:55,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:23:55,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:23:55,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:23:55,646 INFO L87 Difference]: Start difference. First operand 170 states and 371 transitions. Second operand 16 states. [2019-12-18 23:23:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:23:57,214 INFO L93 Difference]: Finished difference Result 261 states and 568 transitions. [2019-12-18 23:23:57,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:23:57,214 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-18 23:23:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:23:57,217 INFO L225 Difference]: With dead ends: 261 [2019-12-18 23:23:57,217 INFO L226 Difference]: Without dead ends: 261 [2019-12-18 23:23:57,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2019-12-18 23:23:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-12-18 23:23:57,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 237. [2019-12-18 23:23:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-18 23:23:57,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 518 transitions. [2019-12-18 23:23:57,229 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 518 transitions. Word has length 18 [2019-12-18 23:23:57,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:23:57,230 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 518 transitions. [2019-12-18 23:23:57,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:23:57,230 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 518 transitions. [2019-12-18 23:23:57,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 23:23:57,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:23:57,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:23:57,232 INFO L410 AbstractCegarLoop]: === Iteration 9 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:23:57,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:23:57,232 INFO L82 PathProgramCache]: Analyzing trace with hash 747896946, now seen corresponding path program 2 times [2019-12-18 23:23:57,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:23:57,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623644425] [2019-12-18 23:23:57,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:23:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:23:57,636 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2019-12-18 23:23:57,790 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-12-18 23:23:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:23:58,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623644425] [2019-12-18 23:23:58,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:23:58,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:23:58,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097572861] [2019-12-18 23:23:58,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 23:23:58,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:23:58,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 23:23:58,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:23:58,124 INFO L87 Difference]: Start difference. First operand 237 states and 518 transitions. Second operand 15 states. [2019-12-18 23:23:58,842 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2019-12-18 23:23:59,027 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2019-12-18 23:23:59,215 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-12-18 23:24:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:00,017 INFO L93 Difference]: Finished difference Result 307 states and 673 transitions. [2019-12-18 23:24:00,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:24:00,018 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-18 23:24:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:00,021 INFO L225 Difference]: With dead ends: 307 [2019-12-18 23:24:00,021 INFO L226 Difference]: Without dead ends: 307 [2019-12-18 23:24:00,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-12-18 23:24:00,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-18 23:24:00,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 237. [2019-12-18 23:24:00,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-18 23:24:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 518 transitions. [2019-12-18 23:24:00,031 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 518 transitions. Word has length 18 [2019-12-18 23:24:00,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:00,031 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 518 transitions. [2019-12-18 23:24:00,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 23:24:00,031 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 518 transitions. [2019-12-18 23:24:00,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 23:24:00,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:00,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:24:00,032 INFO L410 AbstractCegarLoop]: === Iteration 10 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:24:00,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:00,033 INFO L82 PathProgramCache]: Analyzing trace with hash -603037424, now seen corresponding path program 3 times [2019-12-18 23:24:00,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:00,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951514284] [2019-12-18 23:24:00,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:00,824 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-18 23:24:00,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951514284] [2019-12-18 23:24:00,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:00,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:00,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218355091] [2019-12-18 23:24:00,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 23:24:00,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:00,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 23:24:00,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:24:00,826 INFO L87 Difference]: Start difference. First operand 237 states and 518 transitions. Second operand 15 states. [2019-12-18 23:24:01,531 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-12-18 23:24:01,696 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 51 [2019-12-18 23:24:01,989 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-12-18 23:24:02,156 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-12-18 23:24:03,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:03,044 INFO L93 Difference]: Finished difference Result 304 states and 667 transitions. [2019-12-18 23:24:03,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 23:24:03,044 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-18 23:24:03,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:03,048 INFO L225 Difference]: With dead ends: 304 [2019-12-18 23:24:03,048 INFO L226 Difference]: Without dead ends: 304 [2019-12-18 23:24:03,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:24:03,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-12-18 23:24:03,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 237. [2019-12-18 23:24:03,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-18 23:24:03,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 518 transitions. [2019-12-18 23:24:03,056 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 518 transitions. Word has length 18 [2019-12-18 23:24:03,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:03,056 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 518 transitions. [2019-12-18 23:24:03,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 23:24:03,057 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 518 transitions. [2019-12-18 23:24:03,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 23:24:03,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:03,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:24:03,058 INFO L410 AbstractCegarLoop]: === Iteration 11 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:24:03,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:03,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1345703600, now seen corresponding path program 4 times [2019-12-18 23:24:03,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:03,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105687476] [2019-12-18 23:24:03,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:03,715 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-18 23:24:03,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105687476] [2019-12-18 23:24:03,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:03,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:03,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181637611] [2019-12-18 23:24:03,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 23:24:03,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:03,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 23:24:03,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:24:03,717 INFO L87 Difference]: Start difference. First operand 237 states and 518 transitions. Second operand 15 states. [2019-12-18 23:24:04,447 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-12-18 23:24:04,647 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-12-18 23:24:04,787 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-12-18 23:24:04,973 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-12-18 23:24:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:05,929 INFO L93 Difference]: Finished difference Result 419 states and 934 transitions. [2019-12-18 23:24:05,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 23:24:05,931 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-18 23:24:05,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:05,935 INFO L225 Difference]: With dead ends: 419 [2019-12-18 23:24:05,935 INFO L226 Difference]: Without dead ends: 419 [2019-12-18 23:24:05,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2019-12-18 23:24:05,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-12-18 23:24:05,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 243. [2019-12-18 23:24:05,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-18 23:24:05,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 531 transitions. [2019-12-18 23:24:05,951 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 531 transitions. Word has length 18 [2019-12-18 23:24:05,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:05,952 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 531 transitions. [2019-12-18 23:24:05,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 23:24:05,953 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 531 transitions. [2019-12-18 23:24:05,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 23:24:05,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:05,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:24:05,954 INFO L410 AbstractCegarLoop]: === Iteration 12 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:24:05,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:05,955 INFO L82 PathProgramCache]: Analyzing trace with hash -551517266, now seen corresponding path program 5 times [2019-12-18 23:24:05,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:05,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102732280] [2019-12-18 23:24:05,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:06,657 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-18 23:24:06,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102732280] [2019-12-18 23:24:06,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:06,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:24:06,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657090458] [2019-12-18 23:24:06,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 23:24:06,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:06,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 23:24:06,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:24:06,664 INFO L87 Difference]: Start difference. First operand 243 states and 531 transitions. Second operand 15 states. [2019-12-18 23:24:07,288 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-12-18 23:24:07,560 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-12-18 23:24:07,782 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2019-12-18 23:24:07,988 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-12-18 23:24:08,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:08,802 INFO L93 Difference]: Finished difference Result 322 states and 704 transitions. [2019-12-18 23:24:08,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 23:24:08,802 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-18 23:24:08,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:08,805 INFO L225 Difference]: With dead ends: 322 [2019-12-18 23:24:08,806 INFO L226 Difference]: Without dead ends: 322 [2019-12-18 23:24:08,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2019-12-18 23:24:08,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-12-18 23:24:08,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 243. [2019-12-18 23:24:08,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-18 23:24:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 531 transitions. [2019-12-18 23:24:08,814 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 531 transitions. Word has length 18 [2019-12-18 23:24:08,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:08,814 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 531 transitions. [2019-12-18 23:24:08,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 23:24:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 531 transitions. [2019-12-18 23:24:08,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 23:24:08,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:08,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:24:08,815 INFO L410 AbstractCegarLoop]: === Iteration 13 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:24:08,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:08,816 INFO L82 PathProgramCache]: Analyzing trace with hash -442477206, now seen corresponding path program 6 times [2019-12-18 23:24:08,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:08,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012808491] [2019-12-18 23:24:08,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:09,293 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 36 [2019-12-18 23:24:09,577 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-18 23:24:09,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012808491] [2019-12-18 23:24:09,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:24:09,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 23:24:09,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339477693] [2019-12-18 23:24:09,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 23:24:09,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:09,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 23:24:09,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:24:09,579 INFO L87 Difference]: Start difference. First operand 243 states and 531 transitions. Second operand 16 states. [2019-12-18 23:24:10,536 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-12-18 23:24:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:11,175 INFO L93 Difference]: Finished difference Result 301 states and 662 transitions. [2019-12-18 23:24:11,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 23:24:11,176 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-18 23:24:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:11,178 INFO L225 Difference]: With dead ends: 301 [2019-12-18 23:24:11,178 INFO L226 Difference]: Without dead ends: 301 [2019-12-18 23:24:11,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2019-12-18 23:24:11,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-18 23:24:11,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 222. [2019-12-18 23:24:11,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-18 23:24:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 489 transitions. [2019-12-18 23:24:11,187 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 489 transitions. Word has length 18 [2019-12-18 23:24:11,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:11,187 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 489 transitions. [2019-12-18 23:24:11,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 23:24:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 489 transitions. [2019-12-18 23:24:11,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:24:11,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:11,189 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] [2019-12-18 23:24:11,189 INFO L410 AbstractCegarLoop]: === Iteration 14 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:24:11,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:11,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1193789261, now seen corresponding path program 1 times [2019-12-18 23:24:11,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:11,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778177100] [2019-12-18 23:24:11,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:11,225 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-18 23:24:11,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778177100] [2019-12-18 23:24:11,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092447] [2019-12-18 23:24:11,226 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-18 23:24:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:11,329 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-18 23:24:11,337 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:24:11,356 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-18 23:24:11,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:24:11,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-18 23:24:11,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102279676] [2019-12-18 23:24:11,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:24:11,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:11,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:24:11,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:24:11,359 INFO L87 Difference]: Start difference. First operand 222 states and 489 transitions. Second operand 4 states. [2019-12-18 23:24:11,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:11,380 INFO L93 Difference]: Finished difference Result 326 states and 718 transitions. [2019-12-18 23:24:11,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:24:11,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-18 23:24:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:11,387 INFO L225 Difference]: With dead ends: 326 [2019-12-18 23:24:11,387 INFO L226 Difference]: Without dead ends: 326 [2019-12-18 23:24:11,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:24:11,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-12-18 23:24:11,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 278. [2019-12-18 23:24:11,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-12-18 23:24:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 624 transitions. [2019-12-18 23:24:11,396 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 624 transitions. Word has length 21 [2019-12-18 23:24:11,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:11,397 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 624 transitions. [2019-12-18 23:24:11,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:24:11,397 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 624 transitions. [2019-12-18 23:24:11,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:24:11,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:11,399 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:24:11,604 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:24:11,605 INFO L410 AbstractCegarLoop]: === Iteration 15 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:24:11,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:11,606 INFO L82 PathProgramCache]: Analyzing trace with hash 554824476, now seen corresponding path program 7 times [2019-12-18 23:24:11,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:11,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411904784] [2019-12-18 23:24:11,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:12,311 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2019-12-18 23:24:13,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:24:13,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411904784] [2019-12-18 23:24:13,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064707453] [2019-12-18 23:24:13,033 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 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-18 23:24:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:13,117 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 97 conjunts are in the unsatisfiable core [2019-12-18 23:24:13,121 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:24:13,183 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-18 23:24:13,184 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:13,209 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 23:24:13,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:13,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:24:13,219 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:13,228 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:13,229 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:24:13,229 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-18 23:24:13,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:13,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:13,871 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:24:13,893 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:13,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 23:24:13,897 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:13,949 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 23:24:13,950 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:24:13,950 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2019-12-18 23:24:14,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:14,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:14,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:14,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:14,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:14,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:14,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 23:24:14,159 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:14,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:14,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:14,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:14,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:14,199 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 23:24:14,200 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:14,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:14,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:14,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:14,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 23:24:14,215 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:14,233 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:14,234 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:24:14,234 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:269, output treesize:49 [2019-12-18 23:24:14,538 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:14,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-18 23:24:14,541 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:14,596 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-18 23:24:14,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:14,602 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:24:14,602 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:32 [2019-12-18 23:24:14,754 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:14,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-18 23:24:14,755 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:14,762 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:14,762 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:24:14,763 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:7 [2019-12-18 23:24:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:24:14,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:24:14,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 33 [2019-12-18 23:24:14,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338073909] [2019-12-18 23:24:14,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-18 23:24:14,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:14,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-18 23:24:14,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1084, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 23:24:14,845 INFO L87 Difference]: Start difference. First operand 278 states and 624 transitions. Second operand 35 states. [2019-12-18 23:24:15,329 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-12-18 23:24:15,564 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-18 23:24:15,945 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 51 [2019-12-18 23:24:16,239 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 57 [2019-12-18 23:24:16,535 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 55 [2019-12-18 23:24:17,254 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-12-18 23:24:17,585 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-12-18 23:24:17,893 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-12-18 23:24:18,295 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 57 [2019-12-18 23:24:18,566 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-12-18 23:24:18,778 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-12-18 23:24:19,112 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-12-18 23:24:20,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:20,307 INFO L93 Difference]: Finished difference Result 396 states and 871 transitions. [2019-12-18 23:24:20,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 23:24:20,308 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 23 [2019-12-18 23:24:20,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:20,310 INFO L225 Difference]: With dead ends: 396 [2019-12-18 23:24:20,310 INFO L226 Difference]: Without dead ends: 396 [2019-12-18 23:24:20,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=457, Invalid=3203, Unknown=0, NotChecked=0, Total=3660 [2019-12-18 23:24:20,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-12-18 23:24:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 340. [2019-12-18 23:24:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-18 23:24:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 755 transitions. [2019-12-18 23:24:20,325 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 755 transitions. Word has length 23 [2019-12-18 23:24:20,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:20,325 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 755 transitions. [2019-12-18 23:24:20,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-18 23:24:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 755 transitions. [2019-12-18 23:24:20,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:24:20,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:20,329 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:24:20,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:24:20,542 INFO L410 AbstractCegarLoop]: === Iteration 16 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:24:20,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:20,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1472960100, now seen corresponding path program 8 times [2019-12-18 23:24:20,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:20,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545015704] [2019-12-18 23:24:20,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:21,130 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2019-12-18 23:24:21,279 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2019-12-18 23:24:21,439 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 38 [2019-12-18 23:24:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:24:22,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545015704] [2019-12-18 23:24:22,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481949653] [2019-12-18 23:24:22,093 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:24:22,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:24:22,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:24:22,166 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 102 conjunts are in the unsatisfiable core [2019-12-18 23:24:22,169 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:24:22,187 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-18 23:24:22,188 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:22,206 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 23:24:22,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:22,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:24:22,214 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:22,223 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:22,223 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:24:22,224 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 23:24:22,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:22,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:22,645 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:24:22,672 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:22,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 23:24:22,674 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:22,731 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 23:24:22,731 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:24:22,732 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-18 23:24:22,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:22,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:22,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:22,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:22,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:22,931 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-18 23:24:22,932 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:22,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:22,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:22,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:22,979 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-18 23:24:22,980 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:22,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:22,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:22,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:22,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2019-12-18 23:24:22,998 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:23,073 INFO L614 ElimStorePlain]: treesize reduction 141, result has 28.4 percent of original size [2019-12-18 23:24:23,074 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-18 23:24:23,074 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:254, output treesize:56 [2019-12-18 23:24:23,391 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:23,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 107 [2019-12-18 23:24:23,393 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:23,454 INFO L614 ElimStorePlain]: treesize reduction 84, result has 46.5 percent of original size [2019-12-18 23:24:23,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:23,457 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-18 23:24:23,457 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:58 [2019-12-18 23:24:23,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:23,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:23,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:23,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:23,960 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2019-12-18 23:24:23,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:24,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:24,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 55 [2019-12-18 23:24:24,071 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:24,080 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:24,087 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:24:24,087 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:70, output treesize:7 [2019-12-18 23:24:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:24:24,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:24:24,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 35 [2019-12-18 23:24:24,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064619689] [2019-12-18 23:24:24,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-18 23:24:24,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:24,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-18 23:24:24,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1207, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 23:24:24,175 INFO L87 Difference]: Start difference. First operand 340 states and 755 transitions. Second operand 37 states. [2019-12-18 23:24:24,925 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2019-12-18 23:24:25,364 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-12-18 23:24:25,632 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-12-18 23:24:25,816 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-12-18 23:24:26,235 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 75 [2019-12-18 23:24:26,800 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2019-12-18 23:24:27,036 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-12-18 23:24:27,224 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2019-12-18 23:24:27,551 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 56 [2019-12-18 23:24:27,925 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2019-12-18 23:24:28,223 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 61 [2019-12-18 23:24:28,416 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 54 [2019-12-18 23:24:28,825 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 65 [2019-12-18 23:24:29,060 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2019-12-18 23:24:29,400 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 63 [2019-12-18 23:24:29,757 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 70 [2019-12-18 23:24:30,027 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2019-12-18 23:24:30,307 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 60 [2019-12-18 23:24:30,862 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 73 [2019-12-18 23:24:31,155 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2019-12-18 23:24:31,386 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2019-12-18 23:24:31,727 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 65 [2019-12-18 23:24:32,025 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 87 [2019-12-18 23:24:32,402 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 73 [2019-12-18 23:24:32,752 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 87 [2019-12-18 23:24:33,008 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2019-12-18 23:24:33,385 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 65 [2019-12-18 23:24:33,701 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 89 [2019-12-18 23:24:34,232 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 87 [2019-12-18 23:24:34,531 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-12-18 23:24:34,953 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 89 [2019-12-18 23:24:35,432 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 68 [2019-12-18 23:24:36,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:36,225 INFO L93 Difference]: Finished difference Result 491 states and 1083 transitions. [2019-12-18 23:24:36,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 23:24:36,226 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 23 [2019-12-18 23:24:36,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:36,230 INFO L225 Difference]: With dead ends: 491 [2019-12-18 23:24:36,230 INFO L226 Difference]: Without dead ends: 491 [2019-12-18 23:24:36,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=783, Invalid=5223, Unknown=0, NotChecked=0, Total=6006 [2019-12-18 23:24:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-12-18 23:24:36,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 386. [2019-12-18 23:24:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-12-18 23:24:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 852 transitions. [2019-12-18 23:24:36,242 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 852 transitions. Word has length 23 [2019-12-18 23:24:36,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:36,243 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 852 transitions. [2019-12-18 23:24:36,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-18 23:24:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 852 transitions. [2019-12-18 23:24:36,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:24:36,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:36,244 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:24:36,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:24:36,448 INFO L410 AbstractCegarLoop]: === Iteration 17 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:24:36,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:36,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1943255998, now seen corresponding path program 9 times [2019-12-18 23:24:36,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:36,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158572598] [2019-12-18 23:24:36,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:36,939 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2019-12-18 23:24:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:24:37,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158572598] [2019-12-18 23:24:37,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030651642] [2019-12-18 23:24:37,728 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 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-18 23:24:37,810 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 23:24:37,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:24:37,812 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 102 conjunts are in the unsatisfiable core [2019-12-18 23:24:37,814 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:24:37,835 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 23:24:37,836 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 23:24:37,883 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 23:24:37,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:37,888 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:24:37,888 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:37,898 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:37,898 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:24:37,899 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 23:24:38,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:38,193 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:24:38,220 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:38,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 23:24:38,221 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:38,274 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-18 23:24:38,275 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:24:38,275 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:52 [2019-12-18 23:24:38,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:38,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:38,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:38,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:38,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:38,529 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:24:38,538 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2019-12-18 23:24:38,538 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:38,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:38,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:38,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:38,579 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:24:38,591 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-18 23:24:38,593 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:38,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:38,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:38,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:38,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-18 23:24:38,608 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:38,685 INFO L614 ElimStorePlain]: treesize reduction 141, result has 28.4 percent of original size [2019-12-18 23:24:38,686 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-18 23:24:38,686 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:254, output treesize:56 [2019-12-18 23:24:38,955 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:38,956 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 107 [2019-12-18 23:24:38,958 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:39,024 INFO L614 ElimStorePlain]: treesize reduction 84, result has 46.5 percent of original size [2019-12-18 23:24:39,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:39,026 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-18 23:24:39,027 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:58 [2019-12-18 23:24:39,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:39,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:39,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:39,561 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-12-18 23:24:39,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:39,734 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:39,735 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 55 [2019-12-18 23:24:39,737 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:39,751 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:39,753 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:24:39,753 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:70, output treesize:7 [2019-12-18 23:24:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:24:39,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:24:39,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2019-12-18 23:24:39,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186347193] [2019-12-18 23:24:39,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-18 23:24:39,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:39,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-18 23:24:39,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 23:24:39,807 INFO L87 Difference]: Start difference. First operand 386 states and 852 transitions. Second operand 35 states. [2019-12-18 23:24:40,552 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-12-18 23:24:40,931 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-12-18 23:24:41,204 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-12-18 23:24:41,397 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-12-18 23:24:41,841 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2019-12-18 23:24:42,419 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-12-18 23:24:42,711 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-12-18 23:24:42,910 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 52 [2019-12-18 23:24:43,082 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-12-18 23:24:43,358 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 70 [2019-12-18 23:24:43,601 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 56 [2019-12-18 23:24:44,127 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2019-12-18 23:24:44,348 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 67 [2019-12-18 23:24:44,605 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 61 [2019-12-18 23:24:44,817 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 54 [2019-12-18 23:24:45,031 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-12-18 23:24:45,414 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 82 [2019-12-18 23:24:45,836 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 65 [2019-12-18 23:24:46,034 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-12-18 23:24:46,437 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2019-12-18 23:24:46,782 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 63 [2019-12-18 23:24:47,100 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 61 [2019-12-18 23:24:47,390 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2019-12-18 23:24:47,851 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 51 [2019-12-18 23:24:48,221 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 64 [2019-12-18 23:24:48,463 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2019-12-18 23:24:48,644 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 55 [2019-12-18 23:24:48,978 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 56 [2019-12-18 23:24:49,236 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 74 [2019-12-18 23:24:49,637 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 64 [2019-12-18 23:24:49,913 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 74 [2019-12-18 23:24:50,490 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 56 [2019-12-18 23:24:50,755 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 76 [2019-12-18 23:24:51,255 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 74 [2019-12-18 23:24:51,497 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-12-18 23:24:51,899 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 76 [2019-12-18 23:24:52,310 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-12-18 23:24:52,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:24:52,708 INFO L93 Difference]: Finished difference Result 564 states and 1245 transitions. [2019-12-18 23:24:52,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-18 23:24:52,709 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 23 [2019-12-18 23:24:52,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:24:52,712 INFO L225 Difference]: With dead ends: 564 [2019-12-18 23:24:52,712 INFO L226 Difference]: Without dead ends: 564 [2019-12-18 23:24:52,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=982, Invalid=5990, Unknown=0, NotChecked=0, Total=6972 [2019-12-18 23:24:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-12-18 23:24:52,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 386. [2019-12-18 23:24:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-12-18 23:24:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 852 transitions. [2019-12-18 23:24:52,724 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 852 transitions. Word has length 23 [2019-12-18 23:24:52,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:24:52,725 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 852 transitions. [2019-12-18 23:24:52,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-18 23:24:52,725 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 852 transitions. [2019-12-18 23:24:52,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:24:52,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:24:52,726 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:24:52,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:24:52,930 INFO L410 AbstractCegarLoop]: === Iteration 18 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:24:52,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:24:52,930 INFO L82 PathProgramCache]: Analyzing trace with hash 439358334, now seen corresponding path program 10 times [2019-12-18 23:24:52,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:24:52,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36729212] [2019-12-18 23:24:52,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:24:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:24:53,647 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-12-18 23:24:54,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:24:54,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36729212] [2019-12-18 23:24:54,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171890563] [2019-12-18 23:24:54,170 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 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-18 23:24:54,237 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:24:54,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:24:54,239 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 104 conjunts are in the unsatisfiable core [2019-12-18 23:24:54,242 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:24:54,255 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-18 23:24:54,256 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:54,278 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 23:24:54,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:54,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:24:54,285 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:54,294 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:54,296 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:24:54,296 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 23:24:54,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:54,792 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:24:54,819 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:54,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 92 [2019-12-18 23:24:54,821 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:54,888 INFO L614 ElimStorePlain]: treesize reduction 50, result has 53.3 percent of original size [2019-12-18 23:24:54,889 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:24:54,889 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:57 [2019-12-18 23:24:55,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:55,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:55,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:55,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:55,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:55,096 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:24:55,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:55,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 59 [2019-12-18 23:24:55,108 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:55,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:55,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:55,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:55,132 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:24:55,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:55,141 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 58 [2019-12-18 23:24:55,142 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:55,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:55,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:55,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:55,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 67 [2019-12-18 23:24:55,186 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:55,204 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:55,205 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:24:55,205 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:287, output treesize:49 [2019-12-18 23:24:55,547 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:55,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-18 23:24:55,549 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:55,613 INFO L614 ElimStorePlain]: treesize reduction 64, result has 50.0 percent of original size [2019-12-18 23:24:55,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:55,615 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-18 23:24:55,615 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:64, output treesize:61 [2019-12-18 23:24:55,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:55,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:55,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:55,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:55,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:55,926 INFO L430 ElimStorePlain]: Different costs {14=[|#memory_int|], 24=[v_prenex_16]} [2019-12-18 23:24:55,946 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:55,946 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 47 [2019-12-18 23:24:55,947 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:55,977 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:55,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:55,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:24:56,009 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:24:56,009 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 74 [2019-12-18 23:24:56,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:56,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:24:56,012 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:24:56,051 INFO L614 ElimStorePlain]: treesize reduction 12, result has 73.9 percent of original size [2019-12-18 23:24:56,052 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:24:56,052 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:117, output treesize:7 [2019-12-18 23:24:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:24:56,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:24:56,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 34 [2019-12-18 23:24:56,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249904371] [2019-12-18 23:24:56,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-18 23:24:56,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:24:56,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-18 23:24:56,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1135, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 23:24:56,135 INFO L87 Difference]: Start difference. First operand 386 states and 852 transitions. Second operand 36 states. [2019-12-18 23:24:57,349 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2019-12-18 23:24:57,710 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-12-18 23:24:59,435 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2019-12-18 23:25:00,069 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-12-18 23:25:00,225 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2019-12-18 23:25:00,423 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-12-18 23:25:00,688 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-12-18 23:25:00,856 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-12-18 23:25:01,058 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-12-18 23:25:01,489 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 66 [2019-12-18 23:25:01,693 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2019-12-18 23:25:02,413 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 68 [2019-12-18 23:25:02,609 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-12-18 23:25:03,096 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2019-12-18 23:25:03,330 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2019-12-18 23:25:03,820 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2019-12-18 23:25:04,034 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2019-12-18 23:25:04,248 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2019-12-18 23:25:04,664 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 80 [2019-12-18 23:25:04,967 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 89 [2019-12-18 23:25:05,201 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2019-12-18 23:25:05,384 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-12-18 23:25:05,563 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-12-18 23:25:05,960 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-12-18 23:25:06,211 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 70 [2019-12-18 23:25:06,394 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-12-18 23:25:06,772 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-12-18 23:25:07,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:07,189 INFO L93 Difference]: Finished difference Result 629 states and 1399 transitions. [2019-12-18 23:25:07,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-18 23:25:07,190 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 23 [2019-12-18 23:25:07,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:07,194 INFO L225 Difference]: With dead ends: 629 [2019-12-18 23:25:07,194 INFO L226 Difference]: Without dead ends: 629 [2019-12-18 23:25:07,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=811, Invalid=5669, Unknown=0, NotChecked=0, Total=6480 [2019-12-18 23:25:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-12-18 23:25:07,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 417. [2019-12-18 23:25:07,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-12-18 23:25:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 922 transitions. [2019-12-18 23:25:07,207 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 922 transitions. Word has length 23 [2019-12-18 23:25:07,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:07,207 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 922 transitions. [2019-12-18 23:25:07,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-18 23:25:07,208 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 922 transitions. [2019-12-18 23:25:07,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:25:07,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:07,209 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:25:07,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:25:07,414 INFO L410 AbstractCegarLoop]: === Iteration 19 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:25:07,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:07,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2146571010, now seen corresponding path program 11 times [2019-12-18 23:25:07,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:07,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509739573] [2019-12-18 23:25:07,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:08,011 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 42 [2019-12-18 23:25:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:25:08,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509739573] [2019-12-18 23:25:08,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843960342] [2019-12-18 23:25:08,665 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 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-18 23:25:08,736 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:25:08,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:25:08,738 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 92 conjunts are in the unsatisfiable core [2019-12-18 23:25:08,740 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:25:08,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:08,758 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-18 23:25:08,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:25:08,758 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:08,767 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:08,768 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:08,768 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:27 [2019-12-18 23:25:09,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:09,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:09,004 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:25:09,031 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:09,031 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 90 [2019-12-18 23:25:09,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,052 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-18 23:25:09,183 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 34 [2019-12-18 23:25:09,184 INFO L614 ElimStorePlain]: treesize reduction 519, result has 12.5 percent of original size [2019-12-18 23:25:09,185 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:25:09,185 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:78, output treesize:74 [2019-12-18 23:25:09,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:09,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:09,371 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:09,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 108 [2019-12-18 23:25:09,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,379 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:09,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:09,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:09,433 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:09,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 118 [2019-12-18 23:25:09,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,445 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:09,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:09,495 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:09,496 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 107 [2019-12-18 23:25:09,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,508 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:09,593 INFO L614 ElimStorePlain]: treesize reduction 371, result has 14.3 percent of original size [2019-12-18 23:25:09,593 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:09,594 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:326, output treesize:62 [2019-12-18 23:25:09,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:09,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:09,907 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:09,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 142 [2019-12-18 23:25:09,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:09,910 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:09,990 INFO L614 ElimStorePlain]: treesize reduction 133, result has 35.7 percent of original size [2019-12-18 23:25:09,991 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:09,991 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:80, output treesize:58 [2019-12-18 23:25:10,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:10,188 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:10,188 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 67 [2019-12-18 23:25:10,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:10,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:10,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:10,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:10,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:10,194 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 23:25:10,252 INFO L614 ElimStorePlain]: treesize reduction 83, result has 23.1 percent of original size [2019-12-18 23:25:10,253 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:25:10,253 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:7 [2019-12-18 23:25:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:25:10,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:25:10,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 29 [2019-12-18 23:25:10,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624276045] [2019-12-18 23:25:10,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-18 23:25:10,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:10,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-18 23:25:10,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2019-12-18 23:25:10,287 INFO L87 Difference]: Start difference. First operand 417 states and 922 transitions. Second operand 31 states. [2019-12-18 23:25:11,168 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-12-18 23:25:11,532 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2019-12-18 23:25:11,764 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2019-12-18 23:25:12,029 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2019-12-18 23:25:12,562 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-18 23:25:13,233 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-12-18 23:25:14,243 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-12-18 23:25:14,441 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-12-18 23:25:14,828 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-18 23:25:15,242 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-12-18 23:25:15,586 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-12-18 23:25:16,140 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-12-18 23:25:16,342 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-12-18 23:25:16,747 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-12-18 23:25:17,243 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-12-18 23:25:17,693 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-12-18 23:25:18,280 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-12-18 23:25:18,533 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-12-18 23:25:18,771 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-12-18 23:25:19,957 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-12-18 23:25:20,471 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-12-18 23:25:20,848 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-12-18 23:25:21,436 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-12-18 23:25:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:22,784 INFO L93 Difference]: Finished difference Result 683 states and 1490 transitions. [2019-12-18 23:25:22,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 23:25:22,785 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 23 [2019-12-18 23:25:22,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:22,789 INFO L225 Difference]: With dead ends: 683 [2019-12-18 23:25:22,789 INFO L226 Difference]: Without dead ends: 683 [2019-12-18 23:25:22,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=769, Invalid=4633, Unknown=0, NotChecked=0, Total=5402 [2019-12-18 23:25:22,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-18 23:25:22,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 424. [2019-12-18 23:25:22,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-12-18 23:25:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 932 transitions. [2019-12-18 23:25:22,801 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 932 transitions. Word has length 23 [2019-12-18 23:25:22,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:22,801 INFO L462 AbstractCegarLoop]: Abstraction has 424 states and 932 transitions. [2019-12-18 23:25:22,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-18 23:25:22,802 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 932 transitions. [2019-12-18 23:25:22,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:25:22,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:22,803 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:25:23,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:25:23,019 INFO L410 AbstractCegarLoop]: === Iteration 20 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:25:23,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:23,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1637577760, now seen corresponding path program 12 times [2019-12-18 23:25:23,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:23,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862508583] [2019-12-18 23:25:23,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:23,546 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2019-12-18 23:25:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:25:24,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862508583] [2019-12-18 23:25:24,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702733329] [2019-12-18 23:25:24,369 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 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-18 23:25:24,428 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-18 23:25:24,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:25:24,430 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 102 conjunts are in the unsatisfiable core [2019-12-18 23:25:24,432 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:25:24,441 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-12-18 23:25:24,441 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:24,462 INFO L614 ElimStorePlain]: treesize reduction 12, result has 78.9 percent of original size [2019-12-18 23:25:24,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:24,466 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:25:24,467 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:24,478 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:24,479 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:24,479 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 23:25:24,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:24,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:24,886 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:25:24,913 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:24,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 23:25:24,915 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:24,974 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 23:25:24,975 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:24,975 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-18 23:25:25,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:25,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:25,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:25,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:25,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:25,176 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-18 23:25:25,177 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:25,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:25,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:25,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:25,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2019-12-18 23:25:25,206 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:25,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:25,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:25,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:25,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-18 23:25:25,219 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:25,311 INFO L614 ElimStorePlain]: treesize reduction 141, result has 28.4 percent of original size [2019-12-18 23:25:25,312 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:25,312 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:254, output treesize:56 [2019-12-18 23:25:25,662 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:25,662 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 107 [2019-12-18 23:25:25,663 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:25,726 INFO L614 ElimStorePlain]: treesize reduction 84, result has 46.5 percent of original size [2019-12-18 23:25:25,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:25,727 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:25,727 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:58 [2019-12-18 23:25:25,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:25,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:25,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:25,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:26,166 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2019-12-18 23:25:26,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:26,277 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:26,277 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 55 [2019-12-18 23:25:26,278 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:26,287 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:26,289 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:25:26,289 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:70, output treesize:7 [2019-12-18 23:25:26,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:25:26,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:25:26,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 35 [2019-12-18 23:25:26,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520001921] [2019-12-18 23:25:26,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-18 23:25:26,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:26,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-18 23:25:26,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1207, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 23:25:26,379 INFO L87 Difference]: Start difference. First operand 424 states and 932 transitions. Second operand 37 states. [2019-12-18 23:25:27,097 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2019-12-18 23:25:27,393 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-12-18 23:25:27,621 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-12-18 23:25:27,893 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-12-18 23:25:28,083 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-12-18 23:25:28,297 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-12-18 23:25:28,678 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 75 [2019-12-18 23:25:29,052 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 56 [2019-12-18 23:25:29,364 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2019-12-18 23:25:29,643 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2019-12-18 23:25:29,913 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 61 [2019-12-18 23:25:30,333 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 56 [2019-12-18 23:25:30,691 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 61 [2019-12-18 23:25:30,910 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2019-12-18 23:25:31,336 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 65 [2019-12-18 23:25:31,834 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 63 [2019-12-18 23:25:32,119 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 66 [2019-12-18 23:25:32,362 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2019-12-18 23:25:32,620 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 62 [2019-12-18 23:25:32,956 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 75 [2019-12-18 23:25:33,239 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 81 [2019-12-18 23:25:33,482 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2019-12-18 23:25:33,785 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 69 [2019-12-18 23:25:34,079 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 83 [2019-12-18 23:25:34,470 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 75 [2019-12-18 23:25:34,803 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2019-12-18 23:25:35,022 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2019-12-18 23:25:35,440 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 69 [2019-12-18 23:25:35,745 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 85 [2019-12-18 23:25:36,270 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 83 [2019-12-18 23:25:36,527 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-12-18 23:25:36,969 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 85 [2019-12-18 23:25:37,443 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 68 [2019-12-18 23:25:38,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:38,375 INFO L93 Difference]: Finished difference Result 581 states and 1265 transitions. [2019-12-18 23:25:38,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 23:25:38,376 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 23 [2019-12-18 23:25:38,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:38,379 INFO L225 Difference]: With dead ends: 581 [2019-12-18 23:25:38,379 INFO L226 Difference]: Without dead ends: 581 [2019-12-18 23:25:38,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=821, Invalid=5341, Unknown=0, NotChecked=0, Total=6162 [2019-12-18 23:25:38,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-12-18 23:25:38,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 433. [2019-12-18 23:25:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-12-18 23:25:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 950 transitions. [2019-12-18 23:25:38,390 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 950 transitions. Word has length 23 [2019-12-18 23:25:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:38,390 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 950 transitions. [2019-12-18 23:25:38,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-18 23:25:38,391 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 950 transitions. [2019-12-18 23:25:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:25:38,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:38,392 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:25:38,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:25:38,595 INFO L410 AbstractCegarLoop]: === Iteration 21 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:25:38,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:38,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1259442268, now seen corresponding path program 13 times [2019-12-18 23:25:38,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:38,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674556393] [2019-12-18 23:25:38,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:39,167 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2019-12-18 23:25:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:25:39,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674556393] [2019-12-18 23:25:39,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133921886] [2019-12-18 23:25:39,839 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 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-18 23:25:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:39,908 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 97 conjunts are in the unsatisfiable core [2019-12-18 23:25:39,910 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:25:39,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-18 23:25:39,940 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:39,958 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 23:25:39,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:39,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:25:39,965 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:39,976 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:39,977 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:39,977 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-18 23:25:40,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:40,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:40,430 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:25:40,458 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:40,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 23:25:40,460 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:40,519 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 23:25:40,519 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:40,520 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2019-12-18 23:25:40,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:40,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:40,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:40,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:40,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:40,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:40,695 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 23:25:40,696 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:40,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:40,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:40,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:40,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:40,740 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 23:25:40,740 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:40,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:40,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:40,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:40,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 23:25:40,749 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:40,771 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:40,771 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:40,771 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:269, output treesize:49 [2019-12-18 23:25:41,013 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:41,014 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-18 23:25:41,014 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:41,079 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-18 23:25:41,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:41,080 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:41,080 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:32 [2019-12-18 23:25:41,201 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:41,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-18 23:25:41,203 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:41,207 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:41,207 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:25:41,208 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:7 [2019-12-18 23:25:41,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:25:41,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:25:41,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 33 [2019-12-18 23:25:41,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468718646] [2019-12-18 23:25:41,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-18 23:25:41,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:41,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-18 23:25:41,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 23:25:41,285 INFO L87 Difference]: Start difference. First operand 433 states and 950 transitions. Second operand 35 states. [2019-12-18 23:25:41,835 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 46 [2019-12-18 23:25:42,078 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-12-18 23:25:42,453 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 51 [2019-12-18 23:25:42,729 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2019-12-18 23:25:42,989 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 55 [2019-12-18 23:25:43,664 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-12-18 23:25:44,005 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-12-18 23:25:44,335 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-12-18 23:25:44,773 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 57 [2019-12-18 23:25:45,046 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-12-18 23:25:45,233 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-12-18 23:25:45,542 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-12-18 23:25:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:46,699 INFO L93 Difference]: Finished difference Result 503 states and 1098 transitions. [2019-12-18 23:25:46,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 23:25:46,700 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 23 [2019-12-18 23:25:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:46,703 INFO L225 Difference]: With dead ends: 503 [2019-12-18 23:25:46,703 INFO L226 Difference]: Without dead ends: 503 [2019-12-18 23:25:46,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=460, Invalid=3200, Unknown=0, NotChecked=0, Total=3660 [2019-12-18 23:25:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-12-18 23:25:46,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 397. [2019-12-18 23:25:46,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-12-18 23:25:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 875 transitions. [2019-12-18 23:25:46,713 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 875 transitions. Word has length 23 [2019-12-18 23:25:46,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:46,713 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 875 transitions. [2019-12-18 23:25:46,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-18 23:25:46,713 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 875 transitions. [2019-12-18 23:25:46,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:25:46,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:46,714 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:25:46,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:25:46,918 INFO L410 AbstractCegarLoop]: === Iteration 22 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:25:46,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:46,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2064920054, now seen corresponding path program 14 times [2019-12-18 23:25:46,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:46,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695740978] [2019-12-18 23:25:46,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:47,456 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 41 [2019-12-18 23:25:48,244 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-18 23:25:48,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695740978] [2019-12-18 23:25:48,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319552158] [2019-12-18 23:25:48,245 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:25:48,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:25:48,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:25:48,324 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 94 conjunts are in the unsatisfiable core [2019-12-18 23:25:48,326 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:25:48,337 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-18 23:25:48,337 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:48,357 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 23:25:48,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:48,363 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:25:48,363 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:48,371 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:48,372 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:48,372 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 23:25:48,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:48,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:48,882 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:25:48,905 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:48,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 23:25:48,907 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:48,969 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 23:25:48,970 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:48,970 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-18 23:25:49,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:49,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:49,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:49,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:49,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:49,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:49,156 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 23:25:49,156 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:49,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:49,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:49,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:49,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:49,183 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 23:25:49,183 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:49,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:49,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:49,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:49,215 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 23:25:49,215 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:49,238 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:49,238 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:49,238 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-18 23:25:49,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:49,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:49,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:49,505 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:49,506 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 120 [2019-12-18 23:25:49,507 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:49,567 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-18 23:25:49,568 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:49,568 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-18 23:25:49,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:49,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:49,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2019-12-18 23:25:49,679 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:49,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 23:25:49,710 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:49,721 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 23:25:49,721 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:49,784 INFO L614 ElimStorePlain]: treesize reduction 121, result has 27.5 percent of original size [2019-12-18 23:25:49,784 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:49,785 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:212, output treesize:46 [2019-12-18 23:25:49,947 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:49,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 51 [2019-12-18 23:25:49,948 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:49,955 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:49,956 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:25:49,956 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:7 [2019-12-18 23:25:49,984 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-18 23:25:49,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:25:49,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2019-12-18 23:25:49,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496484479] [2019-12-18 23:25:49,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-18 23:25:49,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:49,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-18 23:25:49,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1188, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 23:25:49,986 INFO L87 Difference]: Start difference. First operand 397 states and 875 transitions. Second operand 37 states. [2019-12-18 23:25:50,458 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 47 [2019-12-18 23:25:50,699 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2019-12-18 23:25:51,091 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2019-12-18 23:25:51,353 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2019-12-18 23:25:51,627 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 63 [2019-12-18 23:25:52,737 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-12-18 23:25:53,190 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2019-12-18 23:25:53,957 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-18 23:25:54,712 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-18 23:25:55,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:25:55,996 INFO L93 Difference]: Finished difference Result 553 states and 1213 transitions. [2019-12-18 23:25:55,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 23:25:55,996 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 25 [2019-12-18 23:25:55,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:25:56,000 INFO L225 Difference]: With dead ends: 553 [2019-12-18 23:25:56,000 INFO L226 Difference]: Without dead ends: 553 [2019-12-18 23:25:56,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=618, Invalid=3804, Unknown=0, NotChecked=0, Total=4422 [2019-12-18 23:25:56,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-12-18 23:25:56,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 415. [2019-12-18 23:25:56,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-12-18 23:25:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 911 transitions. [2019-12-18 23:25:56,010 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 911 transitions. Word has length 25 [2019-12-18 23:25:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:25:56,010 INFO L462 AbstractCegarLoop]: Abstraction has 415 states and 911 transitions. [2019-12-18 23:25:56,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-18 23:25:56,010 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 911 transitions. [2019-12-18 23:25:56,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:25:56,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:25:56,012 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:25:56,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:25:56,215 INFO L410 AbstractCegarLoop]: === Iteration 23 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:25:56,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:25:56,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1265695988, now seen corresponding path program 1 times [2019-12-18 23:25:56,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:25:56,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546407656] [2019-12-18 23:25:56,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:25:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:57,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:25:57,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546407656] [2019-12-18 23:25:57,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825063008] [2019-12-18 23:25:57,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:25:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:25:57,118 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 83 conjunts are in the unsatisfiable core [2019-12-18 23:25:57,119 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:25:57,133 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 23:25:57,134 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 23:25:57,171 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 23:25:57,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:57,176 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:25:57,177 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:57,188 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:57,188 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:57,189 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 23:25:57,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:57,498 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:57,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 23:25:57,500 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:57,550 INFO L614 ElimStorePlain]: treesize reduction 46, result has 51.6 percent of original size [2019-12-18 23:25:57,551 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:57,551 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:46 [2019-12-18 23:25:57,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:57,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:57,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:57,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 60 [2019-12-18 23:25:57,683 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:57,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:57,707 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2019-12-18 23:25:57,708 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:57,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-18 23:25:57,713 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:57,725 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:57,725 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:57,725 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:210, output treesize:36 [2019-12-18 23:25:57,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:57,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:57,933 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:25:57,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:57,937 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-18 23:25:57,937 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:57,963 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:25:57,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:25:57,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2019-12-18 23:25:57,967 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:57,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 60 [2019-12-18 23:25:57,973 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:25:57,987 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:25:57,988 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:25:57,988 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:210, output treesize:36 [2019-12-18 23:25:58,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:25:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:25:58,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:25:58,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2019-12-18 23:25:58,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029829951] [2019-12-18 23:25:58,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-18 23:25:58,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:25:58,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-18 23:25:58,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:25:58,112 INFO L87 Difference]: Start difference. First operand 415 states and 911 transitions. Second operand 32 states. [2019-12-18 23:25:58,930 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-12-18 23:25:59,443 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2019-12-18 23:25:59,725 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-12-18 23:26:00,150 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-12-18 23:26:00,377 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2019-12-18 23:26:00,544 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-12-18 23:26:00,780 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2019-12-18 23:26:01,058 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2019-12-18 23:26:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:02,627 INFO L93 Difference]: Finished difference Result 490 states and 1063 transitions. [2019-12-18 23:26:02,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:26:02,628 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 25 [2019-12-18 23:26:02,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:02,631 INFO L225 Difference]: With dead ends: 490 [2019-12-18 23:26:02,631 INFO L226 Difference]: Without dead ends: 473 [2019-12-18 23:26:02,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=488, Invalid=2374, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 23:26:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-12-18 23:26:02,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 468. [2019-12-18 23:26:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-12-18 23:26:02,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1025 transitions. [2019-12-18 23:26:02,640 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1025 transitions. Word has length 25 [2019-12-18 23:26:02,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:02,641 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 1025 transitions. [2019-12-18 23:26:02,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-18 23:26:02,641 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1025 transitions. [2019-12-18 23:26:02,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:26:02,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:02,642 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:26:02,845 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:26:02,846 INFO L410 AbstractCegarLoop]: === Iteration 24 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:26:02,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:02,846 INFO L82 PathProgramCache]: Analyzing trace with hash -51521140, now seen corresponding path program 2 times [2019-12-18 23:26:02,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:02,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696398225] [2019-12-18 23:26:02,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:26:04,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696398225] [2019-12-18 23:26:04,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549232316] [2019-12-18 23:26:04,031 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 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-18 23:26:04,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:26:04,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:26:04,134 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 76 conjunts are in the unsatisfiable core [2019-12-18 23:26:04,136 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:26:04,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 23:26:04,160 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 23:26:04,200 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 23:26:04,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:04,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:26:04,205 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:04,215 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:04,216 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:04,216 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 23:26:04,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:04,532 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:04,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 23:26:04,533 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:04,574 INFO L614 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2019-12-18 23:26:04,575 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:04,575 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:37 [2019-12-18 23:26:04,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:04,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:04,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:04,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-18 23:26:04,694 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:04,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:04,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-18 23:26:04,710 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:04,714 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-18 23:26:04,715 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:04,725 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:04,725 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:04,725 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-18 23:26:04,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:04,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:04,937 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:26:04,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:04,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-18 23:26:04,940 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:04,961 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:26:04,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:04,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-18 23:26:04,964 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:04,967 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-18 23:26:04,967 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:04,977 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:04,977 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:04,978 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-18 23:26:05,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:26:05,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:26:05,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2019-12-18 23:26:05,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146589781] [2019-12-18 23:26:05,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-18 23:26:05,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:05,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-18 23:26:05,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 23:26:05,087 INFO L87 Difference]: Start difference. First operand 468 states and 1025 transitions. Second operand 33 states. [2019-12-18 23:26:06,252 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-12-18 23:26:06,420 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2019-12-18 23:26:06,594 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-12-18 23:26:06,840 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-12-18 23:26:07,242 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 55 [2019-12-18 23:26:07,446 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-12-18 23:26:07,645 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2019-12-18 23:26:08,072 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2019-12-18 23:26:08,430 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-12-18 23:26:08,664 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2019-12-18 23:26:08,822 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-12-18 23:26:09,220 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2019-12-18 23:26:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:10,883 INFO L93 Difference]: Finished difference Result 520 states and 1126 transitions. [2019-12-18 23:26:10,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 23:26:10,883 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 25 [2019-12-18 23:26:10,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:10,886 INFO L225 Difference]: With dead ends: 520 [2019-12-18 23:26:10,887 INFO L226 Difference]: Without dead ends: 503 [2019-12-18 23:26:10,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=578, Invalid=2962, Unknown=0, NotChecked=0, Total=3540 [2019-12-18 23:26:10,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-12-18 23:26:10,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 468. [2019-12-18 23:26:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-12-18 23:26:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1025 transitions. [2019-12-18 23:26:10,895 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1025 transitions. Word has length 25 [2019-12-18 23:26:10,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:10,895 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 1025 transitions. [2019-12-18 23:26:10,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-18 23:26:10,895 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1025 transitions. [2019-12-18 23:26:10,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:26:10,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:10,896 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:26:11,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:26:11,100 INFO L410 AbstractCegarLoop]: === Iteration 25 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:26:11,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:11,101 INFO L82 PathProgramCache]: Analyzing trace with hash -559508754, now seen corresponding path program 3 times [2019-12-18 23:26:11,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:11,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708220182] [2019-12-18 23:26:11,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:26:11,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708220182] [2019-12-18 23:26:11,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124535277] [2019-12-18 23:26:11,994 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 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-18 23:26:12,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 23:26:12,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:26:12,073 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 81 conjunts are in the unsatisfiable core [2019-12-18 23:26:12,074 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:26:12,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:12,092 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-18 23:26:12,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:26:12,093 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:12,103 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:12,104 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:12,104 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:27 [2019-12-18 23:26:12,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:12,335 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:12,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 76 [2019-12-18 23:26:12,336 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:12,377 INFO L614 ElimStorePlain]: treesize reduction 46, result has 45.2 percent of original size [2019-12-18 23:26:12,378 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:26:12,378 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:35 [2019-12-18 23:26:12,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:12,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:12,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:12,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-18 23:26:12,479 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:12,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:12,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-18 23:26:12,495 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:12,499 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:12,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2019-12-18 23:26:12,500 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:12,508 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:12,508 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:26:12,508 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:177, output treesize:25 [2019-12-18 23:26:12,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:12,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:12,708 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:26:12,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:12,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-18 23:26:12,712 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:12,729 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:26:12,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:12,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-18 23:26:12,733 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:12,737 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:12,738 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 55 [2019-12-18 23:26:12,738 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:12,756 INFO L614 ElimStorePlain]: treesize reduction 7, result has 78.1 percent of original size [2019-12-18 23:26:12,756 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:26:12,756 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:177, output treesize:25 [2019-12-18 23:26:12,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:26:12,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:26:12,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2019-12-18 23:26:12,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540269467] [2019-12-18 23:26:12,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-18 23:26:12,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:12,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-18 23:26:12,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:26:12,847 INFO L87 Difference]: Start difference. First operand 468 states and 1025 transitions. Second operand 32 states. [2019-12-18 23:26:13,956 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-12-18 23:26:15,188 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2019-12-18 23:26:15,434 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2019-12-18 23:26:15,725 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2019-12-18 23:26:17,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:17,338 INFO L93 Difference]: Finished difference Result 550 states and 1191 transitions. [2019-12-18 23:26:17,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 23:26:17,338 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 25 [2019-12-18 23:26:17,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:17,342 INFO L225 Difference]: With dead ends: 550 [2019-12-18 23:26:17,342 INFO L226 Difference]: Without dead ends: 533 [2019-12-18 23:26:17,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=485, Invalid=2821, Unknown=0, NotChecked=0, Total=3306 [2019-12-18 23:26:17,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-12-18 23:26:17,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 468. [2019-12-18 23:26:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-12-18 23:26:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1025 transitions. [2019-12-18 23:26:17,350 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1025 transitions. Word has length 25 [2019-12-18 23:26:17,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:17,351 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 1025 transitions. [2019-12-18 23:26:17,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-18 23:26:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1025 transitions. [2019-12-18 23:26:17,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:26:17,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:17,352 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:26:17,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:26:17,556 INFO L410 AbstractCegarLoop]: === Iteration 26 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:26:17,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:17,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1744368566, now seen corresponding path program 15 times [2019-12-18 23:26:17,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:17,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601003144] [2019-12-18 23:26:17,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:18,194 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 40 [2019-12-18 23:26:18,322 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 33 [2019-12-18 23:26:18,495 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-12-18 23:26:19,413 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-18 23:26:19,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601003144] [2019-12-18 23:26:19,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227336186] [2019-12-18 23:26:19,413 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-18 23:26:19,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 23:26:19,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:26:19,496 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 98 conjunts are in the unsatisfiable core [2019-12-18 23:26:19,498 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:26:19,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 23:26:19,506 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 23:26:19,533 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 23:26:19,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:19,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:26:19,539 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:19,551 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:19,552 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:19,552 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 23:26:19,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:19,967 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:26:19,992 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:19,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 23:26:19,994 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:20,052 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-18 23:26:20,053 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:20,053 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:52 [2019-12-18 23:26:20,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:20,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:20,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:20,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:20,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:20,228 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:26:20,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:20,240 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 23:26:20,241 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:20,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:20,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:20,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:20,276 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:26:20,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:20,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 23:26:20,286 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:20,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:20,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:20,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:20,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 23:26:20,292 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:20,311 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:20,312 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:20,312 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:260, output treesize:46 [2019-12-18 23:26:20,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:20,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:20,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:20,553 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:20,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 120 [2019-12-18 23:26:20,554 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:20,612 INFO L614 ElimStorePlain]: treesize reduction 72, result has 43.3 percent of original size [2019-12-18 23:26:20,613 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:20,614 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:68, output treesize:46 [2019-12-18 23:26:20,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:20,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:20,747 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 23:26:20,748 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:20,770 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2019-12-18 23:26:20,770 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:20,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 23:26:20,780 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:20,831 INFO L614 ElimStorePlain]: treesize reduction 115, result has 27.2 percent of original size [2019-12-18 23:26:20,831 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:20,832 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:43 [2019-12-18 23:26:21,222 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:21,222 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 51 [2019-12-18 23:26:21,223 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:21,234 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:21,235 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:26:21,235 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:7 [2019-12-18 23:26:21,387 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-18 23:26:21,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:26:21,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 37 [2019-12-18 23:26:21,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221153665] [2019-12-18 23:26:21,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-18 23:26:21,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:21,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-18 23:26:21,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1360, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 23:26:21,389 INFO L87 Difference]: Start difference. First operand 468 states and 1025 transitions. Second operand 39 states. [2019-12-18 23:26:22,433 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-12-18 23:26:22,684 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 68 [2019-12-18 23:26:22,876 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2019-12-18 23:26:23,131 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 68 [2019-12-18 23:26:23,536 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 57 [2019-12-18 23:26:24,104 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2019-12-18 23:26:24,406 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-12-18 23:26:24,717 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 72 [2019-12-18 23:26:24,933 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 65 [2019-12-18 23:26:25,330 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 75 [2019-12-18 23:26:25,874 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2019-12-18 23:26:26,095 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2019-12-18 23:26:26,323 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 68 [2019-12-18 23:26:26,722 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 79 [2019-12-18 23:26:27,356 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 80 [2019-12-18 23:26:27,616 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 66 [2019-12-18 23:26:28,075 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 83 [2019-12-18 23:26:28,562 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 83 [2019-12-18 23:26:28,833 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 70 [2019-12-18 23:26:29,113 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-12-18 23:26:29,411 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 86 [2019-12-18 23:26:29,738 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-12-18 23:26:30,021 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 73 [2019-12-18 23:26:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:30,730 INFO L93 Difference]: Finished difference Result 738 states and 1624 transitions. [2019-12-18 23:26:30,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 23:26:30,730 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 25 [2019-12-18 23:26:30,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:30,735 INFO L225 Difference]: With dead ends: 738 [2019-12-18 23:26:30,735 INFO L226 Difference]: Without dead ends: 738 [2019-12-18 23:26:30,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=681, Invalid=4289, Unknown=0, NotChecked=0, Total=4970 [2019-12-18 23:26:30,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-18 23:26:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 474. [2019-12-18 23:26:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-12-18 23:26:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1038 transitions. [2019-12-18 23:26:30,744 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1038 transitions. Word has length 25 [2019-12-18 23:26:30,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:30,744 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 1038 transitions. [2019-12-18 23:26:30,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-18 23:26:30,744 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1038 transitions. [2019-12-18 23:26:30,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:26:30,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:30,745 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:26:30,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:26:30,946 INFO L410 AbstractCegarLoop]: === Iteration 27 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:26:30,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:30,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1742250316, now seen corresponding path program 4 times [2019-12-18 23:26:30,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:30,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603188438] [2019-12-18 23:26:30,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:31,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:26:31,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603188438] [2019-12-18 23:26:31,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10509619] [2019-12-18 23:26:31,950 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-18 23:26:32,017 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:26:32,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:26:32,019 WARN L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 87 conjunts are in the unsatisfiable core [2019-12-18 23:26:32,020 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:26:32,031 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 23:26:32,032 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 23:26:32,057 INFO L614 ElimStorePlain]: treesize reduction 14, result has 75.0 percent of original size [2019-12-18 23:26:32,071 INFO L343 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-12-18 23:26:32,071 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:26:32,072 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:32,082 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:32,083 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:32,083 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:28 [2019-12-18 23:26:32,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,339 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:32,340 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 23:26:32,341 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:32,382 INFO L614 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2019-12-18 23:26:32,383 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:32,383 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:43 [2019-12-18 23:26:32,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:32,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:32,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,588 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 23:26:32,588 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:32,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,620 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 23:26:32,621 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:32,646 INFO L343 Elim1Store]: treesize reduction 86, result has 16.5 percent of original size [2019-12-18 23:26:32,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 23:26:32,647 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:32,660 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:32,660 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:32,660 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:233, output treesize:37 [2019-12-18 23:26:32,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:32,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:32,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,864 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2019-12-18 23:26:32,865 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:32,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 64 [2019-12-18 23:26:32,893 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:32,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:32,905 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-12-18 23:26:32,905 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:32,916 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:32,916 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:32,916 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:213, output treesize:37 [2019-12-18 23:26:33,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:26:33,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:26:33,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2019-12-18 23:26:33,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996144013] [2019-12-18 23:26:33,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-18 23:26:33,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:33,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-18 23:26:33,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 23:26:33,038 INFO L87 Difference]: Start difference. First operand 474 states and 1038 transitions. Second operand 33 states. [2019-12-18 23:26:34,339 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-12-18 23:26:34,711 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-12-18 23:26:34,907 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-12-18 23:26:35,294 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-12-18 23:26:35,634 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-12-18 23:26:35,821 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-12-18 23:26:36,021 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 52 [2019-12-18 23:26:36,274 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-12-18 23:26:36,625 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-12-18 23:26:36,908 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 62 [2019-12-18 23:26:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:38,414 INFO L93 Difference]: Finished difference Result 527 states and 1141 transitions. [2019-12-18 23:26:38,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 23:26:38,415 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 25 [2019-12-18 23:26:38,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:38,418 INFO L225 Difference]: With dead ends: 527 [2019-12-18 23:26:38,419 INFO L226 Difference]: Without dead ends: 510 [2019-12-18 23:26:38,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=562, Invalid=3098, Unknown=0, NotChecked=0, Total=3660 [2019-12-18 23:26:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-12-18 23:26:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 446. [2019-12-18 23:26:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-12-18 23:26:38,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 977 transitions. [2019-12-18 23:26:38,432 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 977 transitions. Word has length 25 [2019-12-18 23:26:38,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:38,433 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 977 transitions. [2019-12-18 23:26:38,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-18 23:26:38,433 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 977 transitions. [2019-12-18 23:26:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:26:38,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:38,434 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:26:38,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:26:38,638 INFO L410 AbstractCegarLoop]: === Iteration 28 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:26:38,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:38,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1818538862, now seen corresponding path program 16 times [2019-12-18 23:26:38,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:38,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597611264] [2019-12-18 23:26:38,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:39,146 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 41 [2019-12-18 23:26:39,918 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-18 23:26:39,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597611264] [2019-12-18 23:26:39,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127267921] [2019-12-18 23:26:39,919 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-18 23:26:39,983 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:26:39,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:26:39,985 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 108 conjunts are in the unsatisfiable core [2019-12-18 23:26:39,986 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:26:39,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-18 23:26:39,996 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:40,018 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 23:26:40,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:40,021 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:26:40,022 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:40,032 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:40,033 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:40,033 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-18 23:26:40,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:40,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:40,517 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:26:40,543 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:40,544 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 23:26:40,545 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:40,605 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 23:26:40,605 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:40,606 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2019-12-18 23:26:40,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:40,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:40,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:40,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:40,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:40,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:40,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 23:26:40,794 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:40,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:40,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:40,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:40,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:40,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 23:26:40,830 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:40,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:40,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:40,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:40,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 23:26:40,838 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:40,859 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:40,860 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:40,860 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:269, output treesize:49 [2019-12-18 23:26:41,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:41,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:41,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:41,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:41,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 120 [2019-12-18 23:26:41,123 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:41,184 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-18 23:26:41,184 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:41,185 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:49 [2019-12-18 23:26:41,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:41,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:41,289 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 23:26:41,289 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:41,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 23:26:41,314 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:41,327 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2019-12-18 23:26:41,327 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:41,391 INFO L614 ElimStorePlain]: treesize reduction 121, result has 27.5 percent of original size [2019-12-18 23:26:41,392 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:41,392 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:212, output treesize:46 [2019-12-18 23:26:41,616 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:41,617 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 51 [2019-12-18 23:26:41,617 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:41,626 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:41,627 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:26:41,627 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:7 [2019-12-18 23:26:41,655 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-18 23:26:41,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:26:41,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2019-12-18 23:26:41,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895687016] [2019-12-18 23:26:41,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-18 23:26:41,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:41,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-18 23:26:41,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 23:26:41,657 INFO L87 Difference]: Start difference. First operand 446 states and 977 transitions. Second operand 38 states. [2019-12-18 23:26:42,541 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-12-18 23:26:42,767 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-18 23:26:42,992 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2019-12-18 23:26:44,026 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-12-18 23:26:44,475 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-12-18 23:26:45,176 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-12-18 23:26:46,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:46,929 INFO L93 Difference]: Finished difference Result 540 states and 1184 transitions. [2019-12-18 23:26:46,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 23:26:46,931 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 25 [2019-12-18 23:26:46,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:46,934 INFO L225 Difference]: With dead ends: 540 [2019-12-18 23:26:46,934 INFO L226 Difference]: Without dead ends: 540 [2019-12-18 23:26:46,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1308 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=630, Invalid=3926, Unknown=0, NotChecked=0, Total=4556 [2019-12-18 23:26:46,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-12-18 23:26:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 436. [2019-12-18 23:26:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-12-18 23:26:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 955 transitions. [2019-12-18 23:26:46,943 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 955 transitions. Word has length 25 [2019-12-18 23:26:46,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:46,943 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 955 transitions. [2019-12-18 23:26:46,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-18 23:26:46,943 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 955 transitions. [2019-12-18 23:26:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:26:46,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:46,944 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:26:47,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:26:47,148 INFO L410 AbstractCegarLoop]: === Iteration 29 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:26:47,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:47,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1019314796, now seen corresponding path program 5 times [2019-12-18 23:26:47,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:47,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209488628] [2019-12-18 23:26:47,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:26:47,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209488628] [2019-12-18 23:26:47,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838441859] [2019-12-18 23:26:47,903 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:26:47,983 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:26:47,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:26:47,985 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 82 conjunts are in the unsatisfiable core [2019-12-18 23:26:47,987 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:26:47,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-18 23:26:47,996 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:48,016 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 23:26:48,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:48,021 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:26:48,021 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:48,033 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:48,033 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:48,034 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 23:26:48,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:48,367 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:48,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 23:26:48,369 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:48,415 INFO L614 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2019-12-18 23:26:48,416 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:48,416 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:37 [2019-12-18 23:26:48,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:48,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:48,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:48,494 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-18 23:26:48,495 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:48,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:48,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-18 23:26:48,512 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:48,518 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-18 23:26:48,519 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:48,529 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:48,530 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:48,530 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-18 23:26:48,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:48,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:48,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:48,771 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:26:48,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:48,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-18 23:26:48,777 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:48,790 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:26:48,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:48,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-18 23:26:48,797 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:48,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-18 23:26:48,822 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:48,836 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:48,836 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:48,836 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-18 23:26:48,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:26:48,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:26:48,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2019-12-18 23:26:48,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557594950] [2019-12-18 23:26:48,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-18 23:26:48,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:48,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-18 23:26:48,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:26:48,943 INFO L87 Difference]: Start difference. First operand 436 states and 955 transitions. Second operand 32 states. [2019-12-18 23:26:50,098 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2019-12-18 23:26:52,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:26:52,405 INFO L93 Difference]: Finished difference Result 477 states and 1034 transitions. [2019-12-18 23:26:52,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 23:26:52,406 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 25 [2019-12-18 23:26:52,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:26:52,409 INFO L225 Difference]: With dead ends: 477 [2019-12-18 23:26:52,409 INFO L226 Difference]: Without dead ends: 460 [2019-12-18 23:26:52,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=390, Invalid=2060, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 23:26:52,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-12-18 23:26:52,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 384. [2019-12-18 23:26:52,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-12-18 23:26:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 846 transitions. [2019-12-18 23:26:52,426 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 846 transitions. Word has length 25 [2019-12-18 23:26:52,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:26:52,426 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 846 transitions. [2019-12-18 23:26:52,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-18 23:26:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 846 transitions. [2019-12-18 23:26:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 23:26:52,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:26:52,427 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:26:52,627 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:26:52,628 INFO L410 AbstractCegarLoop]: === Iteration 30 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:26:52,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:26:52,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1770531068, now seen corresponding path program 17 times [2019-12-18 23:26:52,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:26:52,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261541590] [2019-12-18 23:26:52,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:26:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:26:53,241 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 39 [2019-12-18 23:26:53,502 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2019-12-18 23:26:53,793 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-12-18 23:26:54,098 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 38 [2019-12-18 23:26:54,304 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2019-12-18 23:26:54,493 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-12-18 23:26:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:26:54,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261541590] [2019-12-18 23:26:54,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762871521] [2019-12-18 23:26:54,967 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-18 23:26:55,045 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-18 23:26:55,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:26:55,048 WARN L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 121 conjunts are in the unsatisfiable core [2019-12-18 23:26:55,049 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:26:55,063 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 23:26:55,063 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 23:26:55,101 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 23:26:55,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:55,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:26:55,105 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:55,116 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:55,117 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:55,117 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-18 23:26:55,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:55,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:55,629 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:26:55,655 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:55,656 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 23:26:55,657 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:55,728 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 23:26:55,729 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:55,729 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2019-12-18 23:26:55,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:55,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:55,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:55,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:55,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:55,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:55,921 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 23:26:55,922 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:55,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:55,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:55,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:55,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:55,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 23:26:55,955 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:55,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:55,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:55,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:55,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 23:26:55,963 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:55,984 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:55,985 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:55,985 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:269, output treesize:49 [2019-12-18 23:26:56,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:56,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:56,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:56,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:56,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:56,242 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:26:56,284 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:56,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 120 [2019-12-18 23:26:56,286 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:56,360 INFO L614 ElimStorePlain]: treesize reduction 72, result has 47.1 percent of original size [2019-12-18 23:26:56,361 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:56,361 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:55 [2019-12-18 23:26:56,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:56,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:56,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:56,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:56,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:56,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-18 23:26:56,493 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:56,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:56,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:56,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:56,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-18 23:26:56,520 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:56,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:56,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:56,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:26:56,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2019-12-18 23:26:56,536 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:56,611 INFO L614 ElimStorePlain]: treesize reduction 141, result has 28.4 percent of original size [2019-12-18 23:26:56,612 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:56,612 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:254, output treesize:56 [2019-12-18 23:26:56,920 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:56,921 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 107 [2019-12-18 23:26:56,922 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:56,990 INFO L614 ElimStorePlain]: treesize reduction 84, result has 46.5 percent of original size [2019-12-18 23:26:56,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:56,991 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:26:56,991 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:65, output treesize:58 [2019-12-18 23:26:56,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:57,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:57,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:57,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:57,439 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2019-12-18 23:26:57,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:26:57,547 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:57,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 55 [2019-12-18 23:26:57,548 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:26:57,558 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:26:57,559 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:26:57,560 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:7 [2019-12-18 23:26:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:26:57,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:26:57,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2019-12-18 23:26:57,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232961063] [2019-12-18 23:26:57,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-12-18 23:26:57,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:26:57,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-12-18 23:26:57,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1903, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 23:26:57,663 INFO L87 Difference]: Start difference. First operand 384 states and 846 transitions. Second operand 46 states. [2019-12-18 23:26:58,384 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-12-18 23:26:58,631 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-18 23:26:58,825 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-12-18 23:26:59,007 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-12-18 23:26:59,303 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-12-18 23:26:59,598 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 55 [2019-12-18 23:26:59,967 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 60 [2019-12-18 23:27:00,196 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2019-12-18 23:27:00,524 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 55 [2019-12-18 23:27:00,829 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 60 [2019-12-18 23:27:01,076 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 54 [2019-12-18 23:27:01,414 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 64 [2019-12-18 23:27:01,922 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 63 [2019-12-18 23:27:02,200 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-12-18 23:27:02,840 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-18 23:27:03,048 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-12-18 23:27:03,653 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-12-18 23:27:03,951 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 54 [2019-12-18 23:27:04,190 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-12-18 23:27:04,380 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-12-18 23:27:04,639 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-12-18 23:27:04,933 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 48 [2019-12-18 23:27:05,160 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-12-18 23:27:05,725 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-12-18 23:27:05,987 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2019-12-18 23:27:06,490 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-12-18 23:27:06,755 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 59 [2019-12-18 23:27:06,993 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 70 [2019-12-18 23:27:07,516 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 53 [2019-12-18 23:27:07,821 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-12-18 23:27:08,356 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2019-12-18 23:27:08,595 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2019-12-18 23:27:08,887 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 82 [2019-12-18 23:27:09,190 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2019-12-18 23:27:09,467 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 55 [2019-12-18 23:27:09,722 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 76 [2019-12-18 23:27:09,994 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-12-18 23:27:10,297 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 62 [2019-12-18 23:27:10,580 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 76 [2019-12-18 23:27:11,216 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 55 [2019-12-18 23:27:11,505 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2019-12-18 23:27:12,018 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 76 [2019-12-18 23:27:12,282 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-12-18 23:27:12,664 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 78 [2019-12-18 23:27:13,145 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2019-12-18 23:27:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:27:13,917 INFO L93 Difference]: Finished difference Result 600 states and 1304 transitions. [2019-12-18 23:27:13,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-18 23:27:13,918 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 30 [2019-12-18 23:27:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:27:13,922 INFO L225 Difference]: With dead ends: 600 [2019-12-18 23:27:13,922 INFO L226 Difference]: Without dead ends: 600 [2019-12-18 23:27:13,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3297 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=1160, Invalid=10396, Unknown=0, NotChecked=0, Total=11556 [2019-12-18 23:27:13,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-12-18 23:27:13,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 468. [2019-12-18 23:27:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-12-18 23:27:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1021 transitions. [2019-12-18 23:27:13,932 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1021 transitions. Word has length 30 [2019-12-18 23:27:13,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:27:13,932 INFO L462 AbstractCegarLoop]: Abstraction has 468 states and 1021 transitions. [2019-12-18 23:27:13,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-12-18 23:27:13,932 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1021 transitions. [2019-12-18 23:27:13,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 23:27:13,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:27:13,933 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:27:14,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:27:14,137 INFO L410 AbstractCegarLoop]: === Iteration 31 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:27:14,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:27:14,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1237545890, now seen corresponding path program 6 times [2019-12-18 23:27:14,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:27:14,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799993819] [2019-12-18 23:27:14,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:27:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:14,910 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 36 [2019-12-18 23:27:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:27:15,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799993819] [2019-12-18 23:27:15,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987073371] [2019-12-18 23:27:15,458 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-18 23:27:15,544 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 23:27:15,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:27:15,547 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 119 conjunts are in the unsatisfiable core [2019-12-18 23:27:15,548 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:27:15,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 23:27:15,558 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 23:27:15,586 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 23:27:15,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:15,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:27:15,591 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:15,601 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:15,602 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:15,602 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 23:27:16,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:16,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:16,056 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:16,083 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:16,084 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 23:27:16,085 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:16,150 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-18 23:27:16,151 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:16,151 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-18 23:27:16,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:27:16,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:27:16,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:16,289 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:16,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:16,293 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-18 23:27:16,293 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:16,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:16,313 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:16,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:16,316 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-18 23:27:16,317 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:16,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:16,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-18 23:27:16,323 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:16,343 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:16,343 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:16,344 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-18 23:27:16,567 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:16,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 77 [2019-12-18 23:27:16,568 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:16,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:16,586 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:16,587 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-12-18 23:27:16,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:27:16,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:27:16,906 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:16,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:16,944 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:16,945 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 113 [2019-12-18 23:27:16,946 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:16,976 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:16,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:17,013 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:17,014 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 124 [2019-12-18 23:27:17,015 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:17,049 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:17,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 114 [2019-12-18 23:27:17,051 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:17,090 INFO L614 ElimStorePlain]: treesize reduction 26, result has 64.9 percent of original size [2019-12-18 23:27:17,091 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:17,091 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:267, output treesize:48 [2019-12-18 23:27:17,248 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:17,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 58 [2019-12-18 23:27:17,250 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:17,255 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:17,255 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:27:17,255 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:7 [2019-12-18 23:27:17,339 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-18 23:27:17,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:27:17,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 39 [2019-12-18 23:27:17,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281314966] [2019-12-18 23:27:17,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-18 23:27:17,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:27:17,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-18 23:27:17,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1415, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 23:27:17,341 INFO L87 Difference]: Start difference. First operand 468 states and 1021 transitions. Second operand 40 states. [2019-12-18 23:27:18,542 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-12-18 23:27:18,820 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-12-18 23:27:19,303 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-12-18 23:27:19,726 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-12-18 23:27:21,660 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-12-18 23:27:22,367 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-12-18 23:27:22,758 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-18 23:27:22,917 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-12-18 23:27:23,326 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-12-18 23:27:23,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:27:23,902 INFO L93 Difference]: Finished difference Result 525 states and 1131 transitions. [2019-12-18 23:27:23,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 23:27:23,903 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 30 [2019-12-18 23:27:23,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:27:23,906 INFO L225 Difference]: With dead ends: 525 [2019-12-18 23:27:23,906 INFO L226 Difference]: Without dead ends: 513 [2019-12-18 23:27:23,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=710, Invalid=5452, Unknown=0, NotChecked=0, Total=6162 [2019-12-18 23:27:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-12-18 23:27:23,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 488. [2019-12-18 23:27:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-12-18 23:27:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1061 transitions. [2019-12-18 23:27:23,914 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1061 transitions. Word has length 30 [2019-12-18 23:27:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:27:23,914 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 1061 transitions. [2019-12-18 23:27:23,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-18 23:27:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1061 transitions. [2019-12-18 23:27:23,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 23:27:23,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:27:23,915 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:27:24,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:27:24,119 INFO L410 AbstractCegarLoop]: === Iteration 32 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:27:24,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:27:24,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1988729270, now seen corresponding path program 7 times [2019-12-18 23:27:24,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:27:24,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841848138] [2019-12-18 23:27:24,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:27:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:24,787 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 36 [2019-12-18 23:27:25,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:27:25,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841848138] [2019-12-18 23:27:25,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560297457] [2019-12-18 23:27:25,572 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-18 23:27:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:25,651 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 110 conjunts are in the unsatisfiable core [2019-12-18 23:27:25,653 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:27:25,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 23:27:25,659 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 23:27:25,688 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 23:27:25,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:25,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:27:25,693 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:25,704 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:25,705 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:25,705 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 23:27:26,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:26,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:26,071 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:26,099 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:26,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 23:27:26,100 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:26,166 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-18 23:27:26,167 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:26,167 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-18 23:27:26,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:27:26,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:27:26,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:26,309 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:26,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:26,312 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-18 23:27:26,313 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:26,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:26,332 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:26,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:26,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-18 23:27:26,335 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:26,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:26,342 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-18 23:27:26,343 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:26,360 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:26,360 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:26,361 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-18 23:27:26,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:27:26,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:27:26,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:26,747 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:26,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:26,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 55 [2019-12-18 23:27:26,755 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:26,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:26,768 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:26,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:26,774 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2019-12-18 23:27:26,775 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:26,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:26,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2019-12-18 23:27:26,779 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:26,801 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:26,802 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:26,802 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:258, output treesize:52 [2019-12-18 23:27:26,899 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:26,900 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 77 [2019-12-18 23:27:26,901 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:26,914 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:26,915 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:26,915 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-12-18 23:27:27,049 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:27,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 47 [2019-12-18 23:27:27,050 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:27,056 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:27,057 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:27:27,057 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-12-18 23:27:27,151 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-18 23:27:27,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:27:27,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 38 [2019-12-18 23:27:27,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597582977] [2019-12-18 23:27:27,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-18 23:27:27,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:27:27,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-18 23:27:27,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1347, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 23:27:27,153 INFO L87 Difference]: Start difference. First operand 488 states and 1061 transitions. Second operand 39 states. [2019-12-18 23:27:28,109 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-12-18 23:27:28,458 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-12-18 23:27:28,756 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-12-18 23:27:29,288 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-12-18 23:27:29,829 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-12-18 23:27:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:27:32,252 INFO L93 Difference]: Finished difference Result 519 states and 1116 transitions. [2019-12-18 23:27:32,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 23:27:32,252 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 30 [2019-12-18 23:27:32,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:27:32,256 INFO L225 Difference]: With dead ends: 519 [2019-12-18 23:27:32,256 INFO L226 Difference]: Without dead ends: 509 [2019-12-18 23:27:32,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=500, Invalid=3790, Unknown=0, NotChecked=0, Total=4290 [2019-12-18 23:27:32,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-12-18 23:27:32,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 494. [2019-12-18 23:27:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-12-18 23:27:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1073 transitions. [2019-12-18 23:27:32,262 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1073 transitions. Word has length 30 [2019-12-18 23:27:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:27:32,263 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 1073 transitions. [2019-12-18 23:27:32,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-18 23:27:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1073 transitions. [2019-12-18 23:27:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 23:27:32,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:27:32,264 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:27:32,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:27:32,464 INFO L410 AbstractCegarLoop]: === Iteration 33 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:27:32,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:27:32,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1321452678, now seen corresponding path program 8 times [2019-12-18 23:27:32,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:27:32,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097409740] [2019-12-18 23:27:32,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:27:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:33,555 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 49 [2019-12-18 23:27:33,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:27:33,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097409740] [2019-12-18 23:27:33,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930899800] [2019-12-18 23:27:33,678 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-18 23:27:33,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:27:33,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:27:33,763 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 120 conjunts are in the unsatisfiable core [2019-12-18 23:27:33,765 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:27:33,772 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 23:27:33,773 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 23:27:33,799 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 23:27:33,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:33,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:27:33,805 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:33,817 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:33,817 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:33,817 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 23:27:34,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:34,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:34,170 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:34,197 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:34,197 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 23:27:34,199 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:34,267 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-18 23:27:34,268 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:34,269 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-18 23:27:34,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:27:34,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:27:34,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:34,415 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:34,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:34,419 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-18 23:27:34,420 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:34,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:34,440 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:34,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:34,443 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-18 23:27:34,444 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:34,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:34,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-18 23:27:34,451 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:34,468 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:34,469 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:34,469 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-18 23:27:34,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:27:34,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:27:34,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:34,848 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:34,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:34,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2019-12-18 23:27:34,857 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:34,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:34,872 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:34,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:34,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 55 [2019-12-18 23:27:34,892 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:34,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:34,917 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2019-12-18 23:27:34,918 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:34,942 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:34,943 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:34,943 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:258, output treesize:52 [2019-12-18 23:27:35,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:35,036 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 77 [2019-12-18 23:27:35,037 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:35,051 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:35,052 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:35,052 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-12-18 23:27:35,184 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:35,184 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 47 [2019-12-18 23:27:35,185 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:35,189 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:35,190 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:27:35,190 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-12-18 23:27:35,270 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-18 23:27:35,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:27:35,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 37 [2019-12-18 23:27:35,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679117762] [2019-12-18 23:27:35,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-18 23:27:35,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:27:35,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-18 23:27:35,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1276, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 23:27:35,272 INFO L87 Difference]: Start difference. First operand 494 states and 1073 transitions. Second operand 38 states. [2019-12-18 23:27:36,551 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-12-18 23:27:36,829 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-12-18 23:27:37,328 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-12-18 23:27:37,869 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-12-18 23:27:40,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:27:40,919 INFO L93 Difference]: Finished difference Result 527 states and 1132 transitions. [2019-12-18 23:27:40,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 23:27:40,919 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 30 [2019-12-18 23:27:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:27:40,923 INFO L225 Difference]: With dead ends: 527 [2019-12-18 23:27:40,923 INFO L226 Difference]: Without dead ends: 517 [2019-12-18 23:27:40,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=572, Invalid=4398, Unknown=0, NotChecked=0, Total=4970 [2019-12-18 23:27:40,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-12-18 23:27:40,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 492. [2019-12-18 23:27:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-12-18 23:27:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1069 transitions. [2019-12-18 23:27:40,931 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1069 transitions. Word has length 30 [2019-12-18 23:27:40,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:27:40,931 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 1069 transitions. [2019-12-18 23:27:40,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-18 23:27:40,932 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1069 transitions. [2019-12-18 23:27:40,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 23:27:40,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:27:40,933 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:27:41,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:27:41,137 INFO L410 AbstractCegarLoop]: === Iteration 34 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:27:41,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:27:41,137 INFO L82 PathProgramCache]: Analyzing trace with hash 532773680, now seen corresponding path program 9 times [2019-12-18 23:27:41,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:27:41,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100164790] [2019-12-18 23:27:41,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:27:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:27:42,225 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 38 [2019-12-18 23:27:42,422 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 49 [2019-12-18 23:27:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:27:42,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100164790] [2019-12-18 23:27:42,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370841466] [2019-12-18 23:27:42,547 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-18 23:27:42,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 23:27:42,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:27:42,643 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 123 conjunts are in the unsatisfiable core [2019-12-18 23:27:42,644 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:27:42,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-18 23:27:42,659 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:42,678 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 23:27:42,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:42,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 23:27:42,683 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:42,694 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:42,694 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:42,695 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 23:27:43,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:43,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:43,179 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:43,204 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:43,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 23:27:43,206 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:43,269 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-18 23:27:43,270 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:43,270 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-18 23:27:43,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:27:43,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:27:43,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:43,413 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:43,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:43,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-18 23:27:43,417 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:43,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:43,439 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:43,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:43,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-18 23:27:43,443 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:43,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:43,451 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-18 23:27:43,451 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:43,471 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:43,472 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:43,472 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-18 23:27:43,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:27:43,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:27:43,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:43,854 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:43,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:43,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2019-12-18 23:27:43,863 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:43,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:43,888 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:27:43,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:43,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 55 [2019-12-18 23:27:43,895 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:43,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:27:43,901 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2019-12-18 23:27:43,901 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:43,923 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:43,924 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:43,924 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:258, output treesize:52 [2019-12-18 23:27:44,023 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:44,023 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 77 [2019-12-18 23:27:44,024 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:44,038 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:44,039 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:27:44,039 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-12-18 23:27:44,222 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:44,222 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 47 [2019-12-18 23:27:44,223 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:27:44,227 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:27:44,228 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:27:44,228 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-12-18 23:27:44,314 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-18 23:27:44,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:27:44,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 38 [2019-12-18 23:27:44,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349882158] [2019-12-18 23:27:44,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-18 23:27:44,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:27:44,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-18 23:27:44,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1344, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 23:27:44,318 INFO L87 Difference]: Start difference. First operand 492 states and 1069 transitions. Second operand 39 states. Received shutdown request... [2019-12-18 23:27:44,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:27:44,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:27:44,870 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 23:27:44,874 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 23:27:44,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:27:44 BasicIcfg [2019-12-18 23:27:44,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:27:44,875 INFO L168 Benchmark]: Toolchain (without parser) took 244441.04 ms. Allocated memory was 146.3 MB in the beginning and 299.9 MB in the end (delta: 153.6 MB). Free memory was 102.1 MB in the beginning and 99.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 156.4 MB. Max. memory is 7.1 GB. [2019-12-18 23:27:44,876 INFO L168 Benchmark]: CDTParser took 1.45 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 23:27:44,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 795.85 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 149.0 MB in the end (delta: -47.3 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-12-18 23:27:44,876 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.83 ms. Allocated memory is still 203.4 MB. Free memory was 149.0 MB in the beginning and 146.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:27:44,876 INFO L168 Benchmark]: Boogie Preprocessor took 33.87 ms. Allocated memory is still 203.4 MB. Free memory was 146.4 MB in the beginning and 145.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-18 23:27:44,876 INFO L168 Benchmark]: RCFGBuilder took 580.68 ms. Allocated memory is still 203.4 MB. Free memory was 144.4 MB in the beginning and 114.7 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 7.1 GB. [2019-12-18 23:27:44,876 INFO L168 Benchmark]: TraceAbstraction took 242972.67 ms. Allocated memory was 203.4 MB in the beginning and 299.9 MB in the end (delta: 96.5 MB). Free memory was 114.7 MB in the beginning and 99.4 MB in the end (delta: 15.3 MB). Peak memory consumption was 111.8 MB. Max. memory is 7.1 GB. [2019-12-18 23:27:44,877 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.45 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 795.85 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 149.0 MB in the end (delta: -47.3 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.83 ms. Allocated memory is still 203.4 MB. Free memory was 149.0 MB in the beginning and 146.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.87 ms. Allocated memory is still 203.4 MB. Free memory was 146.4 MB in the beginning and 145.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 580.68 ms. Allocated memory is still 203.4 MB. Free memory was 144.4 MB in the beginning and 114.7 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 242972.67 ms. Allocated memory was 203.4 MB in the beginning and 299.9 MB in the end (delta: 96.5 MB). Free memory was 114.7 MB in the beginning and 99.4 MB in the end (delta: 15.3 MB). Peak memory consumption was 111.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.6s, 122 ProgramPointsBefore, 30 ProgramPointsAfterwards, 128 TransitionsBefore, 34 TransitionsAfterwards, 4968 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 3 ChoiceCompositions, 2658 VarBasedMoverChecksPositive, 43 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5914 CheckedPairsTotal, 112 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 821]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (492states) and FLOYD_HOARE automaton (currently 7 states, 39 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 825]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 825). Cancelled while BasicCegarLoop was constructing difference of abstraction (492states) and FLOYD_HOARE automaton (currently 7 states, 39 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 826]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 826). Cancelled while BasicCegarLoop was constructing difference of abstraction (492states) and FLOYD_HOARE automaton (currently 7 states, 39 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 3 error locations. Result: TIMEOUT, OverallTime: 242.8s, OverallIterations: 34, TraceHistogramMax: 3, AutomataDifference: 168.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 953 SDtfs, 5045 SDslu, 6386 SDs, 0 SdLazy, 48084 SolverSat, 2009 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 57.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1850 GetRequests, 202 SyntacticMatches, 51 SemanticMatches, 1596 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24730 ImplicationChecksByTransitivity, 153.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=494occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 33 MinimizatonAttempts, 2677 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 63.1s InterpolantComputationTime, 1257 NumberOfCodeBlocks, 1257 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 1202 ConstructedInterpolants, 413 QuantifiedInterpolants, 1145138 SizeOfPredicates, 882 NumberOfNonLiveVariables, 3450 ConjunctsInSsa, 2001 ConjunctsInUnsatCore, 55 InterpolantComputations, 13 PerfectInterpolantSequences, 42/316 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