/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-lit/sssc12_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 10:20:24,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 10:20:24,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 10:20:24,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 10:20:24,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 10:20:24,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 10:20:24,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 10:20:24,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 10:20:24,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 10:20:24,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 10:20:24,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 10:20:24,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 10:20:24,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 10:20:24,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 10:20:24,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 10:20:24,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 10:20:24,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 10:20:24,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 10:20:24,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 10:20:24,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 10:20:24,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 10:20:24,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 10:20:24,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 10:20:24,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 10:20:24,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 10:20:24,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 10:20:24,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 10:20:24,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 10:20:24,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 10:20:24,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 10:20:24,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 10:20:24,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 10:20:24,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 10:20:24,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 10:20:24,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 10:20:24,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 10:20:24,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 10:20:24,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 10:20:24,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 10:20:24,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 10:20:24,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 10:20:24,424 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-06-05 10:20:24,451 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 10:20:24,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 10:20:24,452 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 10:20:24,452 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 10:20:24,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 10:20:24,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 10:20:24,454 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 10:20:24,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 10:20:24,454 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 10:20:24,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 10:20:24,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 10:20:24,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 10:20:24,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 10:20:24,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 10:20:24,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 10:20:24,455 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 10:20:24,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 10:20:24,455 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 10:20:24,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 10:20:24,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 10:20:24,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 10:20:24,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 10:20:24,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 10:20:24,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 10:20:24,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 10:20:24,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 10:20:24,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 10:20:24,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 10:20:24,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 10:20:24,456 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 10:20:24,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 10:20:24,457 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 10:20:24,457 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 10:20:24,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 10:20:24,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 10:20:24,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 10:20:24,735 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 10:20:24,735 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 10:20:24,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/sssc12_variant.i [2021-06-05 10:20:24,788 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/732cd8dd8/62b79e1b313046399ee69ec849456343/FLAG2b87bfb4e [2021-06-05 10:20:25,230 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 10:20:25,230 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12_variant.i [2021-06-05 10:20:25,245 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/732cd8dd8/62b79e1b313046399ee69ec849456343/FLAG2b87bfb4e [2021-06-05 10:20:25,260 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/732cd8dd8/62b79e1b313046399ee69ec849456343 [2021-06-05 10:20:25,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 10:20:25,264 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 10:20:25,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 10:20:25,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 10:20:25,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 10:20:25,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 10:20:25" (1/1) ... [2021-06-05 10:20:25,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cae0ed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:20:25, skipping insertion in model container [2021-06-05 10:20:25,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 10:20:25" (1/1) ... [2021-06-05 10:20:25,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 10:20:25,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 10:20:25,676 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12_variant.i[46865,46878] [2021-06-05 10:20:25,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 10:20:25,694 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 10:20:25,719 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12_variant.i[46865,46878] [2021-06-05 10:20:25,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 10:20:25,808 INFO L208 MainTranslator]: Completed translation [2021-06-05 10:20:25,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:20:25 WrapperNode [2021-06-05 10:20:25,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 10:20:25,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 10:20:25,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 10:20:25,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 10:20:25,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:20:25" (1/1) ... [2021-06-05 10:20:25,840 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:20:25" (1/1) ... [2021-06-05 10:20:25,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 10:20:25,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 10:20:25,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 10:20:25,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 10:20:25,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:20:25" (1/1) ... [2021-06-05 10:20:25,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:20:25" (1/1) ... [2021-06-05 10:20:25,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:20:25" (1/1) ... [2021-06-05 10:20:25,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:20:25" (1/1) ... [2021-06-05 10:20:25,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:20:25" (1/1) ... [2021-06-05 10:20:25,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:20:25" (1/1) ... [2021-06-05 10:20:25,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:20:25" (1/1) ... [2021-06-05 10:20:25,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 10:20:25,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 10:20:25,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 10:20:25,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 10:20:25,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:20:25" (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 [2021-06-05 10:20:25,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 10:20:25,965 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2021-06-05 10:20:25,965 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2021-06-05 10:20:25,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 10:20:25,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 10:20:25,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 10:20:25,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 10:20:25,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 10:20:25,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-06-05 10:20:25,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 10:20:25,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 10:20:25,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 10:20:25,969 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 10:20:26,278 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 10:20:26,278 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-06-05 10:20:26,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:20:26 BoogieIcfgContainer [2021-06-05 10:20:26,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 10:20:26,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 10:20:26,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 10:20:26,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 10:20:26,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 10:20:25" (1/3) ... [2021-06-05 10:20:26,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6801a700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:20:26, skipping insertion in model container [2021-06-05 10:20:26,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:20:25" (2/3) ... [2021-06-05 10:20:26,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6801a700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:20:26, skipping insertion in model container [2021-06-05 10:20:26,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:20:26" (3/3) ... [2021-06-05 10:20:26,284 INFO L111 eAbstractionObserver]: Analyzing ICFG sssc12_variant.i [2021-06-05 10:20:26,288 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 10:20:26,288 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 10:20:26,289 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 10:20:26,289 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 10:20:26,304 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,305 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,305 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,305 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,305 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,305 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,305 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,305 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,305 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,305 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,306 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,306 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,306 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,306 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,306 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,306 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,306 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,306 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,307 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,307 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,307 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,307 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,307 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,307 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,307 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,307 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,308 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,308 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,308 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,308 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,308 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,308 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,308 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,308 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,309 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,309 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,309 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,309 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,309 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,309 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,309 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,309 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,309 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,310 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,310 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,310 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,310 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,310 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,310 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,310 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,311 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,311 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,311 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,311 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,311 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,311 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,311 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,311 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,311 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,312 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,312 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,312 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,312 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,312 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,312 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,312 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,312 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,313 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,313 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,313 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,314 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,314 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,314 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,314 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,315 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,315 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,315 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,315 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,315 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,315 WARN L313 ript$VariableManager]: TermVariabe thrThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,315 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:26,317 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 10:20:26,331 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 10:20:26,343 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 10:20:26,343 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 10:20:26,343 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 10:20:26,344 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 10:20:26,344 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 10:20:26,344 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 10:20:26,344 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 10:20:26,344 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 10:20:26,351 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 75 transitions, 155 flow [2021-06-05 10:20:26,371 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 418 states, 413 states have (on average 2.0338983050847457) internal successors, (840), 417 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 418 states, 413 states have (on average 2.0338983050847457) internal successors, (840), 417 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:26,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-06-05 10:20:26,383 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:26,384 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:26,384 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:26,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:26,388 INFO L82 PathProgramCache]: Analyzing trace with hash -540929574, now seen corresponding path program 1 times [2021-06-05 10:20:26,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:26,393 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984075445] [2021-06-05 10:20:26,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:26,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:20:26,546 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:26,546 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984075445] [2021-06-05 10:20:26,547 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984075445] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:26,547 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:20:26,547 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 10:20:26,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668577643] [2021-06-05 10:20:26,550 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 10:20:26,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:26,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 10:20:26,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 10:20:26,561 INFO L87 Difference]: Start difference. First operand has 418 states, 413 states have (on average 2.0338983050847457) internal successors, (840), 417 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:26,590 INFO L93 Difference]: Finished difference Result 282 states and 499 transitions. [2021-06-05 10:20:26,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 10:20:26,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-06-05 10:20:26,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:26,598 INFO L225 Difference]: With dead ends: 282 [2021-06-05 10:20:26,598 INFO L226 Difference]: Without dead ends: 217 [2021-06-05 10:20:26,599 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 10:20:26,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-06-05 10:20:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-06-05 10:20:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.75) internal successors, (378), 216 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 378 transitions. [2021-06-05 10:20:26,629 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 378 transitions. Word has length 50 [2021-06-05 10:20:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:26,630 INFO L482 AbstractCegarLoop]: Abstraction has 217 states and 378 transitions. [2021-06-05 10:20:26,630 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 378 transitions. [2021-06-05 10:20:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 10:20:26,632 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:26,632 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:26,632 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 10:20:26,632 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:26,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:26,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1808907713, now seen corresponding path program 1 times [2021-06-05 10:20:26,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:26,633 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590187235] [2021-06-05 10:20:26,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:20:26,713 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:26,713 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590187235] [2021-06-05 10:20:26,713 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590187235] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:26,713 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:20:26,713 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:20:26,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856239119] [2021-06-05 10:20:26,715 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:20:26,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:26,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:20:26,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:20:26,716 INFO L87 Difference]: Start difference. First operand 217 states and 378 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:26,894 INFO L93 Difference]: Finished difference Result 299 states and 513 transitions. [2021-06-05 10:20:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 10:20:26,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-06-05 10:20:26,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:26,897 INFO L225 Difference]: With dead ends: 299 [2021-06-05 10:20:26,897 INFO L226 Difference]: Without dead ends: 215 [2021-06-05 10:20:26,898 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 101.1ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-06-05 10:20:26,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-06-05 10:20:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 173. [2021-06-05 10:20:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.6511627906976745) internal successors, (284), 172 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 284 transitions. [2021-06-05 10:20:26,913 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 284 transitions. Word has length 53 [2021-06-05 10:20:26,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:26,913 INFO L482 AbstractCegarLoop]: Abstraction has 173 states and 284 transitions. [2021-06-05 10:20:26,913 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 284 transitions. [2021-06-05 10:20:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 10:20:26,914 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:26,915 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:26,915 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 10:20:26,915 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:26,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:26,915 INFO L82 PathProgramCache]: Analyzing trace with hash -748927795, now seen corresponding path program 1 times [2021-06-05 10:20:26,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:26,915 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073235261] [2021-06-05 10:20:26,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 10:20:27,023 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:27,023 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073235261] [2021-06-05 10:20:27,023 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073235261] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:27,024 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:20:27,024 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 10:20:27,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25089459] [2021-06-05 10:20:27,024 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 10:20:27,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:27,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 10:20:27,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 10:20:27,026 INFO L87 Difference]: Start difference. First operand 173 states and 284 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:27,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:27,212 INFO L93 Difference]: Finished difference Result 211 states and 354 transitions. [2021-06-05 10:20:27,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 10:20:27,213 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-06-05 10:20:27,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:27,213 INFO L225 Difference]: With dead ends: 211 [2021-06-05 10:20:27,213 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 10:20:27,214 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 149.4ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:20:27,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 10:20:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 10:20:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 10:20:27,214 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2021-06-05 10:20:27,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:27,215 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 10:20:27,215 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:27,215 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 10:20:27,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 10:20:27,216 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 10:20:27,216 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 10:20:27,218 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 10:20:27,220 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 10:20:27,220 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 10:20:27,220 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 10:20:27,220 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 10:20:27,220 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 10:20:27,220 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 10:20:27,220 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 10:20:27,220 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 10:20:27,225 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 75 transitions, 155 flow [2021-06-05 10:20:27,229 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 418 states, 413 states have (on average 2.0338983050847457) internal successors, (840), 417 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:27,230 INFO L276 IsEmpty]: Start isEmpty. Operand has 418 states, 413 states have (on average 2.0338983050847457) internal successors, (840), 417 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:27,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-06-05 10:20:27,231 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:27,231 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:27,231 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 10:20:27,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:27,231 INFO L82 PathProgramCache]: Analyzing trace with hash -877671068, now seen corresponding path program 1 times [2021-06-05 10:20:27,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:27,231 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764447965] [2021-06-05 10:20:27,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 10:20:27,242 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 10:20:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 10:20:27,255 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 10:20:27,276 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 10:20:27,276 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 10:20:27,276 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 10:20:27,276 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 10:20:27,276 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 10:20:27,277 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 10:20:27,290 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,290 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,290 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,290 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,290 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,290 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,290 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,290 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,290 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,291 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,291 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,291 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,291 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,291 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,291 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,291 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,291 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,291 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,292 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,292 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,292 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,292 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,292 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,292 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,292 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,292 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,292 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,292 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,292 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,293 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,293 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,293 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,293 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,293 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,293 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,293 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,293 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,293 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,293 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,293 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,294 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,294 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,294 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,294 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,294 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,294 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,294 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,294 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,294 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,294 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,294 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,294 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,295 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,295 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,295 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,295 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,295 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,295 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,296 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,296 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,296 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,296 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,297 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,297 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,297 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,297 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,297 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,297 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,297 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,297 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,297 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,297 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,298 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,298 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,298 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,298 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,298 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,298 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,298 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,298 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,298 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,298 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,299 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,300 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,300 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,300 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,300 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,300 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,300 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,300 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,300 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,300 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,301 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,301 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,301 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,301 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,301 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,301 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,301 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,301 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,301 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,301 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,301 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,301 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,301 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,302 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,302 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,302 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,303 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,303 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,303 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,304 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,304 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,304 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,304 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,304 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,304 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,304 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,305 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,305 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,305 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,305 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,305 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,305 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,305 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,305 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,305 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,306 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,306 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,306 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,306 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,306 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,306 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,306 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,306 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,306 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,306 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,307 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,307 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,307 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,307 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,307 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,307 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,307 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,307 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,308 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,308 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,308 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,308 WARN L313 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,308 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,308 WARN L313 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,310 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,310 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,310 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,310 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,310 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,310 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,310 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,310 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,310 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,310 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~end~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,310 WARN L313 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:20:27,312 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 10:20:27,312 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 10:20:27,313 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 10:20:27,313 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 10:20:27,313 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 10:20:27,313 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 10:20:27,313 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 10:20:27,313 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 10:20:27,313 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 10:20:27,314 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 10:20:27,318 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 106 transitions, 224 flow [2021-06-05 10:20:27,695 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10597 states, 10586 states have (on average 3.1830719818628377) internal successors, (33696), 10596 states have internal predecessors, (33696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:27,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 10597 states, 10586 states have (on average 3.1830719818628377) internal successors, (33696), 10596 states have internal predecessors, (33696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:27,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-06-05 10:20:27,720 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:27,720 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:27,721 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:27,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:27,721 INFO L82 PathProgramCache]: Analyzing trace with hash -531104038, now seen corresponding path program 1 times [2021-06-05 10:20:27,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:27,721 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417945310] [2021-06-05 10:20:27,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:27,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:20:27,753 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:27,753 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417945310] [2021-06-05 10:20:27,753 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417945310] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:27,753 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:20:27,753 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 10:20:27,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604376597] [2021-06-05 10:20:27,754 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 10:20:27,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:27,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 10:20:27,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 10:20:27,774 INFO L87 Difference]: Start difference. First operand has 10597 states, 10586 states have (on average 3.1830719818628377) internal successors, (33696), 10596 states have internal predecessors, (33696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:27,827 INFO L93 Difference]: Finished difference Result 6699 states and 19254 transitions. [2021-06-05 10:20:27,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 10:20:27,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-06-05 10:20:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:27,859 INFO L225 Difference]: With dead ends: 6699 [2021-06-05 10:20:27,859 INFO L226 Difference]: Without dead ends: 6506 [2021-06-05 10:20:27,860 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 10:20:27,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6506 states. [2021-06-05 10:20:28,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6506 to 5933. [2021-06-05 10:20:28,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5933 states, 5930 states have (on average 2.9070826306913995) internal successors, (17239), 5932 states have internal predecessors, (17239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5933 states to 5933 states and 17239 transitions. [2021-06-05 10:20:28,096 INFO L78 Accepts]: Start accepts. Automaton has 5933 states and 17239 transitions. Word has length 50 [2021-06-05 10:20:28,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:28,096 INFO L482 AbstractCegarLoop]: Abstraction has 5933 states and 17239 transitions. [2021-06-05 10:20:28,096 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 5933 states and 17239 transitions. [2021-06-05 10:20:28,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 10:20:28,099 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:28,099 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:28,099 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 10:20:28,099 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:28,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:28,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1154005817, now seen corresponding path program 1 times [2021-06-05 10:20:28,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:28,100 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547645842] [2021-06-05 10:20:28,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:20:28,178 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:28,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547645842] [2021-06-05 10:20:28,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547645842] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:28,178 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:20:28,179 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:20:28,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768590794] [2021-06-05 10:20:28,180 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:20:28,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:28,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:20:28,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:20:28,180 INFO L87 Difference]: Start difference. First operand 5933 states and 17239 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:28,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:28,436 INFO L93 Difference]: Finished difference Result 13572 states and 39395 transitions. [2021-06-05 10:20:28,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 10:20:28,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-06-05 10:20:28,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:28,484 INFO L225 Difference]: With dead ends: 13572 [2021-06-05 10:20:28,484 INFO L226 Difference]: Without dead ends: 13314 [2021-06-05 10:20:28,484 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 71.8ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-06-05 10:20:28,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13314 states. [2021-06-05 10:20:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13314 to 6840. [2021-06-05 10:20:28,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6840 states, 6837 states have (on average 2.906830481205207) internal successors, (19874), 6839 states have internal predecessors, (19874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6840 states to 6840 states and 19874 transitions. [2021-06-05 10:20:28,704 INFO L78 Accepts]: Start accepts. Automaton has 6840 states and 19874 transitions. Word has length 53 [2021-06-05 10:20:28,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:28,705 INFO L482 AbstractCegarLoop]: Abstraction has 6840 states and 19874 transitions. [2021-06-05 10:20:28,705 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 6840 states and 19874 transitions. [2021-06-05 10:20:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 10:20:28,708 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:28,708 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:28,708 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 10:20:28,709 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:28,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:28,709 INFO L82 PathProgramCache]: Analyzing trace with hash 875581322, now seen corresponding path program 1 times [2021-06-05 10:20:28,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:28,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649531818] [2021-06-05 10:20:28,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:28,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:20:28,734 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:28,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649531818] [2021-06-05 10:20:28,735 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649531818] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:28,735 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:20:28,735 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 10:20:28,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722935388] [2021-06-05 10:20:28,735 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 10:20:28,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:28,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 10:20:28,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 10:20:28,736 INFO L87 Difference]: Start difference. First operand 6840 states and 19874 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:28,794 INFO L93 Difference]: Finished difference Result 7914 states and 22695 transitions. [2021-06-05 10:20:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 10:20:28,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-06-05 10:20:28,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:28,810 INFO L225 Difference]: With dead ends: 7914 [2021-06-05 10:20:28,810 INFO L226 Difference]: Without dead ends: 7750 [2021-06-05 10:20:28,810 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 10:20:28,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7750 states. [2021-06-05 10:20:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7750 to 7204. [2021-06-05 10:20:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7204 states, 7201 states have (on average 2.8920983196778227) internal successors, (20826), 7203 states have internal predecessors, (20826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7204 states to 7204 states and 20826 transitions. [2021-06-05 10:20:29,016 INFO L78 Accepts]: Start accepts. Automaton has 7204 states and 20826 transitions. Word has length 57 [2021-06-05 10:20:29,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:29,017 INFO L482 AbstractCegarLoop]: Abstraction has 7204 states and 20826 transitions. [2021-06-05 10:20:29,017 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:29,017 INFO L276 IsEmpty]: Start isEmpty. Operand 7204 states and 20826 transitions. [2021-06-05 10:20:29,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 10:20:29,021 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:29,021 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:29,021 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 10:20:29,021 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:29,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:29,022 INFO L82 PathProgramCache]: Analyzing trace with hash 575803177, now seen corresponding path program 1 times [2021-06-05 10:20:29,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:29,022 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497173701] [2021-06-05 10:20:29,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 10:20:29,119 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:29,119 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497173701] [2021-06-05 10:20:29,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497173701] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:29,121 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:20:29,121 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 10:20:29,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198201151] [2021-06-05 10:20:29,121 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 10:20:29,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:29,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 10:20:29,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 10:20:29,122 INFO L87 Difference]: Start difference. First operand 7204 states and 20826 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:29,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:29,526 INFO L93 Difference]: Finished difference Result 13210 states and 37964 transitions. [2021-06-05 10:20:29,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 10:20:29,526 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-06-05 10:20:29,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:29,550 INFO L225 Difference]: With dead ends: 13210 [2021-06-05 10:20:29,550 INFO L226 Difference]: Without dead ends: 11630 [2021-06-05 10:20:29,550 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 188.0ms TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2021-06-05 10:20:29,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11630 states. [2021-06-05 10:20:29,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11630 to 5839. [2021-06-05 10:20:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5839 states, 5836 states have (on average 2.8672035640849898) internal successors, (16733), 5838 states have internal predecessors, (16733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5839 states to 5839 states and 16733 transitions. [2021-06-05 10:20:29,711 INFO L78 Accepts]: Start accepts. Automaton has 5839 states and 16733 transitions. Word has length 59 [2021-06-05 10:20:29,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:29,712 INFO L482 AbstractCegarLoop]: Abstraction has 5839 states and 16733 transitions. [2021-06-05 10:20:29,712 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:29,712 INFO L276 IsEmpty]: Start isEmpty. Operand 5839 states and 16733 transitions. [2021-06-05 10:20:29,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 10:20:29,715 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:29,715 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:29,715 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 10:20:29,716 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:29,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:29,716 INFO L82 PathProgramCache]: Analyzing trace with hash -586382919, now seen corresponding path program 1 times [2021-06-05 10:20:29,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:29,716 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68290869] [2021-06-05 10:20:29,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:20:29,818 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:29,818 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68290869] [2021-06-05 10:20:29,818 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68290869] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:29,818 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:20:29,819 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:20:29,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530505033] [2021-06-05 10:20:29,819 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:20:29,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:29,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:20:29,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:20:29,822 INFO L87 Difference]: Start difference. First operand 5839 states and 16733 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:29,988 INFO L93 Difference]: Finished difference Result 10905 states and 30983 transitions. [2021-06-05 10:20:29,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 10:20:29,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-06-05 10:20:29,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:30,007 INFO L225 Difference]: With dead ends: 10905 [2021-06-05 10:20:30,007 INFO L226 Difference]: Without dead ends: 10479 [2021-06-05 10:20:30,007 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 59.9ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-06-05 10:20:30,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10479 states. [2021-06-05 10:20:30,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10479 to 6109. [2021-06-05 10:20:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6109 states, 6106 states have (on average 2.8380281690140845) internal successors, (17329), 6108 states have internal predecessors, (17329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:30,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6109 states to 6109 states and 17329 transitions. [2021-06-05 10:20:30,131 INFO L78 Accepts]: Start accepts. Automaton has 6109 states and 17329 transitions. Word has length 60 [2021-06-05 10:20:30,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:30,132 INFO L482 AbstractCegarLoop]: Abstraction has 6109 states and 17329 transitions. [2021-06-05 10:20:30,132 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:30,132 INFO L276 IsEmpty]: Start isEmpty. Operand 6109 states and 17329 transitions. [2021-06-05 10:20:30,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 10:20:30,137 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:30,137 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:30,137 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 10:20:30,137 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:30,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:30,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1493189367, now seen corresponding path program 2 times [2021-06-05 10:20:30,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:30,138 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287618195] [2021-06-05 10:20:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 10:20:30,207 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:30,207 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287618195] [2021-06-05 10:20:30,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287618195] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:30,207 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:20:30,207 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 10:20:30,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035344059] [2021-06-05 10:20:30,208 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 10:20:30,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:30,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 10:20:30,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 10:20:30,208 INFO L87 Difference]: Start difference. First operand 6109 states and 17329 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:30,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:30,550 INFO L93 Difference]: Finished difference Result 10287 states and 29164 transitions. [2021-06-05 10:20:30,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 10:20:30,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-05 10:20:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:30,568 INFO L225 Difference]: With dead ends: 10287 [2021-06-05 10:20:30,568 INFO L226 Difference]: Without dead ends: 9020 [2021-06-05 10:20:30,568 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 171.6ms TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2021-06-05 10:20:30,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9020 states. [2021-06-05 10:20:30,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9020 to 5164. [2021-06-05 10:20:30,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5164 states, 5162 states have (on average 2.8299108872530025) internal successors, (14608), 5163 states have internal predecessors, (14608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 14608 transitions. [2021-06-05 10:20:30,669 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 14608 transitions. Word has length 66 [2021-06-05 10:20:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:30,670 INFO L482 AbstractCegarLoop]: Abstraction has 5164 states and 14608 transitions. [2021-06-05 10:20:30,670 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 14608 transitions. [2021-06-05 10:20:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 10:20:30,675 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:30,675 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:30,675 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 10:20:30,675 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:30,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:30,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1491866170, now seen corresponding path program 1 times [2021-06-05 10:20:30,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:30,676 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699597393] [2021-06-05 10:20:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:30,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:20:30,742 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:30,742 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699597393] [2021-06-05 10:20:30,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699597393] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:20:30,742 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377296625] [2021-06-05 10:20:30,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:20:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:30,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 10:20:30,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:20:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:20:31,061 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377296625] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:31,061 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 10:20:31,061 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2021-06-05 10:20:31,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888178123] [2021-06-05 10:20:31,062 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 10:20:31,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:31,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 10:20:31,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-06-05 10:20:31,062 INFO L87 Difference]: Start difference. First operand 5164 states and 14608 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:31,080 INFO L93 Difference]: Finished difference Result 4964 states and 13953 transitions. [2021-06-05 10:20:31,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 10:20:31,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 10:20:31,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:31,095 INFO L225 Difference]: With dead ends: 4964 [2021-06-05 10:20:31,095 INFO L226 Difference]: Without dead ends: 4964 [2021-06-05 10:20:31,095 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.4ms TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-06-05 10:20:31,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4964 states. [2021-06-05 10:20:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4964 to 4964. [2021-06-05 10:20:31,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4964 states, 4962 states have (on average 2.811970979443773) internal successors, (13953), 4963 states have internal predecessors, (13953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4964 states to 4964 states and 13953 transitions. [2021-06-05 10:20:31,201 INFO L78 Accepts]: Start accepts. Automaton has 4964 states and 13953 transitions. Word has length 73 [2021-06-05 10:20:31,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:31,201 INFO L482 AbstractCegarLoop]: Abstraction has 4964 states and 13953 transitions. [2021-06-05 10:20:31,201 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:31,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4964 states and 13953 transitions. [2021-06-05 10:20:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 10:20:31,207 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:31,207 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:31,420 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-06-05 10:20:31,421 INFO L430 AbstractCegarLoop]: === Iteration 8 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:31,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:31,421 INFO L82 PathProgramCache]: Analyzing trace with hash -954265978, now seen corresponding path program 2 times [2021-06-05 10:20:31,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:31,422 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360504686] [2021-06-05 10:20:31,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:20:31,533 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:31,533 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360504686] [2021-06-05 10:20:31,533 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360504686] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:20:31,533 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443446721] [2021-06-05 10:20:31,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-06-05 10:20:31,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 10:20:31,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:20:31,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 10:20:31,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:20:31,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:20:31,775 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:31,778 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:31,779 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:31,779 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2021-06-05 10:20:31,822 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:20:31,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:20:31,824 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:31,829 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:31,831 INFO L550 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. [2021-06-05 10:20:31,832 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2021-06-05 10:20:31,906 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:20:31,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:20:31,908 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:31,910 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:31,912 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:31,912 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2021-06-05 10:20:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:20:31,946 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443446721] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:31,946 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 10:20:31,946 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 19 [2021-06-05 10:20:31,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644049279] [2021-06-05 10:20:31,948 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 10:20:31,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:31,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 10:20:31,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-06-05 10:20:31,949 INFO L87 Difference]: Start difference. First operand 4964 states and 13953 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:32,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:32,749 INFO L93 Difference]: Finished difference Result 11764 states and 32969 transitions. [2021-06-05 10:20:32,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 10:20:32,750 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 10:20:32,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:32,768 INFO L225 Difference]: With dead ends: 11764 [2021-06-05 10:20:32,768 INFO L226 Difference]: Without dead ends: 11572 [2021-06-05 10:20:32,769 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 528.7ms TimeCoverageRelationStatistics Valid=506, Invalid=1846, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 10:20:32,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11572 states. [2021-06-05 10:20:32,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11572 to 7034. [2021-06-05 10:20:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7034 states, 7032 states have (on average 2.8657565415244597) internal successors, (20152), 7033 states have internal predecessors, (20152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7034 states to 7034 states and 20152 transitions. [2021-06-05 10:20:32,907 INFO L78 Accepts]: Start accepts. Automaton has 7034 states and 20152 transitions. Word has length 73 [2021-06-05 10:20:32,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:32,907 INFO L482 AbstractCegarLoop]: Abstraction has 7034 states and 20152 transitions. [2021-06-05 10:20:32,907 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand 7034 states and 20152 transitions. [2021-06-05 10:20:32,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 10:20:32,913 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:32,913 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:33,124 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-06-05 10:20:33,125 INFO L430 AbstractCegarLoop]: === Iteration 9 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:33,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:33,125 INFO L82 PathProgramCache]: Analyzing trace with hash -963366880, now seen corresponding path program 1 times [2021-06-05 10:20:33,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:33,125 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456283639] [2021-06-05 10:20:33,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:33,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:20:33,224 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:33,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456283639] [2021-06-05 10:20:33,224 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456283639] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:20:33,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144157254] [2021-06-05 10:20:33,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:20:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:33,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2021-06-05 10:20:33,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:20:33,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:20:33,430 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:33,434 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:33,435 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:33,435 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:20:33,475 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:20:33,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:20:33,480 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:33,485 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:33,486 INFO L550 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. [2021-06-05 10:20:33,487 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:20:33,521 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:20:33,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:20:33,523 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:33,526 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:33,527 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:33,527 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:20:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:20:33,552 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144157254] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:33,552 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 10:20:33,553 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 20 [2021-06-05 10:20:33,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522653902] [2021-06-05 10:20:33,553 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 10:20:33,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:33,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 10:20:33,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:20:33,554 INFO L87 Difference]: Start difference. First operand 7034 states and 20152 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:34,403 INFO L93 Difference]: Finished difference Result 19976 states and 56662 transitions. [2021-06-05 10:20:34,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 10:20:34,403 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 10:20:34,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:34,435 INFO L225 Difference]: With dead ends: 19976 [2021-06-05 10:20:34,435 INFO L226 Difference]: Without dead ends: 19832 [2021-06-05 10:20:34,436 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 437.5ms TimeCoverageRelationStatistics Valid=334, Invalid=1388, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 10:20:34,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19832 states. [2021-06-05 10:20:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19832 to 7574. [2021-06-05 10:20:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7574 states, 7572 states have (on average 2.864500792393027) internal successors, (21690), 7573 states have internal predecessors, (21690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7574 states to 7574 states and 21690 transitions. [2021-06-05 10:20:34,675 INFO L78 Accepts]: Start accepts. Automaton has 7574 states and 21690 transitions. Word has length 73 [2021-06-05 10:20:34,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:34,675 INFO L482 AbstractCegarLoop]: Abstraction has 7574 states and 21690 transitions. [2021-06-05 10:20:34,675 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 7574 states and 21690 transitions. [2021-06-05 10:20:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 10:20:34,681 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:34,681 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:34,896 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-06-05 10:20:34,899 INFO L430 AbstractCegarLoop]: === Iteration 10 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:34,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:34,899 INFO L82 PathProgramCache]: Analyzing trace with hash 669912992, now seen corresponding path program 3 times [2021-06-05 10:20:34,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:34,899 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295657804] [2021-06-05 10:20:34,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:35,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:20:35,020 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:35,020 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295657804] [2021-06-05 10:20:35,020 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295657804] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:20:35,020 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963842507] [2021-06-05 10:20:35,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-06-05 10:20:35,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 10:20:35,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:20:35,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 10:20:35,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:20:35,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:20:35,185 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:35,188 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:35,189 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:35,189 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2021-06-05 10:20:35,245 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:20:35,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:20:35,247 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:35,251 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:35,254 INFO L550 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. [2021-06-05 10:20:35,254 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2021-06-05 10:20:35,301 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:20:35,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:20:35,303 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:35,306 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:35,308 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:35,308 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2021-06-05 10:20:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:20:35,335 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963842507] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:35,336 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 10:20:35,336 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 19 [2021-06-05 10:20:35,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733166466] [2021-06-05 10:20:35,336 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 10:20:35,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:35,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 10:20:35,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 10:20:35,337 INFO L87 Difference]: Start difference. First operand 7574 states and 21690 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:36,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:36,301 INFO L93 Difference]: Finished difference Result 16634 states and 47140 transitions. [2021-06-05 10:20:36,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 10:20:36,302 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 10:20:36,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:36,326 INFO L225 Difference]: With dead ends: 16634 [2021-06-05 10:20:36,326 INFO L226 Difference]: Without dead ends: 16442 [2021-06-05 10:20:36,327 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 563.7ms TimeCoverageRelationStatistics Valid=417, Invalid=1839, Unknown=0, NotChecked=0, Total=2256 [2021-06-05 10:20:36,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16442 states. [2021-06-05 10:20:36,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16442 to 7639. [2021-06-05 10:20:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7639 states, 7637 states have (on average 2.864475579416001) internal successors, (21876), 7638 states have internal predecessors, (21876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:36,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7639 states to 7639 states and 21876 transitions. [2021-06-05 10:20:36,529 INFO L78 Accepts]: Start accepts. Automaton has 7639 states and 21876 transitions. Word has length 73 [2021-06-05 10:20:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:36,530 INFO L482 AbstractCegarLoop]: Abstraction has 7639 states and 21876 transitions. [2021-06-05 10:20:36,530 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 7639 states and 21876 transitions. [2021-06-05 10:20:36,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 10:20:36,535 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:36,535 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:36,748 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:20:36,749 INFO L430 AbstractCegarLoop]: === Iteration 11 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:36,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:36,749 INFO L82 PathProgramCache]: Analyzing trace with hash 389472848, now seen corresponding path program 4 times [2021-06-05 10:20:36,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:36,749 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267642016] [2021-06-05 10:20:36,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:20:36,868 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:36,869 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267642016] [2021-06-05 10:20:36,869 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267642016] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:20:36,869 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428712602] [2021-06-05 10:20:36,869 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-06-05 10:20:36,980 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 10:20:36,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:20:36,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2021-06-05 10:20:36,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:20:37,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:20:37,094 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:37,096 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:37,097 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:37,097 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:20:37,136 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:20:37,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:20:37,137 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:37,141 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:37,146 INFO L550 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. [2021-06-05 10:20:37,146 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:20:37,180 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:20:37,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:20:37,181 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:37,184 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:37,185 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:37,185 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:20:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:20:37,209 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428712602] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:37,209 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 10:20:37,209 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 20 [2021-06-05 10:20:37,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571567610] [2021-06-05 10:20:37,210 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 10:20:37,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:37,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 10:20:37,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:20:37,210 INFO L87 Difference]: Start difference. First operand 7639 states and 21876 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:38,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:38,041 INFO L93 Difference]: Finished difference Result 18611 states and 52869 transitions. [2021-06-05 10:20:38,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 10:20:38,042 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 10:20:38,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:38,069 INFO L225 Difference]: With dead ends: 18611 [2021-06-05 10:20:38,070 INFO L226 Difference]: Without dead ends: 18485 [2021-06-05 10:20:38,070 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 511.1ms TimeCoverageRelationStatistics Valid=512, Invalid=1938, Unknown=0, NotChecked=0, Total=2450 [2021-06-05 10:20:38,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18485 states. [2021-06-05 10:20:38,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18485 to 7588. [2021-06-05 10:20:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7588 states, 7586 states have (on average 2.86369628262589) internal successors, (21724), 7587 states have internal predecessors, (21724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7588 states to 7588 states and 21724 transitions. [2021-06-05 10:20:38,255 INFO L78 Accepts]: Start accepts. Automaton has 7588 states and 21724 transitions. Word has length 73 [2021-06-05 10:20:38,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:38,256 INFO L482 AbstractCegarLoop]: Abstraction has 7588 states and 21724 transitions. [2021-06-05 10:20:38,256 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 7588 states and 21724 transitions. [2021-06-05 10:20:38,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 10:20:38,264 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:38,264 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:38,481 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 10:20:38,481 INFO L430 AbstractCegarLoop]: === Iteration 12 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:38,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:38,481 INFO L82 PathProgramCache]: Analyzing trace with hash 801683374, now seen corresponding path program 5 times [2021-06-05 10:20:38,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:38,481 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103177200] [2021-06-05 10:20:38,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:38,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:20:38,629 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:38,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103177200] [2021-06-05 10:20:38,629 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103177200] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:20:38,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835298201] [2021-06-05 10:20:38,629 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-06-05 10:20:38,693 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 10:20:38,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:20:38,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 10:20:38,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:20:38,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:20:38,825 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:38,828 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:38,829 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:38,829 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2021-06-05 10:20:38,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:20:38,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:20:38,861 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:38,865 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:38,867 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:38,867 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:17 [2021-06-05 10:20:38,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 34 treesize of output 29 [2021-06-05 10:20:38,926 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:20:38,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-06-05 10:20:38,930 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:38,937 INFO L628 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2021-06-05 10:20:38,937 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:38,941 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:38,942 INFO L550 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. [2021-06-05 10:20:38,943 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2021-06-05 10:20:38,979 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:20:38,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:20:38,981 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:38,983 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:38,984 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:38,984 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:20:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:20:39,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835298201] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:20:39,014 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:20:39,015 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 27 [2021-06-05 10:20:39,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813114875] [2021-06-05 10:20:39,015 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 10:20:39,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:39,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 10:20:39,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2021-06-05 10:20:39,016 INFO L87 Difference]: Start difference. First operand 7588 states and 21724 transitions. Second operand has 27 states, 27 states have (on average 4.62962962962963) internal successors, (125), 27 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:42,498 INFO L93 Difference]: Finished difference Result 23303 states and 66528 transitions. [2021-06-05 10:20:42,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-06-05 10:20:42,498 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.62962962962963) internal successors, (125), 27 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 10:20:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:42,526 INFO L225 Difference]: With dead ends: 23303 [2021-06-05 10:20:42,526 INFO L226 Difference]: Without dead ends: 23165 [2021-06-05 10:20:42,528 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3387 ImplicationChecksByTransitivity, 2381.5ms TimeCoverageRelationStatistics Valid=1892, Invalid=9028, Unknown=0, NotChecked=0, Total=10920 [2021-06-05 10:20:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23165 states. [2021-06-05 10:20:42,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23165 to 7721. [2021-06-05 10:20:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7721 states, 7719 states have (on average 2.8651379712397977) internal successors, (22116), 7720 states have internal predecessors, (22116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7721 states to 7721 states and 22116 transitions. [2021-06-05 10:20:42,737 INFO L78 Accepts]: Start accepts. Automaton has 7721 states and 22116 transitions. Word has length 73 [2021-06-05 10:20:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:42,737 INFO L482 AbstractCegarLoop]: Abstraction has 7721 states and 22116 transitions. [2021-06-05 10:20:42,737 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 4.62962962962963) internal successors, (125), 27 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:42,737 INFO L276 IsEmpty]: Start isEmpty. Operand 7721 states and 22116 transitions. [2021-06-05 10:20:42,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 10:20:42,743 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:42,743 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:42,956 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:20:42,957 INFO L430 AbstractCegarLoop]: === Iteration 13 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:42,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:42,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1564981342, now seen corresponding path program 6 times [2021-06-05 10:20:42,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:42,957 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081089832] [2021-06-05 10:20:42,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:20:43,049 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:43,049 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081089832] [2021-06-05 10:20:43,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081089832] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:43,049 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:20:43,049 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 10:20:43,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760474853] [2021-06-05 10:20:43,049 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 10:20:43,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:43,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 10:20:43,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-06-05 10:20:43,050 INFO L87 Difference]: Start difference. First operand 7721 states and 22116 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:43,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:43,862 INFO L93 Difference]: Finished difference Result 23911 states and 67817 transitions. [2021-06-05 10:20:43,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 10:20:43,863 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 10:20:43,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:43,896 INFO L225 Difference]: With dead ends: 23911 [2021-06-05 10:20:43,896 INFO L226 Difference]: Without dead ends: 23713 [2021-06-05 10:20:43,897 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 319.0ms TimeCoverageRelationStatistics Valid=364, Invalid=1706, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 10:20:43,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23713 states. [2021-06-05 10:20:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23713 to 8021. [2021-06-05 10:20:44,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8021 states, 8019 states have (on average 2.867190422745978) internal successors, (22992), 8020 states have internal predecessors, (22992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8021 states to 8021 states and 22992 transitions. [2021-06-05 10:20:44,159 INFO L78 Accepts]: Start accepts. Automaton has 8021 states and 22992 transitions. Word has length 73 [2021-06-05 10:20:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:44,160 INFO L482 AbstractCegarLoop]: Abstraction has 8021 states and 22992 transitions. [2021-06-05 10:20:44,160 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:44,160 INFO L276 IsEmpty]: Start isEmpty. Operand 8021 states and 22992 transitions. [2021-06-05 10:20:44,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 10:20:44,167 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:44,167 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:44,167 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 10:20:44,167 INFO L430 AbstractCegarLoop]: === Iteration 14 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:44,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:44,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1574082244, now seen corresponding path program 2 times [2021-06-05 10:20:44,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:44,168 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5734413] [2021-06-05 10:20:44,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:20:44,252 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:44,252 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5734413] [2021-06-05 10:20:44,253 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5734413] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:44,253 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:20:44,253 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 10:20:44,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615907594] [2021-06-05 10:20:44,253 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 10:20:44,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:44,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 10:20:44,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-06-05 10:20:44,254 INFO L87 Difference]: Start difference. First operand 8021 states and 22992 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:45,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:45,440 INFO L93 Difference]: Finished difference Result 20899 states and 59035 transitions. [2021-06-05 10:20:45,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-06-05 10:20:45,440 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 10:20:45,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:45,471 INFO L225 Difference]: With dead ends: 20899 [2021-06-05 10:20:45,471 INFO L226 Difference]: Without dead ends: 20701 [2021-06-05 10:20:45,473 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 679.9ms TimeCoverageRelationStatistics Valid=775, Invalid=3515, Unknown=0, NotChecked=0, Total=4290 [2021-06-05 10:20:45,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20701 states. [2021-06-05 10:20:45,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20701 to 8307. [2021-06-05 10:20:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8307 states, 8305 states have (on average 2.866465984346779) internal successors, (23806), 8306 states have internal predecessors, (23806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8307 states to 8307 states and 23806 transitions. [2021-06-05 10:20:45,701 INFO L78 Accepts]: Start accepts. Automaton has 8307 states and 23806 transitions. Word has length 73 [2021-06-05 10:20:45,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:45,701 INFO L482 AbstractCegarLoop]: Abstraction has 8307 states and 23806 transitions. [2021-06-05 10:20:45,702 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:45,702 INFO L276 IsEmpty]: Start isEmpty. Operand 8307 states and 23806 transitions. [2021-06-05 10:20:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 10:20:45,709 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:45,709 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:45,709 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 10:20:45,710 INFO L430 AbstractCegarLoop]: === Iteration 15 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:45,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:45,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1925828864, now seen corresponding path program 7 times [2021-06-05 10:20:45,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:45,710 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496467977] [2021-06-05 10:20:45,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:45,873 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 10:20:45,874 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:45,874 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496467977] [2021-06-05 10:20:45,874 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496467977] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:20:45,874 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375001993] [2021-06-05 10:20:45,874 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-06-05 10:20:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:45,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 17 conjunts are in the unsatisfiable core [2021-06-05 10:20:45,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:20:45,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:20:45,966 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:45,967 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:45,967 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:45,967 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:20:45,983 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:20:45,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:20:45,985 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:45,986 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:45,986 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:45,986 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:20:46,097 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:20:46,097 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:46,100 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:46,101 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:46,101 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:20:46,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:20:46,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:20:46,120 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:46,125 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:46,126 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:46,126 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:17 [2021-06-05 10:20:46,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 34 treesize of output 29 [2021-06-05 10:20:46,149 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:20:46,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-06-05 10:20:46,154 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:46,161 INFO L628 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2021-06-05 10:20:46,161 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:46,165 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:46,166 INFO L550 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. [2021-06-05 10:20:46,166 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2021-06-05 10:20:46,197 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:20:46,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:20:46,199 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:46,201 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:46,201 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:46,202 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:20:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 10:20:46,225 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375001993] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:20:46,225 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:20:46,225 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 24 [2021-06-05 10:20:46,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716173776] [2021-06-05 10:20:46,226 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 10:20:46,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:46,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 10:20:46,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2021-06-05 10:20:46,227 INFO L87 Difference]: Start difference. First operand 8307 states and 23806 transitions. Second operand has 24 states, 24 states have (on average 5.125) internal successors, (123), 24 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:48,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:48,412 INFO L93 Difference]: Finished difference Result 21960 states and 62718 transitions. [2021-06-05 10:20:48,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-06-05 10:20:48,412 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.125) internal successors, (123), 24 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-06-05 10:20:48,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:48,483 INFO L225 Difference]: With dead ends: 21960 [2021-06-05 10:20:48,483 INFO L226 Difference]: Without dead ends: 21912 [2021-06-05 10:20:48,485 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2547 ImplicationChecksByTransitivity, 1385.0ms TimeCoverageRelationStatistics Valid=1448, Invalid=6742, Unknown=0, NotChecked=0, Total=8190 [2021-06-05 10:20:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21912 states. [2021-06-05 10:20:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21912 to 8385. [2021-06-05 10:20:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8385 states, 8383 states have (on average 2.867708457592747) internal successors, (24040), 8384 states have internal predecessors, (24040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8385 states to 8385 states and 24040 transitions. [2021-06-05 10:20:48,685 INFO L78 Accepts]: Start accepts. Automaton has 8385 states and 24040 transitions. Word has length 79 [2021-06-05 10:20:48,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:48,685 INFO L482 AbstractCegarLoop]: Abstraction has 8385 states and 24040 transitions. [2021-06-05 10:20:48,686 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.125) internal successors, (123), 24 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:48,686 INFO L276 IsEmpty]: Start isEmpty. Operand 8385 states and 24040 transitions. [2021-06-05 10:20:48,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 10:20:48,693 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:48,693 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:48,896 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:20:48,898 INFO L430 AbstractCegarLoop]: === Iteration 16 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:48,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:48,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1905831744, now seen corresponding path program 3 times [2021-06-05 10:20:48,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:48,899 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173784449] [2021-06-05 10:20:48,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:49,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 10:20:49,050 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:49,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173784449] [2021-06-05 10:20:49,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173784449] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:20:49,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192639949] [2021-06-05 10:20:49,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-06-05 10:20:49,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 10:20:49,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:20:49,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 10:20:49,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:20:49,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:20:49,139 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:49,140 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:49,141 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:49,141 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:20:49,159 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:20:49,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:20:49,161 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:49,162 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:49,162 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:49,162 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:20:49,284 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:20:49,285 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:49,289 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:49,290 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:49,290 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2021-06-05 10:20:49,323 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:20:49,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:20:49,324 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:49,328 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:49,329 INFO L550 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. [2021-06-05 10:20:49,329 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2021-06-05 10:20:49,374 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:20:49,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:20:49,375 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:49,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:49,382 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:20:49,383 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:26 [2021-06-05 10:20:49,413 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:20:49,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:20:49,415 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:49,417 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:49,418 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:49,418 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2021-06-05 10:20:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 10:20:49,445 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192639949] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:49,445 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 10:20:49,445 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 26 [2021-06-05 10:20:49,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843889204] [2021-06-05 10:20:49,445 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 10:20:49,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:49,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 10:20:49,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2021-06-05 10:20:49,446 INFO L87 Difference]: Start difference. First operand 8385 states and 24040 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:50,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:50,326 INFO L93 Difference]: Finished difference Result 14585 states and 41396 transitions. [2021-06-05 10:20:50,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 10:20:50,327 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-06-05 10:20:50,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:50,346 INFO L225 Difference]: With dead ends: 14585 [2021-06-05 10:20:50,346 INFO L226 Difference]: Without dead ends: 14441 [2021-06-05 10:20:50,347 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 669.5ms TimeCoverageRelationStatistics Valid=539, Invalid=2217, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 10:20:50,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14441 states. [2021-06-05 10:20:50,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14441 to 8511. [2021-06-05 10:20:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8511 states, 8509 states have (on average 2.871077682453872) internal successors, (24430), 8510 states have internal predecessors, (24430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8511 states to 8511 states and 24430 transitions. [2021-06-05 10:20:50,517 INFO L78 Accepts]: Start accepts. Automaton has 8511 states and 24430 transitions. Word has length 79 [2021-06-05 10:20:50,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:50,518 INFO L482 AbstractCegarLoop]: Abstraction has 8511 states and 24430 transitions. [2021-06-05 10:20:50,518 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 8511 states and 24430 transitions. [2021-06-05 10:20:50,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 10:20:50,525 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:50,525 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:50,725 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:20:50,725 INFO L430 AbstractCegarLoop]: === Iteration 17 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:50,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:50,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1116433890, now seen corresponding path program 4 times [2021-06-05 10:20:50,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:50,726 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411769346] [2021-06-05 10:20:50,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:50,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 10:20:50,871 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:50,871 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411769346] [2021-06-05 10:20:50,871 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411769346] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:20:50,871 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512414067] [2021-06-05 10:20:50,871 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-06-05 10:20:50,923 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 10:20:50,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:20:50,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 17 conjunts are in the unsatisfiable core [2021-06-05 10:20:50,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:20:50,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:20:50,949 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:50,950 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:50,950 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:50,950 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:20:50,967 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:20:50,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:20:50,968 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:50,969 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:50,970 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:50,970 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:20:51,101 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:20:51,101 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:51,105 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:51,105 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:51,105 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:20:51,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:20:51,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:20:51,122 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:51,126 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:51,127 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:51,127 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:17 [2021-06-05 10:20:51,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 34 treesize of output 29 [2021-06-05 10:20:51,153 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:20:51,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-06-05 10:20:51,156 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:51,162 INFO L628 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2021-06-05 10:20:51,162 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:51,166 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:51,167 INFO L550 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. [2021-06-05 10:20:51,167 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2021-06-05 10:20:51,205 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:20:51,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:20:51,209 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:51,211 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:51,212 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:51,212 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:20:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 10:20:51,243 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512414067] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:20:51,243 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:20:51,243 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 24 [2021-06-05 10:20:51,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150622800] [2021-06-05 10:20:51,243 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 10:20:51,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:51,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 10:20:51,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2021-06-05 10:20:51,244 INFO L87 Difference]: Start difference. First operand 8511 states and 24430 transitions. Second operand has 24 states, 24 states have (on average 5.125) internal successors, (123), 24 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:53,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:53,604 INFO L93 Difference]: Finished difference Result 29358 states and 84082 transitions. [2021-06-05 10:20:53,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-06-05 10:20:53,604 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.125) internal successors, (123), 24 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-06-05 10:20:53,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:53,643 INFO L225 Difference]: With dead ends: 29358 [2021-06-05 10:20:53,643 INFO L226 Difference]: Without dead ends: 29022 [2021-06-05 10:20:53,645 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2895 ImplicationChecksByTransitivity, 1447.0ms TimeCoverageRelationStatistics Valid=1566, Invalid=7940, Unknown=0, NotChecked=0, Total=9506 [2021-06-05 10:20:53,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29022 states. [2021-06-05 10:20:53,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29022 to 8391. [2021-06-05 10:20:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8391 states, 8389 states have (on average 2.8678030754559543) internal successors, (24058), 8390 states have internal predecessors, (24058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8391 states to 8391 states and 24058 transitions. [2021-06-05 10:20:53,874 INFO L78 Accepts]: Start accepts. Automaton has 8391 states and 24058 transitions. Word has length 79 [2021-06-05 10:20:53,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:53,874 INFO L482 AbstractCegarLoop]: Abstraction has 8391 states and 24058 transitions. [2021-06-05 10:20:53,874 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.125) internal successors, (123), 24 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 8391 states and 24058 transitions. [2021-06-05 10:20:53,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 10:20:53,881 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:53,881 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:54,081 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:20:54,082 INFO L430 AbstractCegarLoop]: === Iteration 18 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:54,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:54,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1460115808, now seen corresponding path program 8 times [2021-06-05 10:20:54,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:54,082 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628711128] [2021-06-05 10:20:54,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:20:54,260 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:54,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628711128] [2021-06-05 10:20:54,260 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628711128] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:20:54,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298788004] [2021-06-05 10:20:54,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-06-05 10:20:54,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 10:20:54,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:20:54,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 17 conjunts are in the unsatisfiable core [2021-06-05 10:20:54,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:20:54,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:20:54,362 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:54,363 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:54,363 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:54,363 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:20:54,379 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:20:54,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:20:54,380 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:54,381 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:54,381 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:54,381 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:20:54,488 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:20:54,489 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:54,493 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:54,493 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:54,493 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:20:54,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:20:54,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:20:54,510 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:54,514 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:54,515 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:54,516 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:17 [2021-06-05 10:20:54,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 34 treesize of output 29 [2021-06-05 10:20:54,553 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:20:54,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-06-05 10:20:54,555 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:54,561 INFO L628 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2021-06-05 10:20:54,561 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:54,565 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:54,566 INFO L550 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. [2021-06-05 10:20:54,566 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2021-06-05 10:20:54,596 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:20:54,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:20:54,597 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:54,600 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:54,601 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:54,601 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:20:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:20:54,628 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298788004] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:54,628 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 10:20:54,628 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 24 [2021-06-05 10:20:54,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129054342] [2021-06-05 10:20:54,628 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 10:20:54,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:54,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 10:20:54,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2021-06-05 10:20:54,629 INFO L87 Difference]: Start difference. First operand 8391 states and 24058 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:55,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:55,533 INFO L93 Difference]: Finished difference Result 19981 states and 57247 transitions. [2021-06-05 10:20:55,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 10:20:55,533 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-06-05 10:20:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:55,560 INFO L225 Difference]: With dead ends: 19981 [2021-06-05 10:20:55,560 INFO L226 Difference]: Without dead ends: 19873 [2021-06-05 10:20:55,560 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 629.3ms TimeCoverageRelationStatistics Valid=419, Invalid=1743, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 10:20:55,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19873 states. [2021-06-05 10:20:55,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19873 to 8615. [2021-06-05 10:20:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8615 states, 8613 states have (on average 2.8679902473005923) internal successors, (24702), 8614 states have internal predecessors, (24702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8615 states to 8615 states and 24702 transitions. [2021-06-05 10:20:55,748 INFO L78 Accepts]: Start accepts. Automaton has 8615 states and 24702 transitions. Word has length 79 [2021-06-05 10:20:55,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:55,748 INFO L482 AbstractCegarLoop]: Abstraction has 8615 states and 24702 transitions. [2021-06-05 10:20:55,748 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 8615 states and 24702 transitions. [2021-06-05 10:20:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 10:20:55,754 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:55,754 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:55,954 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:20:55,955 INFO L430 AbstractCegarLoop]: === Iteration 19 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:55,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:55,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1480112928, now seen corresponding path program 5 times [2021-06-05 10:20:55,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:55,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383095155] [2021-06-05 10:20:55,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:20:56,099 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:56,099 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383095155] [2021-06-05 10:20:56,099 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383095155] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:20:56,099 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395637166] [2021-06-05 10:20:56,099 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-06-05 10:20:56,160 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 10:20:56,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:20:56,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 10:20:56,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:20:56,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:20:56,344 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:56,348 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:56,348 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:56,348 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2021-06-05 10:20:56,378 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:20:56,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:20:56,381 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:56,390 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:56,391 INFO L550 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. [2021-06-05 10:20:56,391 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2021-06-05 10:20:56,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:20:56,435 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:20:56,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:20:56,437 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:56,443 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:56,445 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:20:56,445 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:28 [2021-06-05 10:20:56,483 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:20:56,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:20:56,484 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:56,487 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:56,488 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:56,488 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:20:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:20:56,520 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395637166] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:56,520 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 10:20:56,520 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 28 [2021-06-05 10:20:56,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372606962] [2021-06-05 10:20:56,520 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 10:20:56,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:56,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 10:20:56,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2021-06-05 10:20:56,521 INFO L87 Difference]: Start difference. First operand 8615 states and 24702 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:57,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:57,437 INFO L93 Difference]: Finished difference Result 19835 states and 56825 transitions. [2021-06-05 10:20:57,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 10:20:57,437 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-06-05 10:20:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:57,462 INFO L225 Difference]: With dead ends: 19835 [2021-06-05 10:20:57,462 INFO L226 Difference]: Without dead ends: 19697 [2021-06-05 10:20:57,463 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 729.0ms TimeCoverageRelationStatistics Valid=563, Invalid=2299, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 10:20:57,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19697 states. [2021-06-05 10:20:57,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19697 to 8783. [2021-06-05 10:20:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8783 states, 8781 states have (on average 2.8681243594123678) internal successors, (25185), 8782 states have internal predecessors, (25185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8783 states to 8783 states and 25185 transitions. [2021-06-05 10:20:57,672 INFO L78 Accepts]: Start accepts. Automaton has 8783 states and 25185 transitions. Word has length 79 [2021-06-05 10:20:57,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:57,672 INFO L482 AbstractCegarLoop]: Abstraction has 8783 states and 25185 transitions. [2021-06-05 10:20:57,672 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 8783 states and 25185 transitions. [2021-06-05 10:20:57,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 10:20:57,678 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:57,678 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:20:57,878 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-06-05 10:20:57,878 INFO L430 AbstractCegarLoop]: === Iteration 20 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:20:57,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:20:57,879 INFO L82 PathProgramCache]: Analyzing trace with hash -2076915842, now seen corresponding path program 6 times [2021-06-05 10:20:57,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:20:57,879 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492584835] [2021-06-05 10:20:57,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:20:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:20:58,007 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:20:58,008 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:20:58,008 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492584835] [2021-06-05 10:20:58,008 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492584835] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:20:58,008 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151984892] [2021-06-05 10:20:58,008 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-06-05 10:20:58,079 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 10:20:58,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:20:58,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 17 conjunts are in the unsatisfiable core [2021-06-05 10:20:58,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:20:58,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:20:58,096 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:58,097 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:58,098 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:58,098 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:20:58,113 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:20:58,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:20:58,114 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:58,115 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:58,115 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:58,115 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:20:58,211 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:20:58,212 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:58,215 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:58,216 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:58,216 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:20:58,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:20:58,243 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:58,248 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:58,250 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:58,250 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2021-06-05 10:20:58,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 34 treesize of output 29 [2021-06-05 10:20:58,296 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:20:58,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-06-05 10:20:58,298 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:58,303 INFO L628 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2021-06-05 10:20:58,304 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:58,307 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:58,308 INFO L550 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. [2021-06-05 10:20:58,308 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2021-06-05 10:20:58,342 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:20:58,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:20:58,343 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:20:58,346 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:20:58,346 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:20:58,346 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:20:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:20:58,371 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151984892] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:20:58,371 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 10:20:58,371 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 26 [2021-06-05 10:20:58,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307102983] [2021-06-05 10:20:58,372 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 10:20:58,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:20:58,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 10:20:58,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2021-06-05 10:20:58,372 INFO L87 Difference]: Start difference. First operand 8783 states and 25185 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:59,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:20:59,690 INFO L93 Difference]: Finished difference Result 21683 states and 62243 transitions. [2021-06-05 10:20:59,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-05 10:20:59,690 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-06-05 10:20:59,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:20:59,717 INFO L225 Difference]: With dead ends: 21683 [2021-06-05 10:20:59,717 INFO L226 Difference]: Without dead ends: 21545 [2021-06-05 10:20:59,718 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 943.0ms TimeCoverageRelationStatistics Valid=814, Invalid=3218, Unknown=0, NotChecked=0, Total=4032 [2021-06-05 10:20:59,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21545 states. [2021-06-05 10:20:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21545 to 8665. [2021-06-05 10:20:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8665 states, 8663 states have (on average 2.8689830312824656) internal successors, (24854), 8664 states have internal predecessors, (24854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8665 states to 8665 states and 24854 transitions. [2021-06-05 10:20:59,907 INFO L78 Accepts]: Start accepts. Automaton has 8665 states and 24854 transitions. Word has length 79 [2021-06-05 10:20:59,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:20:59,908 INFO L482 AbstractCegarLoop]: Abstraction has 8665 states and 24854 transitions. [2021-06-05 10:20:59,908 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:20:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 8665 states and 24854 transitions. [2021-06-05 10:20:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 10:20:59,914 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:20:59,915 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:21:00,128 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-06-05 10:21:00,130 INFO L430 AbstractCegarLoop]: === Iteration 21 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:21:00,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:21:00,131 INFO L82 PathProgramCache]: Analyzing trace with hash -221510337, now seen corresponding path program 1 times [2021-06-05 10:21:00,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:21:00,131 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062374815] [2021-06-05 10:21:00,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:21:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:21:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:21:00,207 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:21:00,207 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062374815] [2021-06-05 10:21:00,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062374815] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:00,207 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037703004] [2021-06-05 10:21:00,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:21:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:21:00,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 10:21:00,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:21:00,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:21:00,378 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:00,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:00,381 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:00,381 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:21:00,404 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:21:00,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:21:00,405 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:00,409 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:00,410 INFO L550 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. [2021-06-05 10:21:00,410 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:21:00,437 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:21:00,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:21:00,438 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:00,440 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:00,441 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:00,441 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:21:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:21:00,461 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037703004] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:00,461 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:21:00,461 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2021-06-05 10:21:00,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145794615] [2021-06-05 10:21:00,462 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 10:21:00,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:21:00,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 10:21:00,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-06-05 10:21:00,462 INFO L87 Difference]: Start difference. First operand 8665 states and 24854 transitions. Second operand has 22 states, 22 states have (on average 6.681818181818182) internal successors, (147), 22 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:03,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:21:03,583 INFO L93 Difference]: Finished difference Result 41958 states and 117541 transitions. [2021-06-05 10:21:03,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2021-06-05 10:21:03,583 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.681818181818182) internal successors, (147), 22 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-06-05 10:21:03,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:21:03,638 INFO L225 Difference]: With dead ends: 41958 [2021-06-05 10:21:03,638 INFO L226 Difference]: Without dead ends: 41274 [2021-06-05 10:21:03,640 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10115 ImplicationChecksByTransitivity, 1918.9ms TimeCoverageRelationStatistics Valid=3045, Invalid=22395, Unknown=0, NotChecked=0, Total=25440 [2021-06-05 10:21:03,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41274 states. [2021-06-05 10:21:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41274 to 12177. [2021-06-05 10:21:03,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12175 states have (on average 2.864640657084189) internal successors, (34877), 12176 states have internal predecessors, (34877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 34877 transitions. [2021-06-05 10:21:03,986 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 34877 transitions. Word has length 83 [2021-06-05 10:21:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:21:03,986 INFO L482 AbstractCegarLoop]: Abstraction has 12177 states and 34877 transitions. [2021-06-05 10:21:03,986 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 6.681818181818182) internal successors, (147), 22 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 34877 transitions. [2021-06-05 10:21:03,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 10:21:03,995 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:21:03,995 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:21:04,195 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-06-05 10:21:04,195 INFO L430 AbstractCegarLoop]: === Iteration 22 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:21:04,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:21:04,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1382043265, now seen corresponding path program 2 times [2021-06-05 10:21:04,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:21:04,196 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503328133] [2021-06-05 10:21:04,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:21:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:21:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:21:04,268 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:21:04,268 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503328133] [2021-06-05 10:21:04,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503328133] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:04,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070425855] [2021-06-05 10:21:04,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-06-05 10:21:04,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 10:21:04,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:21:04,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 10:21:04,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:21:04,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:21:04,405 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:04,407 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:04,408 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:04,408 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2021-06-05 10:21:04,441 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:21:04,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:21:04,443 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:04,446 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:04,447 INFO L550 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. [2021-06-05 10:21:04,447 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2021-06-05 10:21:04,472 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:21:04,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:21:04,473 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:04,475 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:04,476 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:04,476 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2021-06-05 10:21:04,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:21:04,498 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070425855] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:04,498 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:21:04,498 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2021-06-05 10:21:04,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654906466] [2021-06-05 10:21:04,498 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 10:21:04,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:21:04,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 10:21:04,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:21:04,499 INFO L87 Difference]: Start difference. First operand 12177 states and 34877 transitions. Second operand has 20 states, 20 states have (on average 7.15) internal successors, (143), 20 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:07,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:21:07,344 INFO L93 Difference]: Finished difference Result 42002 states and 118378 transitions. [2021-06-05 10:21:07,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2021-06-05 10:21:07,345 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.15) internal successors, (143), 20 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-06-05 10:21:07,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:21:07,402 INFO L225 Difference]: With dead ends: 42002 [2021-06-05 10:21:07,402 INFO L226 Difference]: Without dead ends: 41744 [2021-06-05 10:21:07,403 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5715 ImplicationChecksByTransitivity, 1606.1ms TimeCoverageRelationStatistics Valid=2173, Invalid=13577, Unknown=0, NotChecked=0, Total=15750 [2021-06-05 10:21:07,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41744 states. [2021-06-05 10:21:07,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41744 to 14539. [2021-06-05 10:21:07,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14539 states, 14537 states have (on average 2.861181811928183) internal successors, (41593), 14538 states have internal predecessors, (41593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14539 states to 14539 states and 41593 transitions. [2021-06-05 10:21:07,791 INFO L78 Accepts]: Start accepts. Automaton has 14539 states and 41593 transitions. Word has length 83 [2021-06-05 10:21:07,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:21:07,791 INFO L482 AbstractCegarLoop]: Abstraction has 14539 states and 41593 transitions. [2021-06-05 10:21:07,791 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 7.15) internal successors, (143), 20 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:07,791 INFO L276 IsEmpty]: Start isEmpty. Operand 14539 states and 41593 transitions. [2021-06-05 10:21:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 10:21:07,799 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:21:07,800 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:21:08,000 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:21:08,000 INFO L430 AbstractCegarLoop]: === Iteration 23 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:21:08,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:21:08,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1185727271, now seen corresponding path program 1 times [2021-06-05 10:21:08,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:21:08,001 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612280539] [2021-06-05 10:21:08,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:21:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:21:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:21:08,073 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:21:08,074 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612280539] [2021-06-05 10:21:08,074 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612280539] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:08,074 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122464372] [2021-06-05 10:21:08,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2021-06-05 10:21:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:21:08,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 10:21:08,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:21:08,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:21:08,245 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:08,249 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:08,249 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:08,249 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:21:08,282 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:21:08,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:21:08,283 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:08,287 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:08,289 INFO L550 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. [2021-06-05 10:21:08,289 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:21:08,319 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:21:08,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:21:08,321 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:08,323 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:08,324 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:08,324 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:21:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:21:08,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122464372] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:08,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:21:08,346 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2021-06-05 10:21:08,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879026603] [2021-06-05 10:21:08,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 10:21:08,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:21:08,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 10:21:08,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2021-06-05 10:21:08,347 INFO L87 Difference]: Start difference. First operand 14539 states and 41593 transitions. Second operand has 21 states, 21 states have (on average 6.904761904761905) internal successors, (145), 21 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:11,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:21:11,457 INFO L93 Difference]: Finished difference Result 67492 states and 190490 transitions. [2021-06-05 10:21:11,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2021-06-05 10:21:11,458 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.904761904761905) internal successors, (145), 21 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-06-05 10:21:11,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:21:11,552 INFO L225 Difference]: With dead ends: 67492 [2021-06-05 10:21:11,552 INFO L226 Difference]: Without dead ends: 67300 [2021-06-05 10:21:11,553 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14206 ImplicationChecksByTransitivity, 2026.0ms TimeCoverageRelationStatistics Valid=4012, Invalid=29294, Unknown=0, NotChecked=0, Total=33306 [2021-06-05 10:21:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67300 states. [2021-06-05 10:21:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67300 to 14678. [2021-06-05 10:21:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14678 states, 14676 states have (on average 2.8607931316435) internal successors, (41985), 14677 states have internal predecessors, (41985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14678 states to 14678 states and 41985 transitions. [2021-06-05 10:21:12,089 INFO L78 Accepts]: Start accepts. Automaton has 14678 states and 41985 transitions. Word has length 83 [2021-06-05 10:21:12,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:21:12,089 INFO L482 AbstractCegarLoop]: Abstraction has 14678 states and 41985 transitions. [2021-06-05 10:21:12,089 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 6.904761904761905) internal successors, (145), 21 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 14678 states and 41985 transitions. [2021-06-05 10:21:12,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 10:21:12,097 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:21:12,097 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:21:12,305 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-06-05 10:21:12,305 INFO L430 AbstractCegarLoop]: === Iteration 24 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:21:12,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:21:12,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1759472375, now seen corresponding path program 2 times [2021-06-05 10:21:12,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:21:12,306 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080034853] [2021-06-05 10:21:12,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:21:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:21:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:21:12,452 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:21:12,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080034853] [2021-06-05 10:21:12,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080034853] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:12,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801441005] [2021-06-05 10:21:12,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-06-05 10:21:12,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 10:21:12,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:21:12,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 10:21:12,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:21:12,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:21:12,530 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:12,531 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:12,531 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:12,531 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:21:12,545 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:21:12,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:21:12,546 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:12,547 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:12,547 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:12,547 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:21:12,627 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:21:12,629 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:12,633 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:12,634 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:12,635 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2021-06-05 10:21:12,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:21:12,662 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:12,667 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:12,668 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:12,669 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2021-06-05 10:21:12,727 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:21:12,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:21:12,728 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:12,732 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:12,733 INFO L550 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. [2021-06-05 10:21:12,733 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2021-06-05 10:21:12,764 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:21:12,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:21:12,765 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:12,767 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:12,768 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:12,768 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2021-06-05 10:21:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 10:21:12,794 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801441005] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:12,794 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:21:12,794 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 27 [2021-06-05 10:21:12,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920966651] [2021-06-05 10:21:12,794 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 10:21:12,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:21:12,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 10:21:12,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2021-06-05 10:21:12,795 INFO L87 Difference]: Start difference. First operand 14678 states and 41985 transitions. Second operand has 27 states, 27 states have (on average 5.333333333333333) internal successors, (144), 27 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:21:15,911 INFO L93 Difference]: Finished difference Result 33433 states and 94662 transitions. [2021-06-05 10:21:15,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2021-06-05 10:21:15,911 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.333333333333333) internal successors, (144), 27 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-06-05 10:21:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:21:15,956 INFO L225 Difference]: With dead ends: 33433 [2021-06-05 10:21:15,956 INFO L226 Difference]: Without dead ends: 33157 [2021-06-05 10:21:15,957 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4804 ImplicationChecksByTransitivity, 2064.9ms TimeCoverageRelationStatistics Valid=2313, Invalid=11967, Unknown=0, NotChecked=0, Total=14280 [2021-06-05 10:21:16,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33157 states. [2021-06-05 10:21:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33157 to 14691. [2021-06-05 10:21:16,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14691 states, 14689 states have (on average 2.8615290353325618) internal successors, (42033), 14690 states have internal predecessors, (42033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14691 states to 14691 states and 42033 transitions. [2021-06-05 10:21:16,285 INFO L78 Accepts]: Start accepts. Automaton has 14691 states and 42033 transitions. Word has length 83 [2021-06-05 10:21:16,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:21:16,286 INFO L482 AbstractCegarLoop]: Abstraction has 14691 states and 42033 transitions. [2021-06-05 10:21:16,286 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 5.333333333333333) internal successors, (144), 27 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 14691 states and 42033 transitions. [2021-06-05 10:21:16,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 10:21:16,294 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:21:16,294 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:21:16,508 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-06-05 10:21:16,509 INFO L430 AbstractCegarLoop]: === Iteration 25 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:21:16,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:21:16,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2035173909, now seen corresponding path program 1 times [2021-06-05 10:21:16,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:21:16,510 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130345527] [2021-06-05 10:21:16,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:21:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:21:16,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:21:16,619 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:21:16,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130345527] [2021-06-05 10:21:16,619 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130345527] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:16,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787154162] [2021-06-05 10:21:16,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:21:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:21:16,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 10:21:16,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:21:16,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:21:16,787 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:16,789 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:16,790 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:16,790 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:21:16,823 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:21:16,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:21:16,825 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:16,828 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:16,829 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:16,829 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2021-06-05 10:21:16,852 INFO L354 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2021-06-05 10:21:16,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2021-06-05 10:21:16,853 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:16,857 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:16,858 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:16,858 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:28 [2021-06-05 10:21:16,945 INFO L354 Elim1Store]: treesize reduction 76, result has 31.5 percent of original size [2021-06-05 10:21:16,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2021-06-05 10:21:16,946 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:16,954 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:16,980 INFO L550 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. [2021-06-05 10:21:16,980 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:52 [2021-06-05 10:21:17,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:21:17,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:21:17,080 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:17,083 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-06-05 10:21:17,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 13 [2021-06-05 10:21:17,085 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:17,091 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:17,092 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:17,092 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:95, output treesize:3 [2021-06-05 10:21:17,113 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:21:17,114 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787154162] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:17,114 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:21:17,114 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2021-06-05 10:21:17,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632019086] [2021-06-05 10:21:17,114 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 10:21:17,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:21:17,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 10:21:17,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2021-06-05 10:21:17,115 INFO L87 Difference]: Start difference. First operand 14691 states and 42033 transitions. Second operand has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 24 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:20,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:21:20,907 INFO L93 Difference]: Finished difference Result 72494 states and 204814 transitions. [2021-06-05 10:21:20,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2021-06-05 10:21:20,909 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 24 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-06-05 10:21:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:21:21,010 INFO L225 Difference]: With dead ends: 72494 [2021-06-05 10:21:21,010 INFO L226 Difference]: Without dead ends: 72044 [2021-06-05 10:21:21,012 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10362 ImplicationChecksByTransitivity, 2357.5ms TimeCoverageRelationStatistics Valid=2984, Invalid=24076, Unknown=0, NotChecked=0, Total=27060 [2021-06-05 10:21:21,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72044 states. [2021-06-05 10:21:21,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72044 to 17181. [2021-06-05 10:21:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17181 states, 17179 states have (on average 2.8681529774724956) internal successors, (49272), 17180 states have internal predecessors, (49272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:21,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17181 states to 17181 states and 49272 transitions. [2021-06-05 10:21:21,624 INFO L78 Accepts]: Start accepts. Automaton has 17181 states and 49272 transitions. Word has length 83 [2021-06-05 10:21:21,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:21:21,625 INFO L482 AbstractCegarLoop]: Abstraction has 17181 states and 49272 transitions. [2021-06-05 10:21:21,625 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 24 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 17181 states and 49272 transitions. [2021-06-05 10:21:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 10:21:21,634 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:21:21,634 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:21:21,835 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-06-05 10:21:21,835 INFO L430 AbstractCegarLoop]: === Iteration 26 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:21:21,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:21:21,836 INFO L82 PathProgramCache]: Analyzing trace with hash 452351353, now seen corresponding path program 2 times [2021-06-05 10:21:21,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:21:21,836 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642221695] [2021-06-05 10:21:21,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:21:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:21:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:21:21,929 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:21:21,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642221695] [2021-06-05 10:21:21,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642221695] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:21,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318338840] [2021-06-05 10:21:21,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-06-05 10:21:22,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 10:21:22,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:21:22,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 10:21:22,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:21:22,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:21:22,080 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:22,083 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:22,083 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:22,083 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2021-06-05 10:21:22,119 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:21:22,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:21:22,121 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:22,124 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:22,125 INFO L550 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. [2021-06-05 10:21:22,125 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2021-06-05 10:21:22,153 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:21:22,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:21:22,154 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:22,156 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:22,157 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:22,157 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2021-06-05 10:21:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:21:22,181 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318338840] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:22,181 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:21:22,181 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2021-06-05 10:21:22,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661466453] [2021-06-05 10:21:22,181 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 10:21:22,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:21:22,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 10:21:22,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:21:22,182 INFO L87 Difference]: Start difference. First operand 17181 states and 49272 transitions. Second operand has 20 states, 20 states have (on average 6.95) internal successors, (139), 20 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:25,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:21:25,086 INFO L93 Difference]: Finished difference Result 54100 states and 153029 transitions. [2021-06-05 10:21:25,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2021-06-05 10:21:25,086 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.95) internal successors, (139), 20 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-06-05 10:21:25,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:21:25,169 INFO L225 Difference]: With dead ends: 54100 [2021-06-05 10:21:25,169 INFO L226 Difference]: Without dead ends: 53842 [2021-06-05 10:21:25,170 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5727 ImplicationChecksByTransitivity, 1608.6ms TimeCoverageRelationStatistics Valid=2249, Invalid=13501, Unknown=0, NotChecked=0, Total=15750 [2021-06-05 10:21:25,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53842 states. [2021-06-05 10:21:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53842 to 17031. [2021-06-05 10:21:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17031 states, 17029 states have (on average 2.8619413940924305) internal successors, (48736), 17030 states have internal predecessors, (48736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17031 states to 17031 states and 48736 transitions. [2021-06-05 10:21:25,642 INFO L78 Accepts]: Start accepts. Automaton has 17031 states and 48736 transitions. Word has length 83 [2021-06-05 10:21:25,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:21:25,642 INFO L482 AbstractCegarLoop]: Abstraction has 17031 states and 48736 transitions. [2021-06-05 10:21:25,643 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 6.95) internal successors, (139), 20 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:25,643 INFO L276 IsEmpty]: Start isEmpty. Operand 17031 states and 48736 transitions. [2021-06-05 10:21:25,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 10:21:25,651 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:21:25,651 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:21:25,851 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-06-05 10:21:25,852 INFO L430 AbstractCegarLoop]: === Iteration 27 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:21:25,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:21:25,852 INFO L82 PathProgramCache]: Analyzing trace with hash -177499195, now seen corresponding path program 1 times [2021-06-05 10:21:25,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:21:25,852 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628218654] [2021-06-05 10:21:25,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:21:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:21:25,929 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:21:25,929 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:21:25,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628218654] [2021-06-05 10:21:25,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628218654] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:25,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126788617] [2021-06-05 10:21:25,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:21:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:21:25,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 10:21:25,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:21:26,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:21:26,130 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:26,133 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:26,134 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:26,134 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:21:26,160 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:21:26,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:21:26,162 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:26,165 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:26,166 INFO L550 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. [2021-06-05 10:21:26,166 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:21:26,194 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:21:26,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:21:26,197 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:26,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:26,201 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:26,201 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:21:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:21:26,228 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126788617] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:26,228 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:21:26,228 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2021-06-05 10:21:26,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519849549] [2021-06-05 10:21:26,228 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 10:21:26,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:21:26,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 10:21:26,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-06-05 10:21:26,229 INFO L87 Difference]: Start difference. First operand 17031 states and 48736 transitions. Second operand has 22 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:29,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:21:29,309 INFO L93 Difference]: Finished difference Result 73595 states and 207624 transitions. [2021-06-05 10:21:29,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2021-06-05 10:21:29,310 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-06-05 10:21:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:21:29,418 INFO L225 Difference]: With dead ends: 73595 [2021-06-05 10:21:29,418 INFO L226 Difference]: Without dead ends: 73223 [2021-06-05 10:21:29,420 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 175 SyntacticMatches, 3 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9569 ImplicationChecksByTransitivity, 1969.9ms TimeCoverageRelationStatistics Valid=3049, Invalid=20513, Unknown=0, NotChecked=0, Total=23562 [2021-06-05 10:21:29,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73223 states. [2021-06-05 10:21:30,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73223 to 21993. [2021-06-05 10:21:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21993 states, 21991 states have (on average 2.8726751853030787) internal successors, (63173), 21992 states have internal predecessors, (63173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21993 states to 21993 states and 63173 transitions. [2021-06-05 10:21:30,086 INFO L78 Accepts]: Start accepts. Automaton has 21993 states and 63173 transitions. Word has length 83 [2021-06-05 10:21:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:21:30,086 INFO L482 AbstractCegarLoop]: Abstraction has 21993 states and 63173 transitions. [2021-06-05 10:21:30,086 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 21993 states and 63173 transitions. [2021-06-05 10:21:30,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 10:21:30,096 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:21:30,096 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:21:30,304 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:21:30,305 INFO L430 AbstractCegarLoop]: === Iteration 28 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:21:30,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:21:30,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1501086163, now seen corresponding path program 2 times [2021-06-05 10:21:30,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:21:30,305 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962488771] [2021-06-05 10:21:30,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:21:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:21:30,379 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:21:30,380 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:21:30,380 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962488771] [2021-06-05 10:21:30,380 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962488771] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:30,380 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664915564] [2021-06-05 10:21:30,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-06-05 10:21:30,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 10:21:30,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:21:30,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 10:21:30,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:21:30,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:21:30,541 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:30,544 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:30,544 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:30,544 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:21:30,568 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:21:30,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:21:30,569 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:30,573 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:30,574 INFO L550 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. [2021-06-05 10:21:30,574 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:21:30,611 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:21:30,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:21:30,612 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:30,614 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:30,615 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:30,615 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:21:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:21:30,637 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664915564] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:30,637 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:21:30,638 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2021-06-05 10:21:30,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072709732] [2021-06-05 10:21:30,638 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 10:21:30,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:21:30,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 10:21:30,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2021-06-05 10:21:30,638 INFO L87 Difference]: Start difference. First operand 21993 states and 63173 transitions. Second operand has 21 states, 21 states have (on average 6.619047619047619) internal successors, (139), 21 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:21:33,655 INFO L93 Difference]: Finished difference Result 101509 states and 287299 transitions. [2021-06-05 10:21:33,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2021-06-05 10:21:33,655 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.619047619047619) internal successors, (139), 21 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-06-05 10:21:33,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:21:33,818 INFO L225 Difference]: With dead ends: 101509 [2021-06-05 10:21:33,818 INFO L226 Difference]: Without dead ends: 101137 [2021-06-05 10:21:33,821 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12714 ImplicationChecksByTransitivity, 1840.1ms TimeCoverageRelationStatistics Valid=3675, Invalid=26081, Unknown=0, NotChecked=0, Total=29756 [2021-06-05 10:21:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101137 states. [2021-06-05 10:21:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101137 to 24911. [2021-06-05 10:21:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24911 states, 24909 states have (on average 2.874141876430206) internal successors, (71592), 24910 states have internal predecessors, (71592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:34,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24911 states to 24911 states and 71592 transitions. [2021-06-05 10:21:34,730 INFO L78 Accepts]: Start accepts. Automaton has 24911 states and 71592 transitions. Word has length 83 [2021-06-05 10:21:34,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:21:34,730 INFO L482 AbstractCegarLoop]: Abstraction has 24911 states and 71592 transitions. [2021-06-05 10:21:34,730 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 6.619047619047619) internal successors, (139), 21 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 24911 states and 71592 transitions. [2021-06-05 10:21:34,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 10:21:34,740 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:21:34,741 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:21:34,949 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-06-05 10:21:34,950 INFO L430 AbstractCegarLoop]: === Iteration 29 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:21:34,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:21:34,950 INFO L82 PathProgramCache]: Analyzing trace with hash 387445651, now seen corresponding path program 3 times [2021-06-05 10:21:34,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:21:34,950 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081586011] [2021-06-05 10:21:34,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:21:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:21:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:21:35,035 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:21:35,035 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081586011] [2021-06-05 10:21:35,035 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081586011] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:35,035 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308951725] [2021-06-05 10:21:35,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2021-06-05 10:21:35,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 10:21:35,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:21:35,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 10:21:35,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:21:35,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:21:35,187 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:35,190 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:35,191 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:35,191 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2021-06-05 10:21:35,218 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:21:35,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:21:35,220 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:35,224 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:35,225 INFO L550 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. [2021-06-05 10:21:35,225 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2021-06-05 10:21:35,254 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:21:35,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:21:35,256 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:35,258 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:35,259 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:35,259 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2021-06-05 10:21:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:21:35,286 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308951725] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:35,286 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:21:35,286 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2021-06-05 10:21:35,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725125222] [2021-06-05 10:21:35,286 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 10:21:35,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:21:35,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 10:21:35,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:21:35,287 INFO L87 Difference]: Start difference. First operand 24911 states and 71592 transitions. Second operand has 20 states, 20 states have (on average 6.95) internal successors, (139), 20 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:21:38,071 INFO L93 Difference]: Finished difference Result 65138 states and 184437 transitions. [2021-06-05 10:21:38,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2021-06-05 10:21:38,072 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.95) internal successors, (139), 20 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-06-05 10:21:38,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:21:38,170 INFO L225 Difference]: With dead ends: 65138 [2021-06-05 10:21:38,170 INFO L226 Difference]: Without dead ends: 64808 [2021-06-05 10:21:38,171 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4744 ImplicationChecksByTransitivity, 1184.7ms TimeCoverageRelationStatistics Valid=1648, Invalid=11692, Unknown=0, NotChecked=0, Total=13340 [2021-06-05 10:21:38,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64808 states. [2021-06-05 10:21:38,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64808 to 25193. [2021-06-05 10:21:38,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25193 states, 25191 states have (on average 2.871263546504704) internal successors, (72330), 25192 states have internal predecessors, (72330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:38,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25193 states to 25193 states and 72330 transitions. [2021-06-05 10:21:38,840 INFO L78 Accepts]: Start accepts. Automaton has 25193 states and 72330 transitions. Word has length 83 [2021-06-05 10:21:38,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:21:38,841 INFO L482 AbstractCegarLoop]: Abstraction has 25193 states and 72330 transitions. [2021-06-05 10:21:38,841 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 6.95) internal successors, (139), 20 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:38,841 INFO L276 IsEmpty]: Start isEmpty. Operand 25193 states and 72330 transitions. [2021-06-05 10:21:38,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-05 10:21:38,855 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:21:38,855 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:21:39,057 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-06-05 10:21:39,058 INFO L430 AbstractCegarLoop]: === Iteration 30 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:21:39,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:21:39,058 INFO L82 PathProgramCache]: Analyzing trace with hash -657395962, now seen corresponding path program 4 times [2021-06-05 10:21:39,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:21:39,058 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565341755] [2021-06-05 10:21:39,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:21:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:21:39,225 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:21:39,225 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:21:39,226 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565341755] [2021-06-05 10:21:39,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565341755] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:39,226 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926295871] [2021-06-05 10:21:39,226 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:21:39,288 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 10:21:39,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:21:39,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 10:21:39,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:21:39,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:21:39,307 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:39,308 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:39,308 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:39,308 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:21:39,323 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:21:39,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:21:39,324 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:39,325 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:39,326 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:39,326 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:21:39,381 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:21:39,382 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:39,384 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:39,385 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:39,385 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2021-06-05 10:21:39,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:21:39,413 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:39,416 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:39,417 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:39,417 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2021-06-05 10:21:39,436 INFO L354 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2021-06-05 10:21:39,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 38 [2021-06-05 10:21:39,437 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:39,442 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:39,442 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:39,442 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:31 [2021-06-05 10:21:39,484 INFO L354 Elim1Store]: treesize reduction 40, result has 37.5 percent of original size [2021-06-05 10:21:39,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 41 [2021-06-05 10:21:39,486 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:39,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 27 treesize of output 15 [2021-06-05 10:21:39,491 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:39,495 INFO L628 ElimStorePlain]: treesize reduction 32, result has 25.6 percent of original size [2021-06-05 10:21:39,495 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:39,495 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:11 [2021-06-05 10:21:39,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2021-06-05 10:21:39,507 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:39,508 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:39,509 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:39,509 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2021-06-05 10:21:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 10:21:39,537 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926295871] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:21:39,537 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 10:21:39,537 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 22 [2021-06-05 10:21:39,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931236430] [2021-06-05 10:21:39,538 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 10:21:39,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:21:39,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 10:21:39,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2021-06-05 10:21:39,538 INFO L87 Difference]: Start difference. First operand 25193 states and 72330 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:21:40,115 INFO L93 Difference]: Finished difference Result 44975 states and 128673 transitions. [2021-06-05 10:21:40,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 10:21:40,116 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-06-05 10:21:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:21:40,262 INFO L225 Difference]: With dead ends: 44975 [2021-06-05 10:21:40,262 INFO L226 Difference]: Without dead ends: 44747 [2021-06-05 10:21:40,262 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 389.0ms TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 10:21:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44747 states. [2021-06-05 10:21:40,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44747 to 24253. [2021-06-05 10:21:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24253 states, 24251 states have (on average 2.8698198012453093) internal successors, (69596), 24252 states have internal predecessors, (69596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24253 states to 24253 states and 69596 transitions. [2021-06-05 10:21:40,797 INFO L78 Accepts]: Start accepts. Automaton has 24253 states and 69596 transitions. Word has length 87 [2021-06-05 10:21:40,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:21:40,797 INFO L482 AbstractCegarLoop]: Abstraction has 24253 states and 69596 transitions. [2021-06-05 10:21:40,797 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 24253 states and 69596 transitions. [2021-06-05 10:21:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 10:21:40,812 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:21:40,812 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:21:41,012 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:21:41,012 INFO L430 AbstractCegarLoop]: === Iteration 31 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:21:41,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:21:41,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1302759113, now seen corresponding path program 3 times [2021-06-05 10:21:41,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:21:41,013 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937964974] [2021-06-05 10:21:41,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:21:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:21:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 10:21:41,148 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:21:41,148 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937964974] [2021-06-05 10:21:41,148 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937964974] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:41,148 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430767429] [2021-06-05 10:21:41,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:21:41,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 10:21:41,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:21:41,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 10:21:41,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:21:41,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:21:41,221 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:41,222 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:41,222 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:41,223 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:21:41,235 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:21:41,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:21:41,237 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:41,237 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:41,238 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:41,238 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:21:41,440 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:21:41,441 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:41,445 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:41,446 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:41,446 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2021-06-05 10:21:41,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:21:41,474 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:41,479 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:41,480 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:41,480 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2021-06-05 10:21:41,511 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:21:41,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:21:41,512 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:41,516 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:41,517 INFO L550 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. [2021-06-05 10:21:41,517 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2021-06-05 10:21:41,551 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:21:41,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:21:41,553 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:41,555 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:41,556 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:41,556 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2021-06-05 10:21:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-06-05 10:21:41,589 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430767429] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:41,589 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:21:41,589 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 27 [2021-06-05 10:21:41,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001713252] [2021-06-05 10:21:41,590 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 10:21:41,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:21:41,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 10:21:41,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2021-06-05 10:21:41,590 INFO L87 Difference]: Start difference. First operand 24253 states and 69596 transitions. Second operand has 27 states, 27 states have (on average 5.407407407407407) internal successors, (146), 27 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:44,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:21:44,483 INFO L93 Difference]: Finished difference Result 52085 states and 148381 transitions. [2021-06-05 10:21:44,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-05 10:21:44,484 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.407407407407407) internal successors, (146), 27 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 10:21:44,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:21:44,560 INFO L225 Difference]: With dead ends: 52085 [2021-06-05 10:21:44,561 INFO L226 Difference]: Without dead ends: 52049 [2021-06-05 10:21:44,561 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3370 ImplicationChecksByTransitivity, 1851.9ms TimeCoverageRelationStatistics Valid=1821, Invalid=9099, Unknown=0, NotChecked=0, Total=10920 [2021-06-05 10:21:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52049 states. [2021-06-05 10:21:45,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52049 to 24095. [2021-06-05 10:21:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24095 states, 24093 states have (on average 2.8726186029137093) internal successors, (69210), 24094 states have internal predecessors, (69210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:45,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24095 states to 24095 states and 69210 transitions. [2021-06-05 10:21:45,104 INFO L78 Accepts]: Start accepts. Automaton has 24095 states and 69210 transitions. Word has length 89 [2021-06-05 10:21:45,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:21:45,104 INFO L482 AbstractCegarLoop]: Abstraction has 24095 states and 69210 transitions. [2021-06-05 10:21:45,104 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 5.407407407407407) internal successors, (146), 27 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 24095 states and 69210 transitions. [2021-06-05 10:21:45,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 10:21:45,119 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:21:45,119 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:21:45,319 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-06-05 10:21:45,319 INFO L430 AbstractCegarLoop]: === Iteration 32 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:21:45,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:21:45,320 INFO L82 PathProgramCache]: Analyzing trace with hash 2112154087, now seen corresponding path program 3 times [2021-06-05 10:21:45,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:21:45,320 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579352341] [2021-06-05 10:21:45,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:21:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:21:45,459 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 10:21:45,459 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:21:45,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579352341] [2021-06-05 10:21:45,459 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579352341] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:45,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696169200] [2021-06-05 10:21:45,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:21:45,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 10:21:45,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:21:45,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 10:21:45,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:21:45,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:21:45,537 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:45,538 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:45,538 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:45,538 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:21:45,553 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:21:45,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:21:45,555 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:45,555 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:45,556 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:45,556 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:21:45,647 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:21:45,648 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:45,651 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:45,652 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:45,652 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2021-06-05 10:21:45,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:21:45,676 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:45,681 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:45,682 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:45,682 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2021-06-05 10:21:45,723 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:21:45,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:21:45,724 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:45,727 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:45,728 INFO L550 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. [2021-06-05 10:21:45,728 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2021-06-05 10:21:45,761 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:21:45,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:21:45,762 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:45,765 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:45,765 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:45,766 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2021-06-05 10:21:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 10:21:45,799 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696169200] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:45,799 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:21:45,799 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 27 [2021-06-05 10:21:45,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060076766] [2021-06-05 10:21:45,799 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 10:21:45,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:21:45,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 10:21:45,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2021-06-05 10:21:45,800 INFO L87 Difference]: Start difference. First operand 24095 states and 69210 transitions. Second operand has 27 states, 27 states have (on average 5.407407407407407) internal successors, (146), 27 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:49,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:21:49,646 INFO L93 Difference]: Finished difference Result 57365 states and 162880 transitions. [2021-06-05 10:21:49,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2021-06-05 10:21:49,647 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.407407407407407) internal successors, (146), 27 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 10:21:49,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:21:49,733 INFO L225 Difference]: With dead ends: 57365 [2021-06-05 10:21:49,733 INFO L226 Difference]: Without dead ends: 57245 [2021-06-05 10:21:49,734 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4673 ImplicationChecksByTransitivity, 2421.9ms TimeCoverageRelationStatistics Valid=2365, Invalid=12641, Unknown=0, NotChecked=0, Total=15006 [2021-06-05 10:21:49,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57245 states. [2021-06-05 10:21:50,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57245 to 24145. [2021-06-05 10:21:50,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24145 states, 24143 states have (on average 2.876320258460009) internal successors, (69443), 24144 states have internal predecessors, (69443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24145 states to 24145 states and 69443 transitions. [2021-06-05 10:21:50,379 INFO L78 Accepts]: Start accepts. Automaton has 24145 states and 69443 transitions. Word has length 89 [2021-06-05 10:21:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:21:50,379 INFO L482 AbstractCegarLoop]: Abstraction has 24145 states and 69443 transitions. [2021-06-05 10:21:50,379 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 5.407407407407407) internal successors, (146), 27 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 24145 states and 69443 transitions. [2021-06-05 10:21:50,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 10:21:50,395 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:21:50,395 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:21:50,596 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:21:50,596 INFO L430 AbstractCegarLoop]: === Iteration 33 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:21:50,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:21:50,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1535963553, now seen corresponding path program 4 times [2021-06-05 10:21:50,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:21:50,596 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279997878] [2021-06-05 10:21:50,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:21:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:21:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 10:21:50,744 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:21:50,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279997878] [2021-06-05 10:21:50,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279997878] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:50,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916267269] [2021-06-05 10:21:50,744 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:21:50,803 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 10:21:50,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:21:50,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 10:21:50,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:21:50,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:21:50,827 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:50,828 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:50,828 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:50,828 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:21:50,843 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:21:50,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:21:50,845 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:50,846 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:50,846 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:50,846 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:21:51,082 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:21:51,083 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:51,086 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:51,087 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:51,087 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:21:51,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:21:51,120 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:51,124 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:51,125 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:51,125 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2021-06-05 10:21:51,161 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:21:51,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:21:51,162 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:51,166 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:51,167 INFO L550 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. [2021-06-05 10:21:51,168 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:21:51,199 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:21:51,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:21:51,201 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:51,204 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:51,204 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:51,204 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:21:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 10:21:51,237 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916267269] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:51,237 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:21:51,237 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2021-06-05 10:21:51,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445578473] [2021-06-05 10:21:51,237 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 10:21:51,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:21:51,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 10:21:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2021-06-05 10:21:51,238 INFO L87 Difference]: Start difference. First operand 24145 states and 69443 transitions. Second operand has 28 states, 28 states have (on average 5.321428571428571) internal successors, (149), 28 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:54,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:21:54,475 INFO L93 Difference]: Finished difference Result 114136 states and 326347 transitions. [2021-06-05 10:21:54,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2021-06-05 10:21:54,475 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.321428571428571) internal successors, (149), 28 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 10:21:54,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:21:54,649 INFO L225 Difference]: With dead ends: 114136 [2021-06-05 10:21:54,649 INFO L226 Difference]: Without dead ends: 114112 [2021-06-05 10:21:54,649 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6287 ImplicationChecksByTransitivity, 2081.6ms TimeCoverageRelationStatistics Valid=2767, Invalid=14525, Unknown=0, NotChecked=0, Total=17292 [2021-06-05 10:21:54,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114112 states. [2021-06-05 10:21:55,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114112 to 23767. [2021-06-05 10:21:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23767 states, 23765 states have (on average 2.873848095939407) internal successors, (68297), 23766 states have internal predecessors, (68297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23767 states to 23767 states and 68297 transitions. [2021-06-05 10:21:55,613 INFO L78 Accepts]: Start accepts. Automaton has 23767 states and 68297 transitions. Word has length 89 [2021-06-05 10:21:55,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:21:55,614 INFO L482 AbstractCegarLoop]: Abstraction has 23767 states and 68297 transitions. [2021-06-05 10:21:55,614 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 5.321428571428571) internal successors, (149), 28 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:21:55,614 INFO L276 IsEmpty]: Start isEmpty. Operand 23767 states and 68297 transitions. [2021-06-05 10:21:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 10:21:55,628 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:21:55,628 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:21:55,829 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2021-06-05 10:21:55,829 INFO L430 AbstractCegarLoop]: === Iteration 34 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:21:55,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:21:55,830 INFO L82 PathProgramCache]: Analyzing trace with hash 758384815, now seen corresponding path program 4 times [2021-06-05 10:21:55,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:21:55,830 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466706458] [2021-06-05 10:21:55,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:21:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:21:55,962 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 10:21:55,962 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:21:55,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466706458] [2021-06-05 10:21:55,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466706458] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:55,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827379891] [2021-06-05 10:21:55,962 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:21:56,061 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 10:21:56,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:21:56,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 10:21:56,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:21:56,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:21:56,088 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:56,089 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:56,089 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:56,089 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:21:56,113 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:21:56,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:21:56,115 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:56,116 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:56,116 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:56,116 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:21:56,282 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:21:56,283 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:56,286 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:56,287 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:56,287 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:21:56,318 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:21:56,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:21:56,320 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:56,324 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:56,326 INFO L550 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. [2021-06-05 10:21:56,326 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2021-06-05 10:21:56,375 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:21:56,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:21:56,377 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:56,383 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:56,384 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:21:56,385 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2021-06-05 10:21:56,418 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:21:56,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:21:56,419 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:21:56,422 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:21:56,422 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:21:56,422 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:21:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 10:21:56,451 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827379891] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:21:56,451 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:21:56,451 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2021-06-05 10:21:56,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465635302] [2021-06-05 10:21:56,451 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 10:21:56,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:21:56,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 10:21:56,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2021-06-05 10:21:56,452 INFO L87 Difference]: Start difference. First operand 23767 states and 68297 transitions. Second operand has 28 states, 28 states have (on average 5.357142857142857) internal successors, (150), 28 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:00,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:22:00,160 INFO L93 Difference]: Finished difference Result 109460 states and 312394 transitions. [2021-06-05 10:22:00,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2021-06-05 10:22:00,161 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.357142857142857) internal successors, (150), 28 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 10:22:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:22:00,325 INFO L225 Difference]: With dead ends: 109460 [2021-06-05 10:22:00,325 INFO L226 Difference]: Without dead ends: 109040 [2021-06-05 10:22:00,326 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6915 ImplicationChecksByTransitivity, 2123.0ms TimeCoverageRelationStatistics Valid=2795, Invalid=16945, Unknown=0, NotChecked=0, Total=19740 [2021-06-05 10:22:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109040 states. [2021-06-05 10:22:01,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109040 to 24261. [2021-06-05 10:22:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24261 states, 24259 states have (on average 2.8752627890679747) internal successors, (69751), 24260 states have internal predecessors, (69751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24261 states to 24261 states and 69751 transitions. [2021-06-05 10:22:01,376 INFO L78 Accepts]: Start accepts. Automaton has 24261 states and 69751 transitions. Word has length 89 [2021-06-05 10:22:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:22:01,376 INFO L482 AbstractCegarLoop]: Abstraction has 24261 states and 69751 transitions. [2021-06-05 10:22:01,376 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 5.357142857142857) internal successors, (150), 28 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:01,376 INFO L276 IsEmpty]: Start isEmpty. Operand 24261 states and 69751 transitions. [2021-06-05 10:22:01,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 10:22:01,391 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:22:01,391 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:22:01,591 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:22:01,591 INFO L430 AbstractCegarLoop]: === Iteration 35 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:22:01,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:22:01,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1116500521, now seen corresponding path program 5 times [2021-06-05 10:22:01,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:22:01,592 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006709776] [2021-06-05 10:22:01,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:22:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:22:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:22:01,771 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:22:01,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006709776] [2021-06-05 10:22:01,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006709776] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:01,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899920434] [2021-06-05 10:22:01,771 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:22:01,825 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 10:22:01,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:22:01,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 10:22:01,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:22:01,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:22:01,844 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:01,845 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:01,846 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:01,846 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:22:01,861 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:22:01,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:22:01,863 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:01,864 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:01,864 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:01,864 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:22:01,973 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:22:01,974 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:01,977 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:01,977 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:01,978 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:22:02,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:22:02,006 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:02,010 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:02,011 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:02,011 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2021-06-05 10:22:02,036 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:22:02,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:22:02,037 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:02,041 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:02,041 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:02,041 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2021-06-05 10:22:02,066 INFO L354 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2021-06-05 10:22:02,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2021-06-05 10:22:02,068 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:02,072 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:02,072 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:02,072 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:28 [2021-06-05 10:22:02,147 INFO L354 Elim1Store]: treesize reduction 76, result has 31.5 percent of original size [2021-06-05 10:22:02,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2021-06-05 10:22:02,148 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:02,155 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:02,168 INFO L550 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. [2021-06-05 10:22:02,168 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:52 [2021-06-05 10:22:02,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:22:02,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:22:02,266 INFO L354 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2021-06-05 10:22:02,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2021-06-05 10:22:02,267 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:02,271 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:22:02,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:22:02,272 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:02,279 INFO L628 ElimStorePlain]: treesize reduction 23, result has 28.1 percent of original size [2021-06-05 10:22:02,280 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:02,280 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:95, output treesize:3 [2021-06-05 10:22:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:22:02,305 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899920434] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:02,305 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:22:02,306 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 31 [2021-06-05 10:22:02,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083938210] [2021-06-05 10:22:02,306 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 10:22:02,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:22:02,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 10:22:02,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2021-06-05 10:22:02,306 INFO L87 Difference]: Start difference. First operand 24261 states and 69751 transitions. Second operand has 31 states, 31 states have (on average 4.806451612903226) internal successors, (149), 31 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:06,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:22:06,343 INFO L93 Difference]: Finished difference Result 75901 states and 217074 transitions. [2021-06-05 10:22:06,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2021-06-05 10:22:06,344 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.806451612903226) internal successors, (149), 31 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 10:22:06,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:22:06,462 INFO L225 Difference]: With dead ends: 75901 [2021-06-05 10:22:06,462 INFO L226 Difference]: Without dead ends: 75805 [2021-06-05 10:22:06,463 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6084 ImplicationChecksByTransitivity, 2383.9ms TimeCoverageRelationStatistics Valid=2539, Invalid=15551, Unknown=0, NotChecked=0, Total=18090 [2021-06-05 10:22:06,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75805 states. [2021-06-05 10:22:07,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75805 to 24753. [2021-06-05 10:22:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24753 states, 24751 states have (on average 2.877863520665832) internal successors, (71230), 24752 states have internal predecessors, (71230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24753 states to 24753 states and 71230 transitions. [2021-06-05 10:22:07,241 INFO L78 Accepts]: Start accepts. Automaton has 24753 states and 71230 transitions. Word has length 89 [2021-06-05 10:22:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:22:07,241 INFO L482 AbstractCegarLoop]: Abstraction has 24753 states and 71230 transitions. [2021-06-05 10:22:07,242 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 4.806451612903226) internal successors, (149), 31 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 24753 states and 71230 transitions. [2021-06-05 10:22:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 10:22:07,257 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:22:07,257 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:22:07,473 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2021-06-05 10:22:07,473 INFO L430 AbstractCegarLoop]: === Iteration 36 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:22:07,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:22:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash -714836759, now seen corresponding path program 6 times [2021-06-05 10:22:07,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:22:07,474 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071362737] [2021-06-05 10:22:07,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:22:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:22:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:22:07,723 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:22:07,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071362737] [2021-06-05 10:22:07,723 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071362737] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:07,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436377157] [2021-06-05 10:22:07,723 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:22:07,801 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 10:22:07,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:22:07,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 10:22:07,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:22:08,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:22:08,016 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:08,020 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:08,020 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:08,020 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2021-06-05 10:22:08,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:22:08,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:22:08,054 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:08,059 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:08,063 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:08,064 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:17 [2021-06-05 10:22:08,102 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:22:08,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:22:08,108 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:08,112 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:08,113 INFO L550 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. [2021-06-05 10:22:08,113 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:22:08,148 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:22:08,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:22:08,149 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:08,152 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:08,152 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:08,152 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:22:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:22:08,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436377157] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:08,183 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:22:08,183 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2021-06-05 10:22:08,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502371155] [2021-06-05 10:22:08,184 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 10:22:08,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:22:08,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 10:22:08,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2021-06-05 10:22:08,184 INFO L87 Difference]: Start difference. First operand 24753 states and 71230 transitions. Second operand has 30 states, 30 states have (on average 5.033333333333333) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:22:12,313 INFO L93 Difference]: Finished difference Result 70711 states and 202389 transitions. [2021-06-05 10:22:12,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2021-06-05 10:22:12,314 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.033333333333333) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 10:22:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:22:12,413 INFO L225 Difference]: With dead ends: 70711 [2021-06-05 10:22:12,413 INFO L226 Difference]: Without dead ends: 70291 [2021-06-05 10:22:12,414 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5728 ImplicationChecksByTransitivity, 2642.0ms TimeCoverageRelationStatistics Valid=2723, Invalid=14833, Unknown=0, NotChecked=0, Total=17556 [2021-06-05 10:22:12,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70291 states. [2021-06-05 10:22:13,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70291 to 22219. [2021-06-05 10:22:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22219 states, 22217 states have (on average 2.868479092586758) internal successors, (63729), 22218 states have internal predecessors, (63729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22219 states to 22219 states and 63729 transitions. [2021-06-05 10:22:13,076 INFO L78 Accepts]: Start accepts. Automaton has 22219 states and 63729 transitions. Word has length 89 [2021-06-05 10:22:13,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:22:13,077 INFO L482 AbstractCegarLoop]: Abstraction has 22219 states and 63729 transitions. [2021-06-05 10:22:13,077 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.033333333333333) internal successors, (151), 30 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 22219 states and 63729 transitions. [2021-06-05 10:22:13,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 10:22:13,091 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:22:13,091 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:22:13,291 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:22:13,291 INFO L430 AbstractCegarLoop]: === Iteration 37 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:22:13,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:22:13,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1536757815, now seen corresponding path program 3 times [2021-06-05 10:22:13,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:22:13,292 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787450065] [2021-06-05 10:22:13,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:22:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:22:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:22:13,414 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:22:13,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787450065] [2021-06-05 10:22:13,414 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787450065] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:13,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305922737] [2021-06-05 10:22:13,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:22:13,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 10:22:13,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:22:13,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 10:22:13,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:22:13,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:22:13,492 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:13,493 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:13,493 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:13,493 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:22:13,507 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:22:13,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:22:13,508 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:13,509 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:13,509 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:13,509 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:22:13,665 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:22:13,666 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:13,669 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:13,669 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:13,669 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:22:13,696 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:22:13,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:22:13,697 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:13,701 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:13,702 INFO L550 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. [2021-06-05 10:22:13,702 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2021-06-05 10:22:13,739 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:22:13,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:22:13,740 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:13,746 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:13,747 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:22:13,747 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2021-06-05 10:22:13,783 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:22:13,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:22:13,785 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:13,787 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:13,787 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:13,787 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:22:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:22:13,815 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305922737] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:13,815 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:22:13,815 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 29 [2021-06-05 10:22:13,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618528524] [2021-06-05 10:22:13,816 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 10:22:13,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:22:13,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 10:22:13,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2021-06-05 10:22:13,816 INFO L87 Difference]: Start difference. First operand 22219 states and 63729 transitions. Second operand has 29 states, 29 states have (on average 5.137931034482759) internal successors, (149), 29 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:14,802 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2021-06-05 10:22:16,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:22:16,858 INFO L93 Difference]: Finished difference Result 63701 states and 182751 transitions. [2021-06-05 10:22:16,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2021-06-05 10:22:16,859 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.137931034482759) internal successors, (149), 29 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 10:22:16,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:22:16,950 INFO L225 Difference]: With dead ends: 63701 [2021-06-05 10:22:16,950 INFO L226 Difference]: Without dead ends: 63581 [2021-06-05 10:22:16,952 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4577 ImplicationChecksByTransitivity, 2010.2ms TimeCoverageRelationStatistics Valid=2262, Invalid=11544, Unknown=0, NotChecked=0, Total=13806 [2021-06-05 10:22:17,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63581 states. [2021-06-05 10:22:17,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63581 to 21657. [2021-06-05 10:22:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21657 states, 21655 states have (on average 2.8704687139228815) internal successors, (62160), 21656 states have internal predecessors, (62160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:17,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21657 states to 21657 states and 62160 transitions. [2021-06-05 10:22:17,588 INFO L78 Accepts]: Start accepts. Automaton has 21657 states and 62160 transitions. Word has length 89 [2021-06-05 10:22:17,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:22:17,588 INFO L482 AbstractCegarLoop]: Abstraction has 21657 states and 62160 transitions. [2021-06-05 10:22:17,588 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 5.137931034482759) internal successors, (149), 29 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:17,588 INFO L276 IsEmpty]: Start isEmpty. Operand 21657 states and 62160 transitions. [2021-06-05 10:22:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 10:22:17,602 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:22:17,602 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:22:17,803 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2021-06-05 10:22:17,803 INFO L430 AbstractCegarLoop]: === Iteration 38 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:22:17,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:22:17,803 INFO L82 PathProgramCache]: Analyzing trace with hash -408688343, now seen corresponding path program 7 times [2021-06-05 10:22:17,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:22:17,803 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416155402] [2021-06-05 10:22:17,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:22:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:22:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:22:17,951 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:22:17,951 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416155402] [2021-06-05 10:22:17,951 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416155402] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:17,951 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376401739] [2021-06-05 10:22:17,951 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:22:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:22:18,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 10:22:18,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:22:18,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:22:18,022 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:18,023 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:18,023 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:18,023 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:22:18,037 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:22:18,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:22:18,038 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:18,039 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:18,040 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:18,040 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:22:18,173 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:22:18,173 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:18,177 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:18,177 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:18,177 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:22:18,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:22:18,202 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:18,206 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:18,207 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:18,207 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2021-06-05 10:22:18,233 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:22:18,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:22:18,234 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:18,237 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:18,238 INFO L550 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. [2021-06-05 10:22:18,238 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:22:18,267 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:22:18,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:22:18,268 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:18,271 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:18,271 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:18,271 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:22:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:22:18,298 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376401739] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:18,298 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:22:18,298 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2021-06-05 10:22:18,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969321803] [2021-06-05 10:22:18,298 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 10:22:18,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:22:18,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 10:22:18,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2021-06-05 10:22:18,299 INFO L87 Difference]: Start difference. First operand 21657 states and 62160 transitions. Second operand has 28 states, 28 states have (on average 5.321428571428571) internal successors, (149), 28 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:22:21,783 INFO L93 Difference]: Finished difference Result 86241 states and 247195 transitions. [2021-06-05 10:22:21,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2021-06-05 10:22:21,784 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.321428571428571) internal successors, (149), 28 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 10:22:21,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:22:22,009 INFO L225 Difference]: With dead ends: 86241 [2021-06-05 10:22:22,009 INFO L226 Difference]: Without dead ends: 85917 [2021-06-05 10:22:22,010 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6931 ImplicationChecksByTransitivity, 2127.4ms TimeCoverageRelationStatistics Valid=2766, Invalid=16974, Unknown=0, NotChecked=0, Total=19740 [2021-06-05 10:22:22,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85917 states. [2021-06-05 10:22:22,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85917 to 21583. [2021-06-05 10:22:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21583 states, 21581 states have (on average 2.8708586256429265) internal successors, (61956), 21582 states have internal predecessors, (61956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21583 states to 21583 states and 61956 transitions. [2021-06-05 10:22:22,661 INFO L78 Accepts]: Start accepts. Automaton has 21583 states and 61956 transitions. Word has length 89 [2021-06-05 10:22:22,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:22:22,661 INFO L482 AbstractCegarLoop]: Abstraction has 21583 states and 61956 transitions. [2021-06-05 10:22:22,661 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 5.321428571428571) internal successors, (149), 28 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 21583 states and 61956 transitions. [2021-06-05 10:22:22,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 10:22:22,675 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:22:22,675 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:22:22,876 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:22:22,876 INFO L430 AbstractCegarLoop]: === Iteration 39 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:22:22,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:22:22,876 INFO L82 PathProgramCache]: Analyzing trace with hash -388691223, now seen corresponding path program 4 times [2021-06-05 10:22:22,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:22:22,876 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106202082] [2021-06-05 10:22:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:22:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:22:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:22:23,000 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:22:23,001 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106202082] [2021-06-05 10:22:23,001 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106202082] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:23,001 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341631978] [2021-06-05 10:22:23,001 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:22:23,053 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 10:22:23,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:22:23,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 10:22:23,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:22:23,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:22:23,086 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:23,087 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:23,087 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:23,087 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:22:23,101 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:22:23,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:22:23,103 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:23,104 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:23,104 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:23,104 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:22:23,226 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:22:23,227 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:23,230 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:23,231 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:23,231 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:22:23,257 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:22:23,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:22:23,258 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:23,262 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:23,263 INFO L550 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. [2021-06-05 10:22:23,264 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2021-06-05 10:22:23,297 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:22:23,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:22:23,298 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:23,304 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:23,305 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:22:23,306 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2021-06-05 10:22:23,335 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:22:23,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:22:23,336 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:23,338 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:23,339 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:23,339 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:22:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:22:23,366 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341631978] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:23,366 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:22:23,366 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2021-06-05 10:22:23,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98476347] [2021-06-05 10:22:23,366 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 10:22:23,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:22:23,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 10:22:23,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2021-06-05 10:22:23,367 INFO L87 Difference]: Start difference. First operand 21583 states and 61956 transitions. Second operand has 28 states, 28 states have (on average 5.321428571428571) internal successors, (149), 28 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:26,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:22:26,771 INFO L93 Difference]: Finished difference Result 85053 states and 244127 transitions. [2021-06-05 10:22:26,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2021-06-05 10:22:26,771 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.321428571428571) internal successors, (149), 28 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 10:22:26,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:22:26,891 INFO L225 Difference]: With dead ends: 85053 [2021-06-05 10:22:26,891 INFO L226 Difference]: Without dead ends: 84933 [2021-06-05 10:22:26,892 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6249 ImplicationChecksByTransitivity, 1949.3ms TimeCoverageRelationStatistics Valid=2781, Invalid=14511, Unknown=0, NotChecked=0, Total=17292 [2021-06-05 10:22:27,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84933 states. [2021-06-05 10:22:27,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84933 to 21117. [2021-06-05 10:22:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21117 states, 21115 states have (on average 2.8707080274686243) internal successors, (60615), 21116 states have internal predecessors, (60615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21117 states to 21117 states and 60615 transitions. [2021-06-05 10:22:27,604 INFO L78 Accepts]: Start accepts. Automaton has 21117 states and 60615 transitions. Word has length 89 [2021-06-05 10:22:27,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:22:27,605 INFO L482 AbstractCegarLoop]: Abstraction has 21117 states and 60615 transitions. [2021-06-05 10:22:27,605 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 5.321428571428571) internal successors, (149), 28 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:27,605 INFO L276 IsEmpty]: Start isEmpty. Operand 21117 states and 60615 transitions. [2021-06-05 10:22:27,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-05 10:22:27,620 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:22:27,620 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:22:27,821 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2021-06-05 10:22:27,821 INFO L430 AbstractCegarLoop]: === Iteration 40 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:22:27,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:22:27,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1872968898, now seen corresponding path program 5 times [2021-06-05 10:22:27,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:22:27,821 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917030238] [2021-06-05 10:22:27,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:22:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:22:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:22:27,902 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:22:27,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917030238] [2021-06-05 10:22:27,902 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917030238] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:27,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968240975] [2021-06-05 10:22:27,902 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:22:27,957 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 10:22:27,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:22:27,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 13 conjunts are in the unsatisfiable core [2021-06-05 10:22:27,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:22:28,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:22:28,189 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:28,192 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:28,192 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:28,193 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:22:28,220 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:22:28,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:22:28,221 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:28,224 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:28,225 INFO L550 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. [2021-06-05 10:22:28,225 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:22:28,252 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:22:28,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:22:28,254 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:28,256 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:28,257 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:28,257 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:22:28,284 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:22:28,285 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968240975] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:28,285 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:22:28,285 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2021-06-05 10:22:28,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382957876] [2021-06-05 10:22:28,285 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 10:22:28,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:22:28,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 10:22:28,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2021-06-05 10:22:28,285 INFO L87 Difference]: Start difference. First operand 21117 states and 60615 transitions. Second operand has 22 states, 22 states have (on average 7.045454545454546) internal successors, (155), 22 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:22:32,430 INFO L93 Difference]: Finished difference Result 134227 states and 382377 transitions. [2021-06-05 10:22:32,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2021-06-05 10:22:32,431 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.045454545454546) internal successors, (155), 22 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-06-05 10:22:32,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:22:32,626 INFO L225 Difference]: With dead ends: 134227 [2021-06-05 10:22:32,626 INFO L226 Difference]: Without dead ends: 134047 [2021-06-05 10:22:32,629 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22311 ImplicationChecksByTransitivity, 2823.4ms TimeCoverageRelationStatistics Valid=5901, Invalid=44499, Unknown=0, NotChecked=0, Total=50400 [2021-06-05 10:22:32,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134047 states. [2021-06-05 10:22:33,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134047 to 22225. [2021-06-05 10:22:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22225 states, 22223 states have (on average 2.8703595374161903) internal successors, (63788), 22224 states have internal predecessors, (63788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22225 states to 22225 states and 63788 transitions. [2021-06-05 10:22:33,822 INFO L78 Accepts]: Start accepts. Automaton has 22225 states and 63788 transitions. Word has length 93 [2021-06-05 10:22:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:22:33,822 INFO L482 AbstractCegarLoop]: Abstraction has 22225 states and 63788 transitions. [2021-06-05 10:22:33,822 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 7.045454545454546) internal successors, (155), 22 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 22225 states and 63788 transitions. [2021-06-05 10:22:33,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-05 10:22:33,838 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:22:33,838 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:22:34,038 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable70 [2021-06-05 10:22:34,039 INFO L430 AbstractCegarLoop]: === Iteration 41 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:22:34,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:22:34,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1795844072, now seen corresponding path program 5 times [2021-06-05 10:22:34,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:22:34,039 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216784751] [2021-06-05 10:22:34,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:22:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:22:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:22:34,121 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:22:34,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216784751] [2021-06-05 10:22:34,121 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216784751] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:34,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094623351] [2021-06-05 10:22:34,121 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:22:34,183 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 10:22:34,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:22:34,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 13 conjunts are in the unsatisfiable core [2021-06-05 10:22:34,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:22:34,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:22:34,298 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:34,300 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:34,301 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:34,301 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:22:34,324 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:22:34,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:22:34,325 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:34,328 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:34,329 INFO L550 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. [2021-06-05 10:22:34,329 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:22:34,355 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:22:34,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:22:34,357 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:34,360 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:34,360 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:34,360 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:22:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:22:34,384 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094623351] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:34,384 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:22:34,384 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2021-06-05 10:22:34,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555161609] [2021-06-05 10:22:34,384 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 10:22:34,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:22:34,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 10:22:34,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2021-06-05 10:22:34,385 INFO L87 Difference]: Start difference. First operand 22225 states and 63788 transitions. Second operand has 22 states, 22 states have (on average 7.090909090909091) internal successors, (156), 22 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:22:38,120 INFO L93 Difference]: Finished difference Result 130530 states and 368670 transitions. [2021-06-05 10:22:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2021-06-05 10:22:38,120 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.090909090909091) internal successors, (156), 22 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-06-05 10:22:38,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:22:38,318 INFO L225 Difference]: With dead ends: 130530 [2021-06-05 10:22:38,319 INFO L226 Difference]: Without dead ends: 129990 [2021-06-05 10:22:38,320 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12836 ImplicationChecksByTransitivity, 2081.1ms TimeCoverageRelationStatistics Valid=3304, Invalid=28558, Unknown=0, NotChecked=0, Total=31862 [2021-06-05 10:22:38,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129990 states. [2021-06-05 10:22:39,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129990 to 22503. [2021-06-05 10:22:39,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22503 states, 22501 states have (on average 2.871783476289943) internal successors, (64618), 22502 states have internal predecessors, (64618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22503 states to 22503 states and 64618 transitions. [2021-06-05 10:22:39,465 INFO L78 Accepts]: Start accepts. Automaton has 22503 states and 64618 transitions. Word has length 93 [2021-06-05 10:22:39,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:22:39,465 INFO L482 AbstractCegarLoop]: Abstraction has 22503 states and 64618 transitions. [2021-06-05 10:22:39,465 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 7.090909090909091) internal successors, (156), 22 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 22503 states and 64618 transitions. [2021-06-05 10:22:39,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-05 10:22:39,482 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:22:39,482 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:22:39,697 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:22:39,698 INFO L430 AbstractCegarLoop]: === Iteration 42 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:22:39,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:22:39,698 INFO L82 PathProgramCache]: Analyzing trace with hash 526092714, now seen corresponding path program 5 times [2021-06-05 10:22:39,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:22:39,698 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489204031] [2021-06-05 10:22:39,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:22:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:22:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:22:39,796 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:22:39,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489204031] [2021-06-05 10:22:39,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489204031] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:39,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368130089] [2021-06-05 10:22:39,796 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:22:39,858 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 10:22:39,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:22:39,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 13 conjunts are in the unsatisfiable core [2021-06-05 10:22:39,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:22:39,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:22:39,962 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:39,964 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:39,965 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:39,965 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:22:39,986 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:22:39,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:22:39,987 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:39,990 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:39,991 INFO L550 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. [2021-06-05 10:22:39,991 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:22:40,015 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:22:40,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:22:40,016 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:40,018 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:40,019 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:40,019 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:22:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:22:40,040 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368130089] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:40,040 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:22:40,040 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2021-06-05 10:22:40,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948265030] [2021-06-05 10:22:40,041 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 10:22:40,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:22:40,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 10:22:40,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2021-06-05 10:22:40,041 INFO L87 Difference]: Start difference. First operand 22503 states and 64618 transitions. Second operand has 22 states, 22 states have (on average 6.7727272727272725) internal successors, (149), 22 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:22:43,846 INFO L93 Difference]: Finished difference Result 121683 states and 345929 transitions. [2021-06-05 10:22:43,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2021-06-05 10:22:43,847 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.7727272727272725) internal successors, (149), 22 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-06-05 10:22:43,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:22:44,025 INFO L225 Difference]: With dead ends: 121683 [2021-06-05 10:22:44,026 INFO L226 Difference]: Without dead ends: 121311 [2021-06-05 10:22:44,027 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19634 ImplicationChecksByTransitivity, 2458.5ms TimeCoverageRelationStatistics Valid=5319, Invalid=38991, Unknown=0, NotChecked=0, Total=44310 [2021-06-05 10:22:44,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121311 states. [2021-06-05 10:22:45,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121311 to 24699. [2021-06-05 10:22:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24699 states, 24697 states have (on average 2.876381746770863) internal successors, (71038), 24698 states have internal predecessors, (71038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:45,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24699 states to 24699 states and 71038 transitions. [2021-06-05 10:22:45,193 INFO L78 Accepts]: Start accepts. Automaton has 24699 states and 71038 transitions. Word has length 93 [2021-06-05 10:22:45,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:22:45,193 INFO L482 AbstractCegarLoop]: Abstraction has 24699 states and 71038 transitions. [2021-06-05 10:22:45,193 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 6.7727272727272725) internal successors, (149), 22 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:45,193 INFO L276 IsEmpty]: Start isEmpty. Operand 24699 states and 71038 transitions. [2021-06-05 10:22:45,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-05 10:22:45,213 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:22:45,213 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:22:45,413 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2021-06-05 10:22:45,414 INFO L430 AbstractCegarLoop]: === Iteration 43 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:22:45,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:22:45,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1960899094, now seen corresponding path program 6 times [2021-06-05 10:22:45,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:22:45,414 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113108890] [2021-06-05 10:22:45,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:22:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:22:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 10:22:45,576 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:22:45,576 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113108890] [2021-06-05 10:22:45,576 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113108890] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:45,576 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730396726] [2021-06-05 10:22:45,576 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:22:45,660 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 10:22:45,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:22:45,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 10:22:45,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:22:45,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:22:45,680 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:45,681 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:45,682 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:45,682 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:22:45,697 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:22:45,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:22:45,698 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:45,699 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:45,700 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:45,700 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:22:45,830 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:22:45,831 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:45,835 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:45,836 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:45,836 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2021-06-05 10:22:45,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:22:45,867 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:45,873 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:45,874 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:45,874 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2021-06-05 10:22:45,910 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:22:45,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:22:45,911 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:45,915 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:45,916 INFO L550 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. [2021-06-05 10:22:45,917 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2021-06-05 10:22:45,949 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:22:45,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:22:45,950 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:45,953 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:45,953 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:45,954 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2021-06-05 10:22:45,984 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-06-05 10:22:45,984 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730396726] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:45,984 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:22:45,984 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 28 [2021-06-05 10:22:45,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994846719] [2021-06-05 10:22:45,984 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 10:22:45,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:22:45,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 10:22:45,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2021-06-05 10:22:45,985 INFO L87 Difference]: Start difference. First operand 24699 states and 71038 transitions. Second operand has 28 states, 28 states have (on average 5.571428571428571) internal successors, (156), 28 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:22:49,126 INFO L93 Difference]: Finished difference Result 54459 states and 156012 transitions. [2021-06-05 10:22:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2021-06-05 10:22:49,127 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.571428571428571) internal successors, (156), 28 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-06-05 10:22:49,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:22:49,204 INFO L225 Difference]: With dead ends: 54459 [2021-06-05 10:22:49,205 INFO L226 Difference]: Without dead ends: 54363 [2021-06-05 10:22:49,205 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4439 ImplicationChecksByTransitivity, 1945.1ms TimeCoverageRelationStatistics Valid=2390, Invalid=11182, Unknown=0, NotChecked=0, Total=13572 [2021-06-05 10:22:49,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54363 states. [2021-06-05 10:22:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54363 to 23682. [2021-06-05 10:22:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23682 states, 23680 states have (on average 2.8700591216216216) internal successors, (67963), 23681 states have internal predecessors, (67963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23682 states to 23682 states and 67963 transitions. [2021-06-05 10:22:49,836 INFO L78 Accepts]: Start accepts. Automaton has 23682 states and 67963 transitions. Word has length 99 [2021-06-05 10:22:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:22:49,837 INFO L482 AbstractCegarLoop]: Abstraction has 23682 states and 67963 transitions. [2021-06-05 10:22:49,837 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 5.571428571428571) internal successors, (156), 28 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 23682 states and 67963 transitions. [2021-06-05 10:22:49,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-05 10:22:49,856 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:22:49,856 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:22:50,056 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:22:50,056 INFO L430 AbstractCegarLoop]: === Iteration 44 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:22:50,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:22:50,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1556489464, now seen corresponding path program 6 times [2021-06-05 10:22:50,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:22:50,057 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659088763] [2021-06-05 10:22:50,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:22:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:22:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 10:22:50,203 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:22:50,203 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659088763] [2021-06-05 10:22:50,203 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659088763] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:50,203 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840475775] [2021-06-05 10:22:50,203 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:22:50,256 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 10:22:50,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:22:50,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 10:22:50,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:22:50,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:22:50,285 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:50,286 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:50,287 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:50,287 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:22:50,302 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:22:50,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:22:50,303 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:50,304 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:50,305 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:50,305 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:22:50,438 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:22:50,439 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:50,442 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:50,442 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:50,442 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2021-06-05 10:22:50,472 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:22:50,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:22:50,473 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:50,477 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:50,478 INFO L550 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. [2021-06-05 10:22:50,478 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2021-06-05 10:22:50,513 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:22:50,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:22:50,514 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:50,520 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:50,521 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:22:50,521 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:26 [2021-06-05 10:22:50,551 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:22:50,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:22:50,552 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:50,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:50,555 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:50,555 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2021-06-05 10:22:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-06-05 10:22:50,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840475775] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:50,583 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:22:50,583 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 28 [2021-06-05 10:22:50,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137306759] [2021-06-05 10:22:50,583 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 10:22:50,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:22:50,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 10:22:50,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2021-06-05 10:22:50,583 INFO L87 Difference]: Start difference. First operand 23682 states and 67963 transitions. Second operand has 28 states, 28 states have (on average 5.571428571428571) internal successors, (156), 28 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:22:53,320 INFO L93 Difference]: Finished difference Result 53827 states and 154106 transitions. [2021-06-05 10:22:53,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-06-05 10:22:53,321 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.571428571428571) internal successors, (156), 28 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-06-05 10:22:53,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:22:53,398 INFO L225 Difference]: With dead ends: 53827 [2021-06-05 10:22:53,398 INFO L226 Difference]: Without dead ends: 53455 [2021-06-05 10:22:53,399 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4141 ImplicationChecksByTransitivity, 1732.6ms TimeCoverageRelationStatistics Valid=1892, Invalid=11218, Unknown=0, NotChecked=0, Total=13110 [2021-06-05 10:22:53,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53455 states. [2021-06-05 10:22:53,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53455 to 24487. [2021-06-05 10:22:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24487 states, 24485 states have (on average 2.8675107208495) internal successors, (70211), 24486 states have internal predecessors, (70211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24487 states to 24487 states and 70211 transitions. [2021-06-05 10:22:53,970 INFO L78 Accepts]: Start accepts. Automaton has 24487 states and 70211 transitions. Word has length 99 [2021-06-05 10:22:53,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:22:53,970 INFO L482 AbstractCegarLoop]: Abstraction has 24487 states and 70211 transitions. [2021-06-05 10:22:53,970 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 5.571428571428571) internal successors, (156), 28 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 24487 states and 70211 transitions. [2021-06-05 10:22:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-05 10:22:53,989 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:22:53,989 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:22:54,190 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2021-06-05 10:22:54,191 INFO L430 AbstractCegarLoop]: === Iteration 45 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:22:54,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:22:54,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1884711602, now seen corresponding path program 8 times [2021-06-05 10:22:54,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:22:54,191 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967726248] [2021-06-05 10:22:54,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:22:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:22:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:22:54,336 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:22:54,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967726248] [2021-06-05 10:22:54,337 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967726248] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:54,337 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902578100] [2021-06-05 10:22:54,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:22:54,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 10:22:54,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:22:54,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 17 conjunts are in the unsatisfiable core [2021-06-05 10:22:54,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:22:54,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:22:54,634 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:54,638 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:54,639 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:54,639 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2021-06-05 10:22:54,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:22:54,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:22:54,672 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:54,676 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:54,677 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:54,677 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:17 [2021-06-05 10:22:54,706 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:22:54,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:22:54,707 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:54,711 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:54,712 INFO L550 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. [2021-06-05 10:22:54,712 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:22:54,744 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:22:54,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:22:54,745 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:22:54,747 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:22:54,748 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:22:54,748 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:22:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:22:54,781 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902578100] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:22:54,781 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:22:54,781 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2021-06-05 10:22:54,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101218734] [2021-06-05 10:22:54,782 INFO L462 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-06-05 10:22:54,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:22:54,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-06-05 10:22:54,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2021-06-05 10:22:54,782 INFO L87 Difference]: Start difference. First operand 24487 states and 70211 transitions. Second operand has 32 states, 32 states have (on average 5.34375) internal successors, (171), 32 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:22:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:22:59,711 INFO L93 Difference]: Finished difference Result 102799 states and 294972 transitions. [2021-06-05 10:22:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2021-06-05 10:22:59,712 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.34375) internal successors, (171), 32 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-06-05 10:22:59,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:22:59,870 INFO L225 Difference]: With dead ends: 102799 [2021-06-05 10:22:59,871 INFO L226 Difference]: Without dead ends: 102475 [2021-06-05 10:22:59,872 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9730 ImplicationChecksByTransitivity, 3352.4ms TimeCoverageRelationStatistics Valid=3829, Invalid=23561, Unknown=0, NotChecked=0, Total=27390 [2021-06-05 10:23:00,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102475 states. [2021-06-05 10:23:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102475 to 24291. [2021-06-05 10:23:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24291 states, 24289 states have (on average 2.8696941002099714) internal successors, (69702), 24290 states have internal predecessors, (69702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:00,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24291 states to 24291 states and 69702 transitions. [2021-06-05 10:23:00,738 INFO L78 Accepts]: Start accepts. Automaton has 24291 states and 69702 transitions. Word has length 99 [2021-06-05 10:23:00,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:23:00,739 INFO L482 AbstractCegarLoop]: Abstraction has 24291 states and 69702 transitions. [2021-06-05 10:23:00,739 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 5.34375) internal successors, (171), 32 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand 24291 states and 69702 transitions. [2021-06-05 10:23:00,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-05 10:23:00,759 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:23:00,759 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:23:00,968 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2021-06-05 10:23:00,969 INFO L430 AbstractCegarLoop]: === Iteration 46 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:23:00,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:23:00,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1904708722, now seen corresponding path program 6 times [2021-06-05 10:23:00,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:23:00,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156496452] [2021-06-05 10:23:00,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:23:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:23:01,105 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:23:01,105 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:23:01,106 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156496452] [2021-06-05 10:23:01,106 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156496452] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:01,106 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406184707] [2021-06-05 10:23:01,106 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:23:01,165 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 10:23:01,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:23:01,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 17 conjunts are in the unsatisfiable core [2021-06-05 10:23:01,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:23:01,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:23:01,382 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:01,385 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:01,385 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:01,386 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2021-06-05 10:23:01,415 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:23:01,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:23:01,416 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:01,421 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:01,422 INFO L550 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. [2021-06-05 10:23:01,422 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2021-06-05 10:23:01,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:23:01,462 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:23:01,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:23:01,463 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:01,468 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:01,470 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:23:01,470 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:28 [2021-06-05 10:23:01,503 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:23:01,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:23:01,504 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:01,506 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:01,507 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:01,507 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:23:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:23:01,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406184707] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:01,538 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:23:01,538 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2021-06-05 10:23:01,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569241040] [2021-06-05 10:23:01,539 INFO L462 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-06-05 10:23:01,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:23:01,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-06-05 10:23:01,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=891, Unknown=0, NotChecked=0, Total=992 [2021-06-05 10:23:01,539 INFO L87 Difference]: Start difference. First operand 24291 states and 69702 transitions. Second operand has 32 states, 32 states have (on average 5.34375) internal successors, (171), 32 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:02,217 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2021-06-05 10:23:06,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:23:06,891 INFO L93 Difference]: Finished difference Result 102797 states and 295365 transitions. [2021-06-05 10:23:06,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2021-06-05 10:23:06,892 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.34375) internal successors, (171), 32 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-06-05 10:23:06,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:23:07,055 INFO L225 Difference]: With dead ends: 102797 [2021-06-05 10:23:07,056 INFO L226 Difference]: Without dead ends: 102677 [2021-06-05 10:23:07,058 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9425 ImplicationChecksByTransitivity, 3969.0ms TimeCoverageRelationStatistics Valid=4145, Invalid=21295, Unknown=0, NotChecked=0, Total=25440 [2021-06-05 10:23:07,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102677 states. [2021-06-05 10:23:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102677 to 22589. [2021-06-05 10:23:07,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22589 states, 22587 states have (on average 2.86239872493027) internal successors, (64653), 22588 states have internal predecessors, (64653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22589 states to 22589 states and 64653 transitions. [2021-06-05 10:23:07,906 INFO L78 Accepts]: Start accepts. Automaton has 22589 states and 64653 transitions. Word has length 99 [2021-06-05 10:23:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:23:07,907 INFO L482 AbstractCegarLoop]: Abstraction has 22589 states and 64653 transitions. [2021-06-05 10:23:07,907 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 5.34375) internal successors, (171), 32 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 22589 states and 64653 transitions. [2021-06-05 10:23:07,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-06-05 10:23:07,927 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:23:07,927 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:23:08,133 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:23:08,133 INFO L430 AbstractCegarLoop]: === Iteration 47 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:23:08,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:23:08,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1736135333, now seen corresponding path program 1 times [2021-06-05 10:23:08,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:23:08,134 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424364609] [2021-06-05 10:23:08,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:23:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:23:08,230 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:23:08,230 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:23:08,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424364609] [2021-06-05 10:23:08,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424364609] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:08,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942811713] [2021-06-05 10:23:08,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:23:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:23:08,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 10:23:08,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:23:08,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:23:08,415 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:08,418 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:08,418 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:08,418 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:23:08,441 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:23:08,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:23:08,442 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:08,446 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:08,447 INFO L550 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. [2021-06-05 10:23:08,447 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:23:08,477 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:23:08,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:23:08,478 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:08,481 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:08,481 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:08,481 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:23:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 10:23:08,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942811713] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:08,504 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:23:08,504 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2021-06-05 10:23:08,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075454440] [2021-06-05 10:23:08,504 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 10:23:08,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:23:08,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 10:23:08,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2021-06-05 10:23:08,505 INFO L87 Difference]: Start difference. First operand 22589 states and 64653 transitions. Second operand has 23 states, 23 states have (on average 7.260869565217392) internal successors, (167), 23 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:09,582 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-06-05 10:23:11,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:23:11,826 INFO L93 Difference]: Finished difference Result 84059 states and 237029 transitions. [2021-06-05 10:23:11,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2021-06-05 10:23:11,827 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.260869565217392) internal successors, (167), 23 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-06-05 10:23:11,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:23:11,939 INFO L225 Difference]: With dead ends: 84059 [2021-06-05 10:23:11,939 INFO L226 Difference]: Without dead ends: 83543 [2021-06-05 10:23:11,941 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 201 SyntacticMatches, 4 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11659 ImplicationChecksByTransitivity, 2148.6ms TimeCoverageRelationStatistics Valid=3579, Invalid=23811, Unknown=0, NotChecked=0, Total=27390 [2021-06-05 10:23:12,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83543 states. [2021-06-05 10:23:12,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83543 to 29077. [2021-06-05 10:23:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29077 states, 29075 states have (on average 2.873602751504729) internal successors, (83550), 29076 states have internal predecessors, (83550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29077 states to 29077 states and 83550 transitions. [2021-06-05 10:23:12,719 INFO L78 Accepts]: Start accepts. Automaton has 29077 states and 83550 transitions. Word has length 103 [2021-06-05 10:23:12,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:23:12,719 INFO L482 AbstractCegarLoop]: Abstraction has 29077 states and 83550 transitions. [2021-06-05 10:23:12,720 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 7.260869565217392) internal successors, (167), 23 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 29077 states and 83550 transitions. [2021-06-05 10:23:12,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-06-05 10:23:12,741 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:23:12,741 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:23:12,941 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2021-06-05 10:23:12,941 INFO L430 AbstractCegarLoop]: === Iteration 48 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:23:12,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:23:12,942 INFO L82 PathProgramCache]: Analyzing trace with hash -2113062733, now seen corresponding path program 1 times [2021-06-05 10:23:12,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:23:12,942 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245780883] [2021-06-05 10:23:12,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:23:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:23:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:23:13,026 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:23:13,026 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245780883] [2021-06-05 10:23:13,026 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245780883] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:13,026 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763278841] [2021-06-05 10:23:13,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:23:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:23:13,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 10:23:13,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:23:13,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:23:13,248 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:13,250 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:13,251 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:13,251 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:23:13,278 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:23:13,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:23:13,279 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:13,283 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:13,284 INFO L550 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. [2021-06-05 10:23:13,285 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:23:13,314 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:23:13,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:23:13,316 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:13,318 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:13,319 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:13,319 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:23:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:23:13,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763278841] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:13,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:23:13,346 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2021-06-05 10:23:13,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880225555] [2021-06-05 10:23:13,346 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 10:23:13,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:23:13,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 10:23:13,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2021-06-05 10:23:13,347 INFO L87 Difference]: Start difference. First operand 29077 states and 83550 transitions. Second operand has 23 states, 23 states have (on average 7.0) internal successors, (161), 23 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:13,994 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2021-06-05 10:23:16,770 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2021-06-05 10:23:17,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:23:17,266 INFO L93 Difference]: Finished difference Result 92994 states and 263062 transitions. [2021-06-05 10:23:17,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2021-06-05 10:23:17,267 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.0) internal successors, (161), 23 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-06-05 10:23:17,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:23:17,389 INFO L225 Difference]: With dead ends: 92994 [2021-06-05 10:23:17,389 INFO L226 Difference]: Without dead ends: 92382 [2021-06-05 10:23:17,391 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12519 ImplicationChecksByTransitivity, 2416.8ms TimeCoverageRelationStatistics Valid=3733, Invalid=27419, Unknown=0, NotChecked=0, Total=31152 [2021-06-05 10:23:17,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92382 states. [2021-06-05 10:23:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92382 to 27777. [2021-06-05 10:23:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27777 states, 27775 states have (on average 2.8712151215121513) internal successors, (79748), 27776 states have internal predecessors, (79748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:18,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27777 states to 27777 states and 79748 transitions. [2021-06-05 10:23:18,214 INFO L78 Accepts]: Start accepts. Automaton has 27777 states and 79748 transitions. Word has length 103 [2021-06-05 10:23:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:23:18,214 INFO L482 AbstractCegarLoop]: Abstraction has 27777 states and 79748 transitions. [2021-06-05 10:23:18,214 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 7.0) internal successors, (161), 23 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 27777 states and 79748 transitions. [2021-06-05 10:23:18,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-06-05 10:23:18,235 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:23:18,235 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:23:18,435 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:23:18,436 INFO L430 AbstractCegarLoop]: === Iteration 49 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:23:18,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:23:18,436 INFO L82 PathProgramCache]: Analyzing trace with hash -347778701, now seen corresponding path program 2 times [2021-06-05 10:23:18,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:23:18,436 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776149066] [2021-06-05 10:23:18,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:23:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:23:18,571 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:23:18,571 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:23:18,571 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776149066] [2021-06-05 10:23:18,571 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776149066] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:18,571 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751786229] [2021-06-05 10:23:18,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:23:18,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 10:23:18,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:23:18,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 10:23:18,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:23:18,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:23:18,885 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:18,888 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:18,888 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:18,888 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:23:18,910 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:23:18,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:23:18,911 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:18,914 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:18,915 INFO L550 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. [2021-06-05 10:23:18,915 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:23:18,952 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:23:18,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:23:18,953 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:18,955 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:18,956 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:18,956 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:23:18,978 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 10:23:18,979 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751786229] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:18,979 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:23:18,979 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 22 [2021-06-05 10:23:18,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771423847] [2021-06-05 10:23:18,979 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 10:23:18,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:23:18,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 10:23:18,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-06-05 10:23:18,980 INFO L87 Difference]: Start difference. First operand 27777 states and 79748 transitions. Second operand has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:21,723 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-06-05 10:23:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:23:22,639 INFO L93 Difference]: Finished difference Result 114513 states and 323951 transitions. [2021-06-05 10:23:22,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2021-06-05 10:23:22,640 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-06-05 10:23:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:23:22,804 INFO L225 Difference]: With dead ends: 114513 [2021-06-05 10:23:22,804 INFO L226 Difference]: Without dead ends: 114141 [2021-06-05 10:23:22,806 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16861 ImplicationChecksByTransitivity, 2369.7ms TimeCoverageRelationStatistics Valid=4678, Invalid=33934, Unknown=0, NotChecked=0, Total=38612 [2021-06-05 10:23:22,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114141 states. [2021-06-05 10:23:23,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114141 to 33451. [2021-06-05 10:23:23,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33451 states, 33449 states have (on average 2.8782624293700856) internal successors, (96275), 33450 states have internal predecessors, (96275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33451 states to 33451 states and 96275 transitions. [2021-06-05 10:23:23,915 INFO L78 Accepts]: Start accepts. Automaton has 33451 states and 96275 transitions. Word has length 103 [2021-06-05 10:23:23,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:23:23,915 INFO L482 AbstractCegarLoop]: Abstraction has 33451 states and 96275 transitions. [2021-06-05 10:23:23,916 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 33451 states and 96275 transitions. [2021-06-05 10:23:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-06-05 10:23:23,945 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:23:23,946 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:23:24,146 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2021-06-05 10:23:24,146 INFO L430 AbstractCegarLoop]: === Iteration 50 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:23:24,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:23:24,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1648993139, now seen corresponding path program 2 times [2021-06-05 10:23:24,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:23:24,147 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155236607] [2021-06-05 10:23:24,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:23:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:23:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:23:24,237 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:23:24,237 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155236607] [2021-06-05 10:23:24,237 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155236607] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:24,237 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111426788] [2021-06-05 10:23:24,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:23:24,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 10:23:24,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:23:24,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 10:23:24,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:23:24,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:23:24,425 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:24,428 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:24,429 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:24,429 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:23:24,451 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:23:24,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:23:24,452 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:24,455 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:24,456 INFO L550 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. [2021-06-05 10:23:24,456 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:23:24,482 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:23:24,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:23:24,483 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:24,486 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:24,486 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:24,486 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:23:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 10:23:24,509 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111426788] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:24,509 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:23:24,509 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 22 [2021-06-05 10:23:24,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835565192] [2021-06-05 10:23:24,510 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 10:23:24,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:23:24,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 10:23:24,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-06-05 10:23:24,510 INFO L87 Difference]: Start difference. First operand 33451 states and 96275 transitions. Second operand has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:23:28,485 INFO L93 Difference]: Finished difference Result 126492 states and 359069 transitions. [2021-06-05 10:23:28,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2021-06-05 10:23:28,486 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-06-05 10:23:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:23:28,698 INFO L225 Difference]: With dead ends: 126492 [2021-06-05 10:23:28,698 INFO L226 Difference]: Without dead ends: 125916 [2021-06-05 10:23:28,699 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12531 ImplicationChecksByTransitivity, 2151.1ms TimeCoverageRelationStatistics Valid=3372, Invalid=28134, Unknown=0, NotChecked=0, Total=31506 [2021-06-05 10:23:28,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125916 states. [2021-06-05 10:23:29,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125916 to 32957. [2021-06-05 10:23:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32957 states, 32955 states have (on average 2.873251403428918) internal successors, (94688), 32956 states have internal predecessors, (94688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:29,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32957 states to 32957 states and 94688 transitions. [2021-06-05 10:23:29,868 INFO L78 Accepts]: Start accepts. Automaton has 32957 states and 94688 transitions. Word has length 103 [2021-06-05 10:23:29,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:23:29,868 INFO L482 AbstractCegarLoop]: Abstraction has 32957 states and 94688 transitions. [2021-06-05 10:23:29,868 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:29,869 INFO L276 IsEmpty]: Start isEmpty. Operand 32957 states and 94688 transitions. [2021-06-05 10:23:29,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-06-05 10:23:29,897 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:23:29,897 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:23:30,097 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:23:30,097 INFO L430 AbstractCegarLoop]: === Iteration 51 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:23:30,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:23:30,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1170452673, now seen corresponding path program 7 times [2021-06-05 10:23:30,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:23:30,099 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134883036] [2021-06-05 10:23:30,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:23:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:23:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:23:30,189 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:23:30,189 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134883036] [2021-06-05 10:23:30,189 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134883036] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:30,189 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849737574] [2021-06-05 10:23:30,189 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:23:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:23:30,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 10:23:30,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:23:30,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:23:30,362 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:30,364 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:30,364 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:30,364 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:23:30,387 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:23:30,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:23:30,388 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:30,392 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:30,393 INFO L550 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. [2021-06-05 10:23:30,393 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:23:30,420 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:23:30,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:23:30,421 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:30,424 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:30,424 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:30,424 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:23:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:23:30,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849737574] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:30,447 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:23:30,447 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2021-06-05 10:23:30,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809053041] [2021-06-05 10:23:30,448 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 10:23:30,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:23:30,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 10:23:30,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2021-06-05 10:23:30,448 INFO L87 Difference]: Start difference. First operand 32957 states and 94688 transitions. Second operand has 23 states, 23 states have (on average 6.913043478260869) internal successors, (159), 23 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:23:35,122 INFO L93 Difference]: Finished difference Result 157607 states and 448069 transitions. [2021-06-05 10:23:35,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2021-06-05 10:23:35,122 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.913043478260869) internal successors, (159), 23 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-06-05 10:23:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:23:35,344 INFO L225 Difference]: With dead ends: 157607 [2021-06-05 10:23:35,344 INFO L226 Difference]: Without dead ends: 157235 [2021-06-05 10:23:35,346 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28107 ImplicationChecksByTransitivity, 3113.1ms TimeCoverageRelationStatistics Valid=7310, Invalid=54442, Unknown=0, NotChecked=0, Total=61752 [2021-06-05 10:23:35,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157235 states. [2021-06-05 10:23:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157235 to 35601. [2021-06-05 10:23:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35601 states, 35599 states have (on average 2.877440377538695) internal successors, (102434), 35600 states have internal predecessors, (102434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35601 states to 35601 states and 102434 transitions. [2021-06-05 10:23:36,744 INFO L78 Accepts]: Start accepts. Automaton has 35601 states and 102434 transitions. Word has length 103 [2021-06-05 10:23:36,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:23:36,745 INFO L482 AbstractCegarLoop]: Abstraction has 35601 states and 102434 transitions. [2021-06-05 10:23:36,745 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 6.913043478260869) internal successors, (159), 23 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:36,745 INFO L276 IsEmpty]: Start isEmpty. Operand 35601 states and 102434 transitions. [2021-06-05 10:23:36,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-06-05 10:23:36,779 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:23:36,780 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:23:36,980 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:23:36,980 INFO L430 AbstractCegarLoop]: === Iteration 52 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:23:36,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:23:36,981 INFO L82 PathProgramCache]: Analyzing trace with hash 676506850, now seen corresponding path program 3 times [2021-06-05 10:23:36,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:23:36,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933957306] [2021-06-05 10:23:36,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:23:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:23:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 10:23:37,193 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:23:37,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933957306] [2021-06-05 10:23:37,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933957306] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:37,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129089502] [2021-06-05 10:23:37,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:23:37,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 10:23:37,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:23:37,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 10:23:37,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:23:37,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:23:37,262 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:37,262 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:37,263 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:37,263 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:23:37,276 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:23:37,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:23:37,278 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:37,279 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:37,279 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:37,279 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:23:37,351 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:23:37,352 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:37,355 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:37,355 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:37,355 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2021-06-05 10:23:37,378 INFO L354 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2021-06-05 10:23:37,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 38 [2021-06-05 10:23:37,380 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:37,385 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:37,385 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:37,386 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:35 [2021-06-05 10:23:37,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 10:23:37,414 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:37,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:23:37,424 INFO L354 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2021-06-05 10:23:37,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 1 [2021-06-05 10:23:37,425 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:37,427 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:37,427 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:37,427 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:16 [2021-06-05 10:23:37,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:23:37,442 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:37,445 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:37,446 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:37,446 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2021-06-05 10:23:37,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2021-06-05 10:23:37,452 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:37,453 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:37,454 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:37,454 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2021-06-05 10:23:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-06-05 10:23:37,478 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129089502] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:37,478 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:23:37,478 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 23 [2021-06-05 10:23:37,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324536694] [2021-06-05 10:23:37,479 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 10:23:37,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:23:37,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 10:23:37,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2021-06-05 10:23:37,479 INFO L87 Difference]: Start difference. First operand 35601 states and 102434 transitions. Second operand has 23 states, 23 states have (on average 7.608695652173913) internal successors, (175), 23 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:39,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:23:39,741 INFO L93 Difference]: Finished difference Result 70133 states and 201186 transitions. [2021-06-05 10:23:39,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-06-05 10:23:39,742 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.608695652173913) internal successors, (175), 23 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-06-05 10:23:39,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:23:39,839 INFO L225 Difference]: With dead ends: 70133 [2021-06-05 10:23:39,839 INFO L226 Difference]: Without dead ends: 69767 [2021-06-05 10:23:39,840 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2059 ImplicationChecksByTransitivity, 1432.8ms TimeCoverageRelationStatistics Valid=1394, Invalid=5916, Unknown=0, NotChecked=0, Total=7310 [2021-06-05 10:23:39,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69767 states. [2021-06-05 10:23:40,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69767 to 34242. [2021-06-05 10:23:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34242 states, 34240 states have (on average 2.882126168224299) internal successors, (98684), 34241 states have internal predecessors, (98684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34242 states to 34242 states and 98684 transitions. [2021-06-05 10:23:40,801 INFO L78 Accepts]: Start accepts. Automaton has 34242 states and 98684 transitions. Word has length 107 [2021-06-05 10:23:40,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:23:40,801 INFO L482 AbstractCegarLoop]: Abstraction has 34242 states and 98684 transitions. [2021-06-05 10:23:40,801 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 7.608695652173913) internal successors, (175), 23 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand 34242 states and 98684 transitions. [2021-06-05 10:23:40,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 10:23:40,834 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:23:40,834 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:23:41,035 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable82 [2021-06-05 10:23:41,035 INFO L430 AbstractCegarLoop]: === Iteration 53 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:23:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:23:41,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2130819747, now seen corresponding path program 7 times [2021-06-05 10:23:41,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:23:41,036 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624903461] [2021-06-05 10:23:41,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:23:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:23:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 10:23:41,239 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:23:41,239 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624903461] [2021-06-05 10:23:41,239 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624903461] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:41,239 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453868021] [2021-06-05 10:23:41,239 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:23:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:23:41,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 22 conjunts are in the unsatisfiable core [2021-06-05 10:23:41,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:23:41,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:23:41,320 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:41,321 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:41,321 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:41,321 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:23:41,335 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:23:41,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:23:41,336 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:41,337 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:41,337 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:41,337 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:23:41,468 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:23:41,469 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:41,473 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:41,474 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:41,474 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:23:41,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2021-06-05 10:23:41,495 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:23:41,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-06-05 10:23:41,496 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:41,502 INFO L628 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2021-06-05 10:23:41,502 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:41,506 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:41,507 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:41,507 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:32 [2021-06-05 10:23:41,533 INFO L354 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2021-06-05 10:23:41,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2021-06-05 10:23:41,535 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:41,539 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:41,540 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:41,540 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2021-06-05 10:23:41,572 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:23:41,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:23:41,573 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:41,579 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:41,579 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:41,580 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:28 [2021-06-05 10:23:41,652 INFO L354 Elim1Store]: treesize reduction 76, result has 31.5 percent of original size [2021-06-05 10:23:41,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2021-06-05 10:23:41,653 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:41,660 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:41,670 INFO L550 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. [2021-06-05 10:23:41,670 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:52 [2021-06-05 10:23:41,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:23:41,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:23:41,745 INFO L354 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2021-06-05 10:23:41,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2021-06-05 10:23:41,746 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:41,749 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:23:41,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:23:41,750 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:41,762 INFO L628 ElimStorePlain]: treesize reduction 8, result has 75.0 percent of original size [2021-06-05 10:23:41,763 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:41,764 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:95, output treesize:3 [2021-06-05 10:23:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 10:23:41,789 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453868021] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:41,789 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:23:41,789 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 31 [2021-06-05 10:23:41,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787349631] [2021-06-05 10:23:41,790 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 10:23:41,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:23:41,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 10:23:41,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2021-06-05 10:23:41,790 INFO L87 Difference]: Start difference. First operand 34242 states and 98684 transitions. Second operand has 31 states, 31 states have (on average 5.580645161290323) internal successors, (173), 31 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:23:47,478 INFO L93 Difference]: Finished difference Result 221526 states and 635044 transitions. [2021-06-05 10:23:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2021-06-05 10:23:47,478 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.580645161290323) internal successors, (173), 31 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-05 10:23:47,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:23:47,846 INFO L225 Difference]: With dead ends: 221526 [2021-06-05 10:23:47,846 INFO L226 Difference]: Without dead ends: 221310 [2021-06-05 10:23:47,848 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11600 ImplicationChecksByTransitivity, 3073.0ms TimeCoverageRelationStatistics Valid=3941, Invalid=27565, Unknown=0, NotChecked=0, Total=31506 [2021-06-05 10:23:48,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221310 states. [2021-06-05 10:23:50,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221310 to 36837. [2021-06-05 10:23:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36837 states, 36835 states have (on average 2.886303787158952) internal successors, (106317), 36836 states have internal predecessors, (106317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36837 states to 36837 states and 106317 transitions. [2021-06-05 10:23:50,355 INFO L78 Accepts]: Start accepts. Automaton has 36837 states and 106317 transitions. Word has length 109 [2021-06-05 10:23:50,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:23:50,355 INFO L482 AbstractCegarLoop]: Abstraction has 36837 states and 106317 transitions. [2021-06-05 10:23:50,355 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 5.580645161290323) internal successors, (173), 31 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 36837 states and 106317 transitions. [2021-06-05 10:23:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 10:23:50,388 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:23:50,388 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:23:50,593 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:23:50,593 INFO L430 AbstractCegarLoop]: === Iteration 54 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:23:50,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:23:50,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2013690589, now seen corresponding path program 8 times [2021-06-05 10:23:50,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:23:50,593 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632650421] [2021-06-05 10:23:50,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:23:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:23:50,817 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 10:23:50,817 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:23:50,817 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632650421] [2021-06-05 10:23:50,817 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632650421] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:50,817 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954869817] [2021-06-05 10:23:50,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:23:50,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 10:23:50,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:23:50,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 10:23:50,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:23:51,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:23:51,015 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:51,018 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:51,018 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:51,019 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-06-05 10:23:51,052 INFO L354 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2021-06-05 10:23:51,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 38 [2021-06-05 10:23:51,053 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:51,059 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:51,060 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:51,060 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:39 [2021-06-05 10:23:51,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 27 treesize of output 15 [2021-06-05 10:23:51,099 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:51,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:23:51,103 INFO L354 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2021-06-05 10:23:51,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 1 [2021-06-05 10:23:51,104 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:51,107 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:51,108 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:51,108 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:20 [2021-06-05 10:23:51,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:23:51,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:23:51,124 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:51,129 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:51,130 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:51,130 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:15 [2021-06-05 10:23:51,161 INFO L354 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2021-06-05 10:23:51,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 38 [2021-06-05 10:23:51,165 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:51,170 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:51,171 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:51,171 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:34 [2021-06-05 10:23:51,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 27 treesize of output 15 [2021-06-05 10:23:51,217 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:51,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:23:51,223 INFO L354 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2021-06-05 10:23:51,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 1 [2021-06-05 10:23:51,224 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:51,226 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:51,227 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:51,227 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:15 [2021-06-05 10:23:51,266 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:23:51,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:23:51,268 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:51,271 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:51,272 INFO L550 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. [2021-06-05 10:23:51,272 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2021-06-05 10:23:51,308 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:23:51,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:23:51,309 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:51,311 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:51,312 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:51,312 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2021-06-05 10:23:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-05 10:23:51,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954869817] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:51,344 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:23:51,344 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 32 [2021-06-05 10:23:51,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289508225] [2021-06-05 10:23:51,344 INFO L462 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-06-05 10:23:51,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:23:51,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-06-05 10:23:51,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992 [2021-06-05 10:23:51,345 INFO L87 Difference]: Start difference. First operand 36837 states and 106317 transitions. Second operand has 32 states, 32 states have (on average 5.75) internal successors, (184), 32 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:56,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:23:56,608 INFO L93 Difference]: Finished difference Result 91301 states and 262320 transitions. [2021-06-05 10:23:56,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2021-06-05 10:23:56,608 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.75) internal successors, (184), 32 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-05 10:23:56,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:23:56,673 INFO L225 Difference]: With dead ends: 91301 [2021-06-05 10:23:56,674 INFO L226 Difference]: Without dead ends: 48285 [2021-06-05 10:23:56,675 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6142 ImplicationChecksByTransitivity, 3751.1ms TimeCoverageRelationStatistics Valid=3085, Invalid=16937, Unknown=0, NotChecked=0, Total=20022 [2021-06-05 10:23:56,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48285 states. [2021-06-05 10:23:57,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48285 to 23769. [2021-06-05 10:23:57,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23769 states, 23767 states have (on average 2.880927336222493) internal successors, (68471), 23768 states have internal predecessors, (68471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:57,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23769 states to 23769 states and 68471 transitions. [2021-06-05 10:23:57,264 INFO L78 Accepts]: Start accepts. Automaton has 23769 states and 68471 transitions. Word has length 109 [2021-06-05 10:23:57,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:23:57,264 INFO L482 AbstractCegarLoop]: Abstraction has 23769 states and 68471 transitions. [2021-06-05 10:23:57,264 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 5.75) internal successors, (184), 32 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:23:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand 23769 states and 68471 transitions. [2021-06-05 10:23:57,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 10:23:57,283 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:23:57,284 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:23:57,496 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2021-06-05 10:23:57,497 INFO L430 AbstractCegarLoop]: === Iteration 55 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:23:57,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:23:57,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2035419287, now seen corresponding path program 3 times [2021-06-05 10:23:57,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:23:57,497 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981750738] [2021-06-05 10:23:57,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:23:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:23:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:23:57,673 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:23:57,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981750738] [2021-06-05 10:23:57,673 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981750738] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:57,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658431730] [2021-06-05 10:23:57,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:23:57,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 10:23:57,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:23:57,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 17 conjunts are in the unsatisfiable core [2021-06-05 10:23:57,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:23:57,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:23:57,761 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:57,762 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:57,763 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:57,763 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:23:57,776 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:23:57,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:23:57,777 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:57,778 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:57,779 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:57,779 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:23:57,907 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:23:57,908 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:57,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:57,911 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:57,912 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:23:57,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:23:57,938 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:57,942 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:57,943 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:57,943 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2021-06-05 10:23:57,995 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:23:57,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:23:57,996 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:58,000 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:58,001 INFO L550 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. [2021-06-05 10:23:58,001 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:23:58,032 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:23:58,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:23:58,033 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:23:58,035 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:23:58,036 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:23:58,036 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:23:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 10:23:58,065 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658431730] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:23:58,066 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:23:58,066 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 30 [2021-06-05 10:23:58,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210214062] [2021-06-05 10:23:58,066 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 10:23:58,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:23:58,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 10:23:58,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2021-06-05 10:23:58,066 INFO L87 Difference]: Start difference. First operand 23769 states and 68471 transitions. Second operand has 30 states, 30 states have (on average 5.966666666666667) internal successors, (179), 30 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:03,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:24:03,722 INFO L93 Difference]: Finished difference Result 95429 states and 271921 transitions. [2021-06-05 10:24:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2021-06-05 10:24:03,723 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.966666666666667) internal successors, (179), 30 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-05 10:24:03,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:24:03,933 INFO L225 Difference]: With dead ends: 95429 [2021-06-05 10:24:03,933 INFO L226 Difference]: Without dead ends: 95117 [2021-06-05 10:24:03,934 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10291 ImplicationChecksByTransitivity, 4301.2ms TimeCoverageRelationStatistics Valid=4910, Invalid=23482, Unknown=0, NotChecked=0, Total=28392 [2021-06-05 10:24:04,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95117 states. [2021-06-05 10:24:04,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95117 to 34323. [2021-06-05 10:24:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34323 states, 34321 states have (on average 2.8954575915620175) internal successors, (99375), 34322 states have internal predecessors, (99375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34323 states to 34323 states and 99375 transitions. [2021-06-05 10:24:04,848 INFO L78 Accepts]: Start accepts. Automaton has 34323 states and 99375 transitions. Word has length 109 [2021-06-05 10:24:04,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:24:04,848 INFO L482 AbstractCegarLoop]: Abstraction has 34323 states and 99375 transitions. [2021-06-05 10:24:04,848 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.966666666666667) internal successors, (179), 30 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 34323 states and 99375 transitions. [2021-06-05 10:24:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 10:24:04,871 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:24:04,871 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:24:05,071 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:24:05,072 INFO L430 AbstractCegarLoop]: === Iteration 56 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:24:05,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:24:05,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2055416407, now seen corresponding path program 4 times [2021-06-05 10:24:05,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:24:05,073 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128699721] [2021-06-05 10:24:05,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:24:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:24:05,281 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 10:24:05,281 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:24:05,281 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128699721] [2021-06-05 10:24:05,281 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128699721] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:05,281 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905071228] [2021-06-05 10:24:05,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:24:05,486 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 10:24:05,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:24:05,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 10:24:05,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:24:05,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:24:05,504 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:05,505 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:05,506 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:05,506 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:24:05,519 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:24:05,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:24:05,521 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:05,521 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:05,522 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:05,522 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:24:05,677 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:24:05,678 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:05,681 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:05,682 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:05,682 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:24:05,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2021-06-05 10:24:05,706 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:24:05,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-06-05 10:24:05,707 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:05,713 INFO L628 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2021-06-05 10:24:05,713 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:05,718 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:05,719 INFO L550 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. [2021-06-05 10:24:05,719 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 [2021-06-05 10:24:05,753 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:05,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:24:05,755 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:05,760 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:05,761 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:24:05,761 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2021-06-05 10:24:05,789 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:05,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:24:05,790 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:05,793 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:05,793 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:05,794 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:24:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 10:24:05,819 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905071228] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:05,820 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:24:05,820 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 28 [2021-06-05 10:24:05,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684114973] [2021-06-05 10:24:05,820 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 10:24:05,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:24:05,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 10:24:05,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2021-06-05 10:24:05,820 INFO L87 Difference]: Start difference. First operand 34323 states and 99375 transitions. Second operand has 28 states, 28 states have (on average 6.142857142857143) internal successors, (172), 28 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:24:08,495 INFO L93 Difference]: Finished difference Result 49663 states and 143476 transitions. [2021-06-05 10:24:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-06-05 10:24:08,496 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.142857142857143) internal successors, (172), 28 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-05 10:24:08,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:24:08,570 INFO L225 Difference]: With dead ends: 49663 [2021-06-05 10:24:08,570 INFO L226 Difference]: Without dead ends: 49615 [2021-06-05 10:24:08,571 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2715 ImplicationChecksByTransitivity, 1759.2ms TimeCoverageRelationStatistics Valid=1646, Invalid=7284, Unknown=0, NotChecked=0, Total=8930 [2021-06-05 10:24:08,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49615 states. [2021-06-05 10:24:09,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49615 to 31649. [2021-06-05 10:24:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31649 states, 31647 states have (on average 2.893196827503397) internal successors, (91561), 31648 states have internal predecessors, (91561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31649 states to 31649 states and 91561 transitions. [2021-06-05 10:24:09,219 INFO L78 Accepts]: Start accepts. Automaton has 31649 states and 91561 transitions. Word has length 109 [2021-06-05 10:24:09,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:24:09,220 INFO L482 AbstractCegarLoop]: Abstraction has 31649 states and 91561 transitions. [2021-06-05 10:24:09,220 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 6.142857142857143) internal successors, (172), 28 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 31649 states and 91561 transitions. [2021-06-05 10:24:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 10:24:09,241 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:24:09,241 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:24:09,442 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2021-06-05 10:24:09,442 INFO L430 AbstractCegarLoop]: === Iteration 57 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:24:09,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:24:09,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1971394597, now seen corresponding path program 8 times [2021-06-05 10:24:09,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:24:09,442 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184024082] [2021-06-05 10:24:09,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:24:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:24:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:24:09,595 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:24:09,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184024082] [2021-06-05 10:24:09,596 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184024082] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:09,596 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480371227] [2021-06-05 10:24:09,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:24:09,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 10:24:09,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:24:09,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 10:24:09,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:24:09,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:24:09,672 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:09,673 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:09,673 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:09,673 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:24:09,687 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:24:09,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:24:09,688 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:09,689 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:09,689 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:09,689 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:24:09,862 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:24:09,862 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:09,866 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:09,866 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:09,866 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:24:09,892 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:24:09,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:24:09,893 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:09,898 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:09,899 INFO L550 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. [2021-06-05 10:24:09,899 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2021-06-05 10:24:09,932 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:09,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:24:09,934 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:09,940 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:09,941 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:24:09,941 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2021-06-05 10:24:09,969 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:09,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:24:09,970 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:09,973 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:09,973 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:09,973 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:24:10,000 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 54 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:24:10,000 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480371227] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:10,000 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:24:10,000 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 31 [2021-06-05 10:24:10,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715224397] [2021-06-05 10:24:10,000 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 10:24:10,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:24:10,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 10:24:10,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2021-06-05 10:24:10,001 INFO L87 Difference]: Start difference. First operand 31649 states and 91561 transitions. Second operand has 31 states, 31 states have (on average 5.483870967741935) internal successors, (170), 31 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:12,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:24:12,980 INFO L93 Difference]: Finished difference Result 62077 states and 179361 transitions. [2021-06-05 10:24:12,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-06-05 10:24:12,980 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.483870967741935) internal successors, (170), 31 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-05 10:24:12,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:24:13,059 INFO L225 Difference]: With dead ends: 62077 [2021-06-05 10:24:13,060 INFO L226 Difference]: Without dead ends: 61597 [2021-06-05 10:24:13,060 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3982 ImplicationChecksByTransitivity, 2048.8ms TimeCoverageRelationStatistics Valid=2316, Invalid=10116, Unknown=0, NotChecked=0, Total=12432 [2021-06-05 10:24:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61597 states. [2021-06-05 10:24:13,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61597 to 39927. [2021-06-05 10:24:13,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39927 states, 39925 states have (on average 2.902692548528491) internal successors, (115890), 39926 states have internal predecessors, (115890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39927 states to 39927 states and 115890 transitions. [2021-06-05 10:24:13,787 INFO L78 Accepts]: Start accepts. Automaton has 39927 states and 115890 transitions. Word has length 109 [2021-06-05 10:24:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:24:13,787 INFO L482 AbstractCegarLoop]: Abstraction has 39927 states and 115890 transitions. [2021-06-05 10:24:13,787 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 5.483870967741935) internal successors, (170), 31 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 39927 states and 115890 transitions. [2021-06-05 10:24:13,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 10:24:13,815 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:24:13,815 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:24:14,015 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2021-06-05 10:24:14,016 INFO L430 AbstractCegarLoop]: === Iteration 58 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:24:14,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:24:14,016 INFO L82 PathProgramCache]: Analyzing trace with hash 987950153, now seen corresponding path program 5 times [2021-06-05 10:24:14,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:24:14,016 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153711365] [2021-06-05 10:24:14,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:24:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:24:14,161 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 10:24:14,161 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:24:14,161 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153711365] [2021-06-05 10:24:14,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153711365] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:14,161 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749890078] [2021-06-05 10:24:14,161 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:24:14,224 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 10:24:14,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:24:14,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 10:24:14,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:24:14,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:24:14,244 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:14,245 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:14,245 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:14,245 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:24:14,259 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:24:14,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:24:14,260 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:14,261 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:14,261 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:14,261 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:24:14,393 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:24:14,394 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:14,397 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:14,397 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:14,397 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:24:14,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2021-06-05 10:24:14,420 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:24:14,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-06-05 10:24:14,422 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:14,427 INFO L628 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2021-06-05 10:24:14,427 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:14,432 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:14,433 INFO L550 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. [2021-06-05 10:24:14,433 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 [2021-06-05 10:24:14,467 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:14,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:24:14,468 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:14,473 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:14,475 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:24:14,475 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2021-06-05 10:24:14,502 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:14,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:24:14,503 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:14,505 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:14,506 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:14,506 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:24:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 10:24:14,531 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749890078] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:14,532 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:24:14,532 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 27 [2021-06-05 10:24:14,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611240082] [2021-06-05 10:24:14,532 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 10:24:14,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:24:14,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 10:24:14,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2021-06-05 10:24:14,532 INFO L87 Difference]: Start difference. First operand 39927 states and 115890 transitions. Second operand has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 27 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:16,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:24:16,948 INFO L93 Difference]: Finished difference Result 74777 states and 216302 transitions. [2021-06-05 10:24:16,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-06-05 10:24:16,949 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 27 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-05 10:24:16,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:24:17,055 INFO L225 Difference]: With dead ends: 74777 [2021-06-05 10:24:17,056 INFO L226 Difference]: Without dead ends: 74753 [2021-06-05 10:24:17,057 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3119 ImplicationChecksByTransitivity, 1674.9ms TimeCoverageRelationStatistics Valid=1746, Invalid=7956, Unknown=0, NotChecked=0, Total=9702 [2021-06-05 10:24:17,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74753 states. [2021-06-05 10:24:17,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74753 to 38583. [2021-06-05 10:24:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38583 states, 38581 states have (on average 2.9011171301936187) internal successors, (111928), 38582 states have internal predecessors, (111928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38583 states to 38583 states and 111928 transitions. [2021-06-05 10:24:18,018 INFO L78 Accepts]: Start accepts. Automaton has 38583 states and 111928 transitions. Word has length 109 [2021-06-05 10:24:18,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:24:18,018 INFO L482 AbstractCegarLoop]: Abstraction has 38583 states and 111928 transitions. [2021-06-05 10:24:18,018 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 27 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 38583 states and 111928 transitions. [2021-06-05 10:24:18,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 10:24:18,041 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:24:18,041 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:24:18,241 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:24:18,241 INFO L430 AbstractCegarLoop]: === Iteration 59 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:24:18,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:24:18,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1449281159, now seen corresponding path program 4 times [2021-06-05 10:24:18,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:24:18,242 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915596006] [2021-06-05 10:24:18,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:24:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:24:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 10:24:18,381 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:24:18,382 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915596006] [2021-06-05 10:24:18,382 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915596006] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:18,382 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888983877] [2021-06-05 10:24:18,382 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:24:18,437 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 10:24:18,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:24:18,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 10:24:18,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:24:18,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:24:18,458 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:18,459 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:18,459 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:18,459 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:24:18,473 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:24:18,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:24:18,474 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:18,475 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:18,475 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:18,475 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:24:18,631 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:24:18,632 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:18,635 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:18,635 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:18,635 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:24:18,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2021-06-05 10:24:18,656 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:24:18,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-06-05 10:24:18,658 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:18,663 INFO L628 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2021-06-05 10:24:18,664 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:18,668 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:18,669 INFO L550 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. [2021-06-05 10:24:18,669 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 [2021-06-05 10:24:18,702 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:18,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:24:18,703 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:18,708 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:18,709 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:24:18,710 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2021-06-05 10:24:18,746 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:18,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:24:18,747 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:18,749 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:18,750 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:18,750 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:24:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 10:24:18,776 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888983877] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:18,776 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:24:18,776 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 27 [2021-06-05 10:24:18,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025056431] [2021-06-05 10:24:18,776 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 10:24:18,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:24:18,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 10:24:18,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2021-06-05 10:24:18,777 INFO L87 Difference]: Start difference. First operand 38583 states and 111928 transitions. Second operand has 27 states, 27 states have (on average 5.888888888888889) internal successors, (159), 27 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:24:20,910 INFO L93 Difference]: Finished difference Result 85025 states and 245314 transitions. [2021-06-05 10:24:20,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-06-05 10:24:20,910 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.888888888888889) internal successors, (159), 27 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-05 10:24:20,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:24:21,028 INFO L225 Difference]: With dead ends: 85025 [2021-06-05 10:24:21,028 INFO L226 Difference]: Without dead ends: 84953 [2021-06-05 10:24:21,029 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2206 ImplicationChecksByTransitivity, 1399.7ms TimeCoverageRelationStatistics Valid=1288, Invalid=6022, Unknown=0, NotChecked=0, Total=7310 [2021-06-05 10:24:21,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84953 states. [2021-06-05 10:24:21,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84953 to 38001. [2021-06-05 10:24:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38001 states, 37999 states have (on average 2.9006552804021157) internal successors, (110222), 38000 states have internal predecessors, (110222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:22,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38001 states to 38001 states and 110222 transitions. [2021-06-05 10:24:22,120 INFO L78 Accepts]: Start accepts. Automaton has 38001 states and 110222 transitions. Word has length 109 [2021-06-05 10:24:22,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:24:22,120 INFO L482 AbstractCegarLoop]: Abstraction has 38001 states and 110222 transitions. [2021-06-05 10:24:22,121 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 5.888888888888889) internal successors, (159), 27 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:22,121 INFO L276 IsEmpty]: Start isEmpty. Operand 38001 states and 110222 transitions. [2021-06-05 10:24:22,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 10:24:22,142 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:24:22,142 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:24:22,342 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2021-06-05 10:24:22,342 INFO L430 AbstractCegarLoop]: === Iteration 60 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:24:22,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:24:22,343 INFO L82 PathProgramCache]: Analyzing trace with hash 961988055, now seen corresponding path program 9 times [2021-06-05 10:24:22,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:24:22,343 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404354095] [2021-06-05 10:24:22,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:24:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:24:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:24:22,487 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:24:22,487 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404354095] [2021-06-05 10:24:22,487 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404354095] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:22,487 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923628596] [2021-06-05 10:24:22,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:24:22,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 10:24:22,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:24:22,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 10:24:22,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:24:22,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:24:22,805 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:22,808 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:22,809 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:22,809 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2021-06-05 10:24:22,839 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:24:22,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:24:22,840 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:22,845 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:22,846 INFO L550 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. [2021-06-05 10:24:22,846 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2021-06-05 10:24:22,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:24:22,886 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:22,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:24:22,887 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:22,892 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:22,893 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:24:22,893 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:28 [2021-06-05 10:24:22,926 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:22,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:24:22,927 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:22,930 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:22,930 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:22,930 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:24:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 54 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:24:22,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923628596] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:22,962 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:24:22,963 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2021-06-05 10:24:22,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041519484] [2021-06-05 10:24:22,963 INFO L462 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-06-05 10:24:22,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:24:22,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-06-05 10:24:22,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:24:22,963 INFO L87 Difference]: Start difference. First operand 38001 states and 110222 transitions. Second operand has 34 states, 34 states have (on average 5.617647058823529) internal successors, (191), 34 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:24:27,101 INFO L93 Difference]: Finished difference Result 69551 states and 201353 transitions. [2021-06-05 10:24:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-06-05 10:24:27,102 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.617647058823529) internal successors, (191), 34 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-05 10:24:27,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:24:27,203 INFO L225 Difference]: With dead ends: 69551 [2021-06-05 10:24:27,204 INFO L226 Difference]: Without dead ends: 69167 [2021-06-05 10:24:27,204 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5212 ImplicationChecksByTransitivity, 3057.5ms TimeCoverageRelationStatistics Valid=2851, Invalid=12899, Unknown=0, NotChecked=0, Total=15750 [2021-06-05 10:24:27,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69167 states. [2021-06-05 10:24:27,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69167 to 44507. [2021-06-05 10:24:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44507 states, 44505 states have (on average 2.906257723851253) internal successors, (129343), 44506 states have internal predecessors, (129343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44507 states to 44507 states and 129343 transitions. [2021-06-05 10:24:28,216 INFO L78 Accepts]: Start accepts. Automaton has 44507 states and 129343 transitions. Word has length 109 [2021-06-05 10:24:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:24:28,217 INFO L482 AbstractCegarLoop]: Abstraction has 44507 states and 129343 transitions. [2021-06-05 10:24:28,217 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 5.617647058823529) internal successors, (191), 34 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 44507 states and 129343 transitions. [2021-06-05 10:24:28,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 10:24:28,244 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:24:28,244 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:24:28,460 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106 [2021-06-05 10:24:28,460 INFO L430 AbstractCegarLoop]: === Iteration 61 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:24:28,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:24:28,460 INFO L82 PathProgramCache]: Analyzing trace with hash 808482491, now seen corresponding path program 10 times [2021-06-05 10:24:28,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:24:28,461 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243898974] [2021-06-05 10:24:28,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:24:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:24:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:24:28,607 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:24:28,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243898974] [2021-06-05 10:24:28,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243898974] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:28,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146567046] [2021-06-05 10:24:28,608 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:24:28,670 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 10:24:28,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:24:28,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 10:24:28,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:24:28,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:24:28,687 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:28,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:28,688 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:28,688 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:24:28,701 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:24:28,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:24:28,702 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:28,703 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:28,703 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:28,703 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:24:28,834 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:24:28,834 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:28,838 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:28,838 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:28,838 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:24:28,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2021-06-05 10:24:28,864 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:24:28,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-06-05 10:24:28,865 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:28,871 INFO L628 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2021-06-05 10:24:28,871 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:28,876 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:28,877 INFO L550 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. [2021-06-05 10:24:28,877 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 [2021-06-05 10:24:28,920 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:28,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:24:28,921 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:28,926 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:28,928 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:24:28,928 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2021-06-05 10:24:28,957 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:28,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:24:28,958 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:28,960 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:28,961 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:28,961 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:24:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 54 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:24:28,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146567046] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:28,987 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:24:28,987 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 28 [2021-06-05 10:24:28,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238007970] [2021-06-05 10:24:28,987 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 10:24:28,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:24:28,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 10:24:28,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2021-06-05 10:24:28,988 INFO L87 Difference]: Start difference. First operand 44507 states and 129343 transitions. Second operand has 28 states, 28 states have (on average 5.75) internal successors, (161), 28 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:24:31,551 INFO L93 Difference]: Finished difference Result 90347 states and 261400 transitions. [2021-06-05 10:24:31,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-06-05 10:24:31,552 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.75) internal successors, (161), 28 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-05 10:24:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:24:31,684 INFO L225 Difference]: With dead ends: 90347 [2021-06-05 10:24:31,685 INFO L226 Difference]: Without dead ends: 90323 [2021-06-05 10:24:31,685 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3387 ImplicationChecksByTransitivity, 1761.1ms TimeCoverageRelationStatistics Valid=1927, Invalid=8785, Unknown=0, NotChecked=0, Total=10712 [2021-06-05 10:24:31,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90323 states. [2021-06-05 10:24:32,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90323 to 44347. [2021-06-05 10:24:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44347 states, 44345 states have (on average 2.906911714962228) internal successors, (128907), 44346 states have internal predecessors, (128907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44347 states to 44347 states and 128907 transitions. [2021-06-05 10:24:32,778 INFO L78 Accepts]: Start accepts. Automaton has 44347 states and 128907 transitions. Word has length 109 [2021-06-05 10:24:32,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:24:32,778 INFO L482 AbstractCegarLoop]: Abstraction has 44347 states and 128907 transitions. [2021-06-05 10:24:32,778 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 5.75) internal successors, (161), 28 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 44347 states and 128907 transitions. [2021-06-05 10:24:32,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 10:24:32,807 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:24:32,808 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:24:33,008 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2021-06-05 10:24:33,009 INFO L430 AbstractCegarLoop]: === Iteration 62 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:24:33,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:24:33,009 INFO L82 PathProgramCache]: Analyzing trace with hash -209941637, now seen corresponding path program 9 times [2021-06-05 10:24:33,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:24:33,009 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260369745] [2021-06-05 10:24:33,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:24:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:24:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:24:33,175 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:24:33,175 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260369745] [2021-06-05 10:24:33,175 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260369745] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:33,175 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230855190] [2021-06-05 10:24:33,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:24:33,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 10:24:33,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:24:33,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 10:24:33,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:24:33,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:24:33,245 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:33,246 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:33,246 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:33,247 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:24:33,261 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:24:33,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:24:33,262 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:33,263 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:33,263 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:33,264 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:24:33,394 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:24:33,395 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:33,398 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:33,399 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:33,399 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2021-06-05 10:24:33,425 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:24:33,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:24:33,426 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:33,431 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:33,432 INFO L550 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. [2021-06-05 10:24:33,432 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2021-06-05 10:24:33,466 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:33,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:24:33,467 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:33,472 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:33,473 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:24:33,473 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:26 [2021-06-05 10:24:33,502 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:33,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:24:33,503 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:33,505 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:33,506 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:33,506 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2021-06-05 10:24:33,537 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-06-05 10:24:33,537 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230855190] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:33,537 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:24:33,537 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 29 [2021-06-05 10:24:33,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633869751] [2021-06-05 10:24:33,538 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 10:24:33,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:24:33,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 10:24:33,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2021-06-05 10:24:33,538 INFO L87 Difference]: Start difference. First operand 44347 states and 128907 transitions. Second operand has 29 states, 29 states have (on average 5.827586206896552) internal successors, (169), 29 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:24:36,117 INFO L93 Difference]: Finished difference Result 114743 states and 331371 transitions. [2021-06-05 10:24:36,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-06-05 10:24:36,118 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.827586206896552) internal successors, (169), 29 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-05 10:24:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:24:36,286 INFO L225 Difference]: With dead ends: 114743 [2021-06-05 10:24:36,286 INFO L226 Difference]: Without dead ends: 114347 [2021-06-05 10:24:36,286 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3125 ImplicationChecksByTransitivity, 1686.5ms TimeCoverageRelationStatistics Valid=1625, Invalid=8475, Unknown=0, NotChecked=0, Total=10100 [2021-06-05 10:24:36,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114347 states. [2021-06-05 10:24:37,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114347 to 44531. [2021-06-05 10:24:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44531 states, 44529 states have (on average 2.906959509533113) internal successors, (129444), 44530 states have internal predecessors, (129444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44531 states to 44531 states and 129444 transitions. [2021-06-05 10:24:37,464 INFO L78 Accepts]: Start accepts. Automaton has 44531 states and 129444 transitions. Word has length 109 [2021-06-05 10:24:37,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:24:37,464 INFO L482 AbstractCegarLoop]: Abstraction has 44531 states and 129444 transitions. [2021-06-05 10:24:37,464 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 5.827586206896552) internal successors, (169), 29 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 44531 states and 129444 transitions. [2021-06-05 10:24:37,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-06-05 10:24:37,492 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:24:37,493 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:24:37,708 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,55 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:24:37,708 INFO L430 AbstractCegarLoop]: === Iteration 63 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:24:37,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:24:37,709 INFO L82 PathProgramCache]: Analyzing trace with hash -138912231, now seen corresponding path program 10 times [2021-06-05 10:24:37,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:24:37,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128403824] [2021-06-05 10:24:37,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:24:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:24:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:24:37,989 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:24:37,989 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128403824] [2021-06-05 10:24:37,989 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128403824] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:37,989 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721413430] [2021-06-05 10:24:37,989 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:24:38,044 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 10:24:38,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:24:38,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 24 conjunts are in the unsatisfiable core [2021-06-05 10:24:38,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:24:38,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:24:38,064 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:38,065 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:38,065 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:38,065 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:24:38,083 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:24:38,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:24:38,084 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:38,085 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:38,085 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:38,085 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:24:38,202 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:24:38,202 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:38,409 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-06-05 10:24:38,409 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:38,409 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:38,410 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:24:38,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2021-06-05 10:24:38,431 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:24:38,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-06-05 10:24:38,433 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:38,440 INFO L628 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2021-06-05 10:24:38,440 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:38,445 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:38,445 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:38,445 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:32 [2021-06-05 10:24:38,471 INFO L354 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2021-06-05 10:24:38,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2021-06-05 10:24:38,472 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:38,477 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:38,477 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:38,477 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2021-06-05 10:24:38,505 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:38,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:24:38,506 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:38,511 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:38,512 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:38,512 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:28 [2021-06-05 10:24:38,596 INFO L354 Elim1Store]: treesize reduction 76, result has 31.5 percent of original size [2021-06-05 10:24:38,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2021-06-05 10:24:38,597 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:38,605 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:38,608 INFO L550 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. [2021-06-05 10:24:38,608 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:52 [2021-06-05 10:24:38,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:24:38,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2021-06-05 10:24:38,662 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:38,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:24:38,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:24:38,673 INFO L354 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2021-06-05 10:24:38,674 INFO L388 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 2 case distinctions, treesize of input 49 treesize of output 43 [2021-06-05 10:24:38,675 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:38,687 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:38,689 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 10:24:38,689 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:73 [2021-06-05 10:24:38,832 INFO L354 Elim1Store]: treesize reduction 132, result has 30.5 percent of original size [2021-06-05 10:24:38,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 78 [2021-06-05 10:24:38,834 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:38,848 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:38,883 INFO L550 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. [2021-06-05 10:24:38,883 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:76 [2021-06-05 10:24:39,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:24:39,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:24:39,044 INFO L354 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2021-06-05 10:24:39,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2021-06-05 10:24:39,045 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:39,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:24:39,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:24:39,055 INFO L354 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2021-06-05 10:24:39,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2021-06-05 10:24:39,057 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:39,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:24:39,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:24:39,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:24:39,072 INFO L354 Elim1Store]: treesize reduction 37, result has 24.5 percent of original size [2021-06-05 10:24:39,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 28 [2021-06-05 10:24:39,074 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:39,078 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:39,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:24:39,079 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:39,106 INFO L628 ElimStorePlain]: treesize reduction 43, result has 50.0 percent of original size [2021-06-05 10:24:39,108 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:39,108 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:226, output treesize:3 [2021-06-05 10:24:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:24:39,136 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721413430] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:39,136 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:24:39,136 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 34 [2021-06-05 10:24:39,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658386452] [2021-06-05 10:24:39,136 INFO L462 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-06-05 10:24:39,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:24:39,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-06-05 10:24:39,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=980, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:24:39,137 INFO L87 Difference]: Start difference. First operand 44531 states and 129444 transitions. Second operand has 34 states, 34 states have (on average 5.323529411764706) internal successors, (181), 34 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:42,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:24:42,669 INFO L93 Difference]: Finished difference Result 124523 states and 359506 transitions. [2021-06-05 10:24:42,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2021-06-05 10:24:42,669 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.323529411764706) internal successors, (181), 34 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-06-05 10:24:42,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:24:42,861 INFO L225 Difference]: With dead ends: 124523 [2021-06-05 10:24:42,862 INFO L226 Difference]: Without dead ends: 124451 [2021-06-05 10:24:42,863 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 94 SyntacticMatches, 5 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5652 ImplicationChecksByTransitivity, 2666.3ms TimeCoverageRelationStatistics Valid=2639, Invalid=13873, Unknown=0, NotChecked=0, Total=16512 [2021-06-05 10:24:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124451 states. [2021-06-05 10:24:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124451 to 47321. [2021-06-05 10:24:44,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47321 states, 47319 states have (on average 2.912445317948393) internal successors, (137814), 47320 states have internal predecessors, (137814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:44,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47321 states to 47321 states and 137814 transitions. [2021-06-05 10:24:44,139 INFO L78 Accepts]: Start accepts. Automaton has 47321 states and 137814 transitions. Word has length 109 [2021-06-05 10:24:44,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:24:44,139 INFO L482 AbstractCegarLoop]: Abstraction has 47321 states and 137814 transitions. [2021-06-05 10:24:44,139 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 5.323529411764706) internal successors, (181), 34 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:44,139 INFO L276 IsEmpty]: Start isEmpty. Operand 47321 states and 137814 transitions. [2021-06-05 10:24:44,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-06-05 10:24:44,173 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:24:44,173 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:24:44,388 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:24:44,389 INFO L430 AbstractCegarLoop]: === Iteration 64 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:24:44,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:24:44,389 INFO L82 PathProgramCache]: Analyzing trace with hash -612977590, now seen corresponding path program 5 times [2021-06-05 10:24:44,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:24:44,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085902708] [2021-06-05 10:24:44,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:24:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:24:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:24:44,481 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:24:44,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085902708] [2021-06-05 10:24:44,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085902708] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:44,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689504575] [2021-06-05 10:24:44,482 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:24:44,545 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-06-05 10:24:44,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:24:44,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 10:24:44,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:24:44,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:24:44,675 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:44,677 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:44,677 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:44,677 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:24:44,699 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:24:44,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:24:44,700 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:44,704 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:44,705 INFO L550 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. [2021-06-05 10:24:44,705 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:24:44,730 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:44,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:24:44,731 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:44,733 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:44,734 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:44,734 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:24:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:24:44,757 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689504575] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:44,757 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:24:44,757 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 24 [2021-06-05 10:24:44,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654058494] [2021-06-05 10:24:44,758 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 10:24:44,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:24:44,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 10:24:44,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2021-06-05 10:24:44,758 INFO L87 Difference]: Start difference. First operand 47321 states and 137814 transitions. Second operand has 24 states, 24 states have (on average 7.125) internal successors, (171), 24 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:45,364 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-06-05 10:24:47,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:24:47,879 INFO L93 Difference]: Finished difference Result 100477 states and 287078 transitions. [2021-06-05 10:24:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2021-06-05 10:24:47,879 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.125) internal successors, (171), 24 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2021-06-05 10:24:47,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:24:48,035 INFO L225 Difference]: With dead ends: 100477 [2021-06-05 10:24:48,035 INFO L226 Difference]: Without dead ends: 99733 [2021-06-05 10:24:48,036 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9219 ImplicationChecksByTransitivity, 2245.5ms TimeCoverageRelationStatistics Valid=3853, Invalid=18497, Unknown=0, NotChecked=0, Total=22350 [2021-06-05 10:24:48,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99733 states. [2021-06-05 10:24:49,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99733 to 41963. [2021-06-05 10:24:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41963 states, 41961 states have (on average 2.90748552227068) internal successors, (122001), 41962 states have internal predecessors, (122001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41963 states to 41963 states and 122001 transitions. [2021-06-05 10:24:49,218 INFO L78 Accepts]: Start accepts. Automaton has 41963 states and 122001 transitions. Word has length 113 [2021-06-05 10:24:49,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:24:49,218 INFO L482 AbstractCegarLoop]: Abstraction has 41963 states and 122001 transitions. [2021-06-05 10:24:49,218 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 7.125) internal successors, (171), 24 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 41963 states and 122001 transitions. [2021-06-05 10:24:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-06-05 10:24:49,252 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:24:49,252 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:24:49,452 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160,57 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:24:49,453 INFO L430 AbstractCegarLoop]: === Iteration 65 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:24:49,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:24:49,453 INFO L82 PathProgramCache]: Analyzing trace with hash -29577462, now seen corresponding path program 6 times [2021-06-05 10:24:49,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:24:49,453 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283516221] [2021-06-05 10:24:49,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:24:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:24:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:24:49,555 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:24:49,555 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283516221] [2021-06-05 10:24:49,555 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283516221] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:49,555 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746993085] [2021-06-05 10:24:49,555 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:24:49,617 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 10:24:49,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:24:49,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 11 conjunts are in the unsatisfiable core [2021-06-05 10:24:49,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:24:49,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:24:49,750 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:49,753 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:49,753 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:49,753 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:24:49,777 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:24:49,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:24:49,778 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:49,782 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:49,783 INFO L550 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. [2021-06-05 10:24:49,783 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:24:49,809 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:49,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:24:49,810 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:49,813 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:49,813 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:49,813 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:24:49,837 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-06-05 10:24:49,838 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746993085] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:49,838 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:24:49,838 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 24 [2021-06-05 10:24:49,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283549095] [2021-06-05 10:24:49,838 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 10:24:49,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:24:49,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 10:24:49,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2021-06-05 10:24:49,839 INFO L87 Difference]: Start difference. First operand 41963 states and 122001 transitions. Second operand has 24 states, 24 states have (on average 7.875) internal successors, (189), 24 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:24:54,344 INFO L93 Difference]: Finished difference Result 105579 states and 296014 transitions. [2021-06-05 10:24:54,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2021-06-05 10:24:54,344 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.875) internal successors, (189), 24 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2021-06-05 10:24:54,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:24:54,497 INFO L225 Difference]: With dead ends: 105579 [2021-06-05 10:24:54,498 INFO L226 Difference]: Without dead ends: 104703 [2021-06-05 10:24:54,499 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14381 ImplicationChecksByTransitivity, 3178.5ms TimeCoverageRelationStatistics Valid=5869, Invalid=28541, Unknown=0, NotChecked=0, Total=34410 [2021-06-05 10:24:54,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104703 states. [2021-06-05 10:24:55,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104703 to 32921. [2021-06-05 10:24:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32921 states, 32919 states have (on average 2.931589659467177) internal successors, (96505), 32920 states have internal predecessors, (96505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32921 states to 32921 states and 96505 transitions. [2021-06-05 10:24:55,594 INFO L78 Accepts]: Start accepts. Automaton has 32921 states and 96505 transitions. Word has length 113 [2021-06-05 10:24:55,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:24:55,594 INFO L482 AbstractCegarLoop]: Abstraction has 32921 states and 96505 transitions. [2021-06-05 10:24:55,594 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 7.875) internal successors, (189), 24 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:24:55,594 INFO L276 IsEmpty]: Start isEmpty. Operand 32921 states and 96505 transitions. [2021-06-05 10:24:55,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-06-05 10:24:55,771 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:24:55,772 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:24:55,972 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161,58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:24:55,973 INFO L430 AbstractCegarLoop]: === Iteration 66 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:24:55,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:24:55,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1735706570, now seen corresponding path program 6 times [2021-06-05 10:24:55,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:24:55,973 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70115336] [2021-06-05 10:24:55,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:24:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:24:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:24:56,066 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:24:56,066 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70115336] [2021-06-05 10:24:56,066 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70115336] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:56,066 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479369978] [2021-06-05 10:24:56,066 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:24:56,140 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-05 10:24:56,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:24:56,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 10:24:56,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:24:56,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:24:56,276 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:56,279 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:56,279 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:56,279 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:24:56,304 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:24:56,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:24:56,305 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:56,309 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:56,309 INFO L550 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. [2021-06-05 10:24:56,310 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:24:56,341 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:24:56,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:24:56,342 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:24:56,345 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:24:56,345 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:24:56,345 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:24:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 10:24:56,373 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479369978] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:24:56,373 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:24:56,373 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2021-06-05 10:24:56,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009550529] [2021-06-05 10:24:56,374 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 10:24:56,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:24:56,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 10:24:56,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2021-06-05 10:24:56,374 INFO L87 Difference]: Start difference. First operand 32921 states and 96505 transitions. Second operand has 23 states, 23 states have (on average 7.086956521739131) internal successors, (163), 23 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:25:00,351 INFO L93 Difference]: Finished difference Result 82039 states and 235292 transitions. [2021-06-05 10:25:00,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2021-06-05 10:25:00,351 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.086956521739131) internal successors, (163), 23 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2021-06-05 10:25:00,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:25:00,464 INFO L225 Difference]: With dead ends: 82039 [2021-06-05 10:25:00,465 INFO L226 Difference]: Without dead ends: 81691 [2021-06-05 10:25:00,467 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23506 ImplicationChecksByTransitivity, 2860.9ms TimeCoverageRelationStatistics Valid=6518, Invalid=45694, Unknown=0, NotChecked=0, Total=52212 [2021-06-05 10:25:00,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81691 states. [2021-06-05 10:25:01,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81691 to 36975. [2021-06-05 10:25:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36975 states, 36973 states have (on average 2.9285154031320153) internal successors, (108276), 36974 states have internal predecessors, (108276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36975 states to 36975 states and 108276 transitions. [2021-06-05 10:25:01,361 INFO L78 Accepts]: Start accepts. Automaton has 36975 states and 108276 transitions. Word has length 113 [2021-06-05 10:25:01,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:25:01,361 INFO L482 AbstractCegarLoop]: Abstraction has 36975 states and 108276 transitions. [2021-06-05 10:25:01,361 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 7.086956521739131) internal successors, (163), 23 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 36975 states and 108276 transitions. [2021-06-05 10:25:01,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-06-05 10:25:01,392 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:25:01,392 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:25:01,597 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162,59 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:25:01,597 INFO L430 AbstractCegarLoop]: === Iteration 67 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:25:01,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:25:01,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1041029352, now seen corresponding path program 11 times [2021-06-05 10:25:01,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:25:01,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965475450] [2021-06-05 10:25:01,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:25:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:25:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:25:01,744 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:25:01,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965475450] [2021-06-05 10:25:01,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965475450] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:25:01,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282782590] [2021-06-05 10:25:01,744 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:25:01,812 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-06-05 10:25:01,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:25:01,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 10:25:01,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:25:01,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:25:01,943 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:01,946 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:01,947 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:01,947 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:25:01,971 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:25:01,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:25:01,972 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:02,025 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:02,041 INFO L550 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. [2021-06-05 10:25:02,138 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 10:25:02,166 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:25:02,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:25:02,167 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:02,169 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:02,170 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:02,170 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:25:02,194 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:25:02,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282782590] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:25:02,194 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:25:02,195 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 24 [2021-06-05 10:25:02,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540229516] [2021-06-05 10:25:02,195 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 10:25:02,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:25:02,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 10:25:02,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2021-06-05 10:25:02,195 INFO L87 Difference]: Start difference. First operand 36975 states and 108276 transitions. Second operand has 24 states, 24 states have (on average 7.041666666666667) internal successors, (169), 24 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:07,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:25:07,008 INFO L93 Difference]: Finished difference Result 94121 states and 271155 transitions. [2021-06-05 10:25:07,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2021-06-05 10:25:07,009 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.041666666666667) internal successors, (169), 24 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2021-06-05 10:25:07,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:25:07,147 INFO L225 Difference]: With dead ends: 94121 [2021-06-05 10:25:07,147 INFO L226 Difference]: Without dead ends: 93773 [2021-06-05 10:25:07,149 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32136 ImplicationChecksByTransitivity, 3601.7ms TimeCoverageRelationStatistics Valid=8644, Invalid=61316, Unknown=0, NotChecked=0, Total=69960 [2021-06-05 10:25:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93773 states. [2021-06-05 10:25:08,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93773 to 39327. [2021-06-05 10:25:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39327 states, 39325 states have (on average 2.929307056579784) internal successors, (115195), 39326 states have internal predecessors, (115195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39327 states to 39327 states and 115195 transitions. [2021-06-05 10:25:08,185 INFO L78 Accepts]: Start accepts. Automaton has 39327 states and 115195 transitions. Word has length 113 [2021-06-05 10:25:08,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:25:08,185 INFO L482 AbstractCegarLoop]: Abstraction has 39327 states and 115195 transitions. [2021-06-05 10:25:08,185 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 7.041666666666667) internal successors, (169), 24 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:08,185 INFO L276 IsEmpty]: Start isEmpty. Operand 39327 states and 115195 transitions. [2021-06-05 10:25:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-06-05 10:25:08,216 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:25:08,216 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:25:08,417 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163,60 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:25:08,417 INFO L430 AbstractCegarLoop]: === Iteration 68 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:25:08,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:25:08,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1417370812, now seen corresponding path program 11 times [2021-06-05 10:25:08,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:25:08,417 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492357963] [2021-06-05 10:25:08,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:25:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:25:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:25:08,564 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:25:08,564 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492357963] [2021-06-05 10:25:08,564 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492357963] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:25:08,564 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478215242] [2021-06-05 10:25:08,564 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:25:08,631 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-06-05 10:25:08,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:25:08,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 19 conjunts are in the unsatisfiable core [2021-06-05 10:25:08,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:25:08,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:25:08,739 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:08,742 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:08,742 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:08,742 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 10:25:08,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 34 treesize of output 29 [2021-06-05 10:25:08,759 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:25:08,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-06-05 10:25:08,761 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:08,766 INFO L628 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2021-06-05 10:25:08,767 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:08,770 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:08,770 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:08,770 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:28 [2021-06-05 10:25:08,795 INFO L354 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2021-06-05 10:25:08,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2021-06-05 10:25:08,796 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:08,800 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:08,800 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:08,800 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:28 [2021-06-05 10:25:08,871 INFO L354 Elim1Store]: treesize reduction 76, result has 31.5 percent of original size [2021-06-05 10:25:08,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2021-06-05 10:25:08,872 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:08,880 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:08,886 INFO L550 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. [2021-06-05 10:25:08,886 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:52 [2021-06-05 10:25:08,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:25:08,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:25:08,951 INFO L354 Elim1Store]: treesize reduction 40, result has 37.5 percent of original size [2021-06-05 10:25:08,952 INFO L388 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 2 case distinctions, treesize of input 49 treesize of output 55 [2021-06-05 10:25:08,953 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:08,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:25:08,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2021-06-05 10:25:08,959 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:08,982 INFO L628 ElimStorePlain]: treesize reduction 8, result has 90.1 percent of original size [2021-06-05 10:25:08,983 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 10:25:08,983 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:73 [2021-06-05 10:25:09,134 INFO L354 Elim1Store]: treesize reduction 132, result has 30.5 percent of original size [2021-06-05 10:25:09,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 78 [2021-06-05 10:25:09,136 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:09,150 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:09,190 INFO L550 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. [2021-06-05 10:25:09,190 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:76 [2021-06-05 10:25:09,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:25:09,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:25:09,355 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:09,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:25:09,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:25:09,363 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:25:09,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 13 [2021-06-05 10:25:09,365 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:09,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:25:09,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:25:09,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:25:09,381 INFO L354 Elim1Store]: treesize reduction 37, result has 24.5 percent of original size [2021-06-05 10:25:09,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 28 [2021-06-05 10:25:09,383 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:09,386 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-06-05 10:25:09,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 13 [2021-06-05 10:25:09,388 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:09,411 INFO L628 ElimStorePlain]: treesize reduction 32, result has 54.3 percent of original size [2021-06-05 10:25:09,413 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:09,413 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:226, output treesize:3 [2021-06-05 10:25:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 10:25:09,449 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478215242] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:25:09,449 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:25:09,449 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 28 [2021-06-05 10:25:09,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407659203] [2021-06-05 10:25:09,450 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 10:25:09,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:25:09,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 10:25:09,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2021-06-05 10:25:09,450 INFO L87 Difference]: Start difference. First operand 39327 states and 115195 transitions. Second operand has 28 states, 28 states have (on average 6.464285714285714) internal successors, (181), 28 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:13,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:25:13,279 INFO L93 Difference]: Finished difference Result 110691 states and 321126 transitions. [2021-06-05 10:25:13,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2021-06-05 10:25:13,279 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.464285714285714) internal successors, (181), 28 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2021-06-05 10:25:13,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:25:13,454 INFO L225 Difference]: With dead ends: 110691 [2021-06-05 10:25:13,454 INFO L226 Difference]: Without dead ends: 110379 [2021-06-05 10:25:13,455 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 183 SyntacticMatches, 5 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8954 ImplicationChecksByTransitivity, 2620.0ms TimeCoverageRelationStatistics Valid=3182, Invalid=20074, Unknown=0, NotChecked=0, Total=23256 [2021-06-05 10:25:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110379 states. [2021-06-05 10:25:14,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110379 to 39383. [2021-06-05 10:25:14,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39383 states, 39381 states have (on average 2.9289251161727736) internal successors, (115344), 39382 states have internal predecessors, (115344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39383 states to 39383 states and 115344 transitions. [2021-06-05 10:25:14,797 INFO L78 Accepts]: Start accepts. Automaton has 39383 states and 115344 transitions. Word has length 113 [2021-06-05 10:25:14,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:25:14,797 INFO L482 AbstractCegarLoop]: Abstraction has 39383 states and 115344 transitions. [2021-06-05 10:25:14,797 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 6.464285714285714) internal successors, (181), 28 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 39383 states and 115344 transitions. [2021-06-05 10:25:14,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 10:25:14,833 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:25:14,833 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:25:15,034 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164,61 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:25:15,034 INFO L430 AbstractCegarLoop]: === Iteration 69 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:25:15,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:25:15,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1831519166, now seen corresponding path program 7 times [2021-06-05 10:25:15,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:25:15,035 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266685089] [2021-06-05 10:25:15,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:25:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:25:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 2 proven. 51 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:25:15,204 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:25:15,204 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266685089] [2021-06-05 10:25:15,204 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266685089] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:25:15,204 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59040935] [2021-06-05 10:25:15,204 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:25:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:25:15,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 21 conjunts are in the unsatisfiable core [2021-06-05 10:25:15,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:25:15,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:25:15,280 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:15,281 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:15,282 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:15,282 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:25:15,295 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:25:15,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:25:15,296 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:15,297 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:15,297 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:15,298 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:25:15,459 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:25:15,460 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:15,464 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:15,464 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:15,464 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:25:15,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2021-06-05 10:25:15,486 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:25:15,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-06-05 10:25:15,487 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:15,493 INFO L628 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2021-06-05 10:25:15,493 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:15,498 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:15,499 INFO L550 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. [2021-06-05 10:25:15,499 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 [2021-06-05 10:25:15,541 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:25:15,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:25:15,542 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:15,548 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:15,549 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:25:15,550 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2021-06-05 10:25:15,578 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:25:15,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:25:15,579 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:15,581 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:15,582 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:15,582 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:25:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 11 proven. 42 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:25:15,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59040935] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:25:15,608 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:25:15,608 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 29 [2021-06-05 10:25:15,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430906182] [2021-06-05 10:25:15,609 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 10:25:15,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:25:15,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 10:25:15,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2021-06-05 10:25:15,609 INFO L87 Difference]: Start difference. First operand 39383 states and 115344 transitions. Second operand has 29 states, 29 states have (on average 6.103448275862069) internal successors, (177), 29 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:18,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:25:18,496 INFO L93 Difference]: Finished difference Result 76817 states and 224197 transitions. [2021-06-05 10:25:18,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-05 10:25:18,497 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.103448275862069) internal successors, (177), 29 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 10:25:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:25:18,607 INFO L225 Difference]: With dead ends: 76817 [2021-06-05 10:25:18,607 INFO L226 Difference]: Without dead ends: 76697 [2021-06-05 10:25:18,608 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3429 ImplicationChecksByTransitivity, 1928.2ms TimeCoverageRelationStatistics Valid=2070, Invalid=8642, Unknown=0, NotChecked=0, Total=10712 [2021-06-05 10:25:18,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76697 states. [2021-06-05 10:25:19,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76697 to 39079. [2021-06-05 10:25:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39079 states, 39077 states have (on average 2.9297028942856413) internal successors, (114484), 39078 states have internal predecessors, (114484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39079 states to 39079 states and 114484 transitions. [2021-06-05 10:25:19,642 INFO L78 Accepts]: Start accepts. Automaton has 39079 states and 114484 transitions. Word has length 119 [2021-06-05 10:25:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:25:19,642 INFO L482 AbstractCegarLoop]: Abstraction has 39079 states and 114484 transitions. [2021-06-05 10:25:19,642 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 6.103448275862069) internal successors, (177), 29 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand 39079 states and 114484 transitions. [2021-06-05 10:25:19,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 10:25:19,679 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:25:19,679 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:25:19,886 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220,62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:25:19,886 INFO L430 AbstractCegarLoop]: === Iteration 70 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:25:19,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:25:19,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1848626846, now seen corresponding path program 8 times [2021-06-05 10:25:19,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:25:19,886 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130886593] [2021-06-05 10:25:19,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:25:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:25:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 52 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:25:20,055 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:25:20,055 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130886593] [2021-06-05 10:25:20,055 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130886593] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:25:20,055 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870547997] [2021-06-05 10:25:20,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:25:20,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 10:25:20,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:25:20,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 19 conjunts are in the unsatisfiable core [2021-06-05 10:25:20,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:25:20,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:25:20,376 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:20,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:20,380 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:20,380 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2021-06-05 10:25:20,419 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:25:20,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:25:20,421 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:20,425 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:20,426 INFO L550 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. [2021-06-05 10:25:20,426 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2021-06-05 10:25:20,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:25:20,479 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:25:20,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:25:20,480 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:20,486 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:20,487 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:25:20,487 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:28 [2021-06-05 10:25:20,520 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:25:20,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:25:20,524 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:20,527 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:20,527 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:20,528 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:25:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 10 proven. 43 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:25:20,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870547997] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:25:20,561 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:25:20,561 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2021-06-05 10:25:20,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190835821] [2021-06-05 10:25:20,561 INFO L462 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-06-05 10:25:20,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:25:20,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-06-05 10:25:20,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1010, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 10:25:20,562 INFO L87 Difference]: Start difference. First operand 39079 states and 114484 transitions. Second operand has 34 states, 34 states have (on average 6.205882352941177) internal successors, (211), 34 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:25:23,830 INFO L93 Difference]: Finished difference Result 74527 states and 217012 transitions. [2021-06-05 10:25:23,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-06-05 10:25:23,831 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.205882352941177) internal successors, (211), 34 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 10:25:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:25:23,936 INFO L225 Difference]: With dead ends: 74527 [2021-06-05 10:25:23,936 INFO L226 Difference]: Without dead ends: 74431 [2021-06-05 10:25:23,937 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3584 ImplicationChecksByTransitivity, 2385.8ms TimeCoverageRelationStatistics Valid=2096, Invalid=9460, Unknown=0, NotChecked=0, Total=11556 [2021-06-05 10:25:24,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74431 states. [2021-06-05 10:25:24,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74431 to 34731. [2021-06-05 10:25:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34731 states, 34729 states have (on average 2.923032624031789) internal successors, (101514), 34730 states have internal predecessors, (101514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34731 states to 34731 states and 101514 transitions. [2021-06-05 10:25:24,906 INFO L78 Accepts]: Start accepts. Automaton has 34731 states and 101514 transitions. Word has length 119 [2021-06-05 10:25:24,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:25:24,906 INFO L482 AbstractCegarLoop]: Abstraction has 34731 states and 101514 transitions. [2021-06-05 10:25:24,906 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 6.205882352941177) internal successors, (211), 34 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:24,906 INFO L276 IsEmpty]: Start isEmpty. Operand 34731 states and 101514 transitions. [2021-06-05 10:25:24,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 10:25:24,938 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:25:24,938 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:25:25,138 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable221 [2021-06-05 10:25:25,139 INFO L430 AbstractCegarLoop]: === Iteration 71 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:25:25,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:25:25,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1210470226, now seen corresponding path program 7 times [2021-06-05 10:25:25,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:25:25,139 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020989770] [2021-06-05 10:25:25,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:25:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:25:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 10:25:25,296 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:25:25,296 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020989770] [2021-06-05 10:25:25,296 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020989770] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:25:25,296 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190179001] [2021-06-05 10:25:25,296 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:25:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:25:25,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 21 conjunts are in the unsatisfiable core [2021-06-05 10:25:25,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:25:25,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:25:25,372 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:25,373 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:25,374 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:25,374 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:25:25,395 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:25:25,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:25:25,396 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:25,397 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:25,398 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:25,398 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:25:25,544 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:25:25,545 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:25,548 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:25,549 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:25,549 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:25:25,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2021-06-05 10:25:25,570 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:25:25,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-06-05 10:25:25,571 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:25,577 INFO L628 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2021-06-05 10:25:25,577 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:25,581 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:25,582 INFO L550 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. [2021-06-05 10:25:25,582 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 [2021-06-05 10:25:25,615 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:25:25,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:25:25,616 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:25,621 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:25,622 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:25:25,622 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2021-06-05 10:25:25,650 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:25:25,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:25:25,651 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:25,654 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:25,654 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:25,654 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:25:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 10 proven. 51 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 10:25:25,680 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190179001] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:25:25,680 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:25:25,681 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 28 [2021-06-05 10:25:25,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948117269] [2021-06-05 10:25:25,681 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 10:25:25,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:25:25,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 10:25:25,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2021-06-05 10:25:25,681 INFO L87 Difference]: Start difference. First operand 34731 states and 101514 transitions. Second operand has 28 states, 28 states have (on average 6.0) internal successors, (168), 28 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:28,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:25:28,576 INFO L93 Difference]: Finished difference Result 68797 states and 200901 transitions. [2021-06-05 10:25:28,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-05 10:25:28,576 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.0) internal successors, (168), 28 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 10:25:28,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:25:28,674 INFO L225 Difference]: With dead ends: 68797 [2021-06-05 10:25:28,674 INFO L226 Difference]: Without dead ends: 68773 [2021-06-05 10:25:28,674 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4175 ImplicationChecksByTransitivity, 1908.6ms TimeCoverageRelationStatistics Valid=2199, Invalid=10233, Unknown=0, NotChecked=0, Total=12432 [2021-06-05 10:25:28,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68773 states. [2021-06-05 10:25:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68773 to 34493. [2021-06-05 10:25:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34493 states, 34491 states have (on average 2.924154127163608) internal successors, (100857), 34492 states have internal predecessors, (100857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:29,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34493 states to 34493 states and 100857 transitions. [2021-06-05 10:25:29,515 INFO L78 Accepts]: Start accepts. Automaton has 34493 states and 100857 transitions. Word has length 119 [2021-06-05 10:25:29,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:25:29,515 INFO L482 AbstractCegarLoop]: Abstraction has 34493 states and 100857 transitions. [2021-06-05 10:25:29,515 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 6.0) internal successors, (168), 28 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:29,516 INFO L276 IsEmpty]: Start isEmpty. Operand 34493 states and 100857 transitions. [2021-06-05 10:25:29,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 10:25:29,546 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:25:29,546 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:25:29,746 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable222,64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:25:29,746 INFO L430 AbstractCegarLoop]: === Iteration 72 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:25:29,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:25:29,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1184508128, now seen corresponding path program 12 times [2021-06-05 10:25:29,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:25:29,747 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128944690] [2021-06-05 10:25:29,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:25:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:25:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:25:29,916 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:25:29,916 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128944690] [2021-06-05 10:25:29,916 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128944690] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:25:29,916 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079488457] [2021-06-05 10:25:29,916 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:25:29,984 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-05 10:25:29,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:25:29,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 10:25:29,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:25:30,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:25:30,177 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:30,180 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:30,181 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:30,181 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-06-05 10:25:30,214 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:25:30,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:25:30,215 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:30,219 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:30,220 INFO L550 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. [2021-06-05 10:25:30,220 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2021-06-05 10:25:30,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:25:30,261 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:25:30,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:25:30,262 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:30,267 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:30,268 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:25:30,268 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:26 [2021-06-05 10:25:30,301 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:25:30,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:25:30,302 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:30,305 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:30,305 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:30,305 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2021-06-05 10:25:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 9 proven. 70 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-06-05 10:25:30,338 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079488457] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:25:30,338 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:25:30,338 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 31 [2021-06-05 10:25:30,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681182796] [2021-06-05 10:25:30,338 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 10:25:30,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:25:30,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 10:25:30,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2021-06-05 10:25:30,339 INFO L87 Difference]: Start difference. First operand 34493 states and 100857 transitions. Second operand has 31 states, 31 states have (on average 6.161290322580645) internal successors, (191), 31 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:31,313 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2021-06-05 10:25:36,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:25:36,005 INFO L93 Difference]: Finished difference Result 61751 states and 180069 transitions. [2021-06-05 10:25:36,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2021-06-05 10:25:36,005 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 6.161290322580645) internal successors, (191), 31 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 10:25:36,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:25:36,082 INFO L225 Difference]: With dead ends: 61751 [2021-06-05 10:25:36,082 INFO L226 Difference]: Without dead ends: 54559 [2021-06-05 10:25:36,082 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7277 ImplicationChecksByTransitivity, 4502.7ms TimeCoverageRelationStatistics Valid=3535, Invalid=17635, Unknown=0, NotChecked=0, Total=21170 [2021-06-05 10:25:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54559 states. [2021-06-05 10:25:36,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54559 to 24947. [2021-06-05 10:25:36,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24947 states, 24945 states have (on average 2.8309079975947085) internal successors, (70617), 24946 states have internal predecessors, (70617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:36,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24947 states to 24947 states and 70617 transitions. [2021-06-05 10:25:36,613 INFO L78 Accepts]: Start accepts. Automaton has 24947 states and 70617 transitions. Word has length 119 [2021-06-05 10:25:36,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:25:36,613 INFO L482 AbstractCegarLoop]: Abstraction has 24947 states and 70617 transitions. [2021-06-05 10:25:36,613 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 6.161290322580645) internal successors, (191), 31 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 24947 states and 70617 transitions. [2021-06-05 10:25:36,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 10:25:36,634 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:25:36,634 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:25:36,838 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable223 [2021-06-05 10:25:36,839 INFO L430 AbstractCegarLoop]: === Iteration 73 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:25:36,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:25:36,839 INFO L82 PathProgramCache]: Analyzing trace with hash -284704990, now seen corresponding path program 13 times [2021-06-05 10:25:36,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:25:36,839 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914005779] [2021-06-05 10:25:36,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:25:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:25:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:25:37,024 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:25:37,024 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914005779] [2021-06-05 10:25:37,024 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914005779] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:25:37,024 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392372017] [2021-06-05 10:25:37,024 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:25:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:25:37,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 21 conjunts are in the unsatisfiable core [2021-06-05 10:25:37,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:25:37,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:25:37,117 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:37,118 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:37,119 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:37,119 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:25:37,131 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:25:37,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:25:37,132 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:37,133 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:37,133 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:37,133 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:25:37,281 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:25:37,281 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:37,285 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:37,286 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:37,286 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:25:37,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:25:37,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:25:37,301 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:37,306 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:37,307 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:37,307 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:17 [2021-06-05 10:25:37,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 34 treesize of output 29 [2021-06-05 10:25:37,336 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:25:37,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-06-05 10:25:37,337 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:37,344 INFO L628 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2021-06-05 10:25:37,345 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:37,348 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:37,349 INFO L550 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. [2021-06-05 10:25:37,349 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2021-06-05 10:25:37,378 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:25:37,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:25:37,379 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:37,381 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:37,382 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:37,382 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:25:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 9 proven. 92 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:25:37,409 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392372017] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:25:37,409 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:25:37,409 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 28 [2021-06-05 10:25:37,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510936559] [2021-06-05 10:25:37,410 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 10:25:37,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:25:37,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 10:25:37,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2021-06-05 10:25:37,410 INFO L87 Difference]: Start difference. First operand 24947 states and 70617 transitions. Second operand has 28 states, 28 states have (on average 6.071428571428571) internal successors, (170), 28 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:40,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:25:40,702 INFO L93 Difference]: Finished difference Result 57935 states and 163976 transitions. [2021-06-05 10:25:40,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-06-05 10:25:40,703 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.071428571428571) internal successors, (170), 28 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 10:25:40,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:25:40,778 INFO L225 Difference]: With dead ends: 57935 [2021-06-05 10:25:40,778 INFO L226 Difference]: Without dead ends: 57805 [2021-06-05 10:25:40,779 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4449 ImplicationChecksByTransitivity, 2278.9ms TimeCoverageRelationStatistics Valid=2327, Invalid=11013, Unknown=0, NotChecked=0, Total=13340 [2021-06-05 10:25:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57805 states. [2021-06-05 10:25:41,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57805 to 24947. [2021-06-05 10:25:41,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24947 states, 24945 states have (on average 2.8309079975947085) internal successors, (70617), 24946 states have internal predecessors, (70617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24947 states to 24947 states and 70617 transitions. [2021-06-05 10:25:41,314 INFO L78 Accepts]: Start accepts. Automaton has 24947 states and 70617 transitions. Word has length 119 [2021-06-05 10:25:41,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:25:41,315 INFO L482 AbstractCegarLoop]: Abstraction has 24947 states and 70617 transitions. [2021-06-05 10:25:41,315 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 6.071428571428571) internal successors, (170), 28 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 24947 states and 70617 transitions. [2021-06-05 10:25:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 10:25:41,334 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:25:41,334 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:25:41,534 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable224 [2021-06-05 10:25:41,534 INFO L430 AbstractCegarLoop]: === Iteration 74 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:25:41,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:25:41,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1947863102, now seen corresponding path program 14 times [2021-06-05 10:25:41,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:25:41,535 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868234639] [2021-06-05 10:25:41,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:25:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:25:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:25:41,710 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:25:41,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868234639] [2021-06-05 10:25:41,710 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868234639] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:25:41,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305899647] [2021-06-05 10:25:41,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:25:41,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 10:25:41,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:25:41,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 21 conjunts are in the unsatisfiable core [2021-06-05 10:25:41,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:25:41,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 10:25:41,884 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:41,885 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:41,885 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:41,885 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 10:25:41,900 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 10:25:41,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 10:25:41,901 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:41,902 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:41,902 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:41,903 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 10:25:42,055 INFO L388 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 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:25:42,056 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:42,059 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:42,059 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:42,060 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 10:25:42,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:25:42,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 10:25:42,075 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:42,079 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:42,080 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:42,080 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:17 [2021-06-05 10:25:42,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 34 treesize of output 29 [2021-06-05 10:25:42,124 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:25:42,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-06-05 10:25:42,125 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:42,131 INFO L628 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2021-06-05 10:25:42,132 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:42,136 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:42,137 INFO L550 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. [2021-06-05 10:25:42,137 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2021-06-05 10:25:42,169 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:25:42,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2021-06-05 10:25:42,170 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:42,172 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:42,173 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:42,173 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2021-06-05 10:25:42,203 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 9 proven. 92 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:25:42,203 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305899647] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:25:42,203 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:25:42,203 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 28 [2021-06-05 10:25:42,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289609068] [2021-06-05 10:25:42,203 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 10:25:42,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:25:42,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 10:25:42,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2021-06-05 10:25:42,204 INFO L87 Difference]: Start difference. First operand 24947 states and 70617 transitions. Second operand has 28 states, 28 states have (on average 6.071428571428571) internal successors, (170), 28 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:25:44,846 INFO L93 Difference]: Finished difference Result 52713 states and 149104 transitions. [2021-06-05 10:25:44,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-05 10:25:44,846 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.071428571428571) internal successors, (170), 28 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 10:25:44,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:25:44,920 INFO L225 Difference]: With dead ends: 52713 [2021-06-05 10:25:44,920 INFO L226 Difference]: Without dead ends: 52581 [2021-06-05 10:25:44,921 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4061 ImplicationChecksByTransitivity, 1838.7ms TimeCoverageRelationStatistics Valid=2225, Invalid=10207, Unknown=0, NotChecked=0, Total=12432 [2021-06-05 10:25:44,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52581 states. [2021-06-05 10:25:45,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52581 to 24647. [2021-06-05 10:25:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24647 states, 24645 states have (on average 2.8297829174274702) internal successors, (69740), 24646 states have internal predecessors, (69740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:45,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24647 states to 24647 states and 69740 transitions. [2021-06-05 10:25:45,438 INFO L78 Accepts]: Start accepts. Automaton has 24647 states and 69740 transitions. Word has length 119 [2021-06-05 10:25:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:25:45,438 INFO L482 AbstractCegarLoop]: Abstraction has 24647 states and 69740 transitions. [2021-06-05 10:25:45,438 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 6.071428571428571) internal successors, (170), 28 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:25:45,439 INFO L276 IsEmpty]: Start isEmpty. Operand 24647 states and 69740 transitions. [2021-06-05 10:25:45,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 10:25:45,458 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:25:45,458 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:25:45,658 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable225 [2021-06-05 10:25:45,658 INFO L430 AbstractCegarLoop]: === Iteration 75 === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:25:45,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:25:45,659 INFO L82 PathProgramCache]: Analyzing trace with hash 83607842, now seen corresponding path program 12 times [2021-06-05 10:25:45,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:25:45,659 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909106808] [2021-06-05 10:25:45,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:25:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:25:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:25:45,897 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:25:45,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909106808] [2021-06-05 10:25:45,897 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909106808] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:25:45,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865319107] [2021-06-05 10:25:45,897 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:25:45,967 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-06-05 10:25:45,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 10:25:45,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 10:25:45,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 10:25:46,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 10:25:46,273 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:46,278 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:46,278 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:46,278 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2021-06-05 10:25:46,310 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-06-05 10:25:46,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-06-05 10:25:46,311 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:46,316 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:46,317 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:25:46,317 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2021-06-05 10:25:46,353 INFO L354 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2021-06-05 10:25:46,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2021-06-05 10:25:46,354 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:46,360 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:46,361 INFO L550 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. [2021-06-05 10:25:46,361 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:36 [2021-06-05 10:25:46,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:25:46,409 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-06-05 10:25:46,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-06-05 10:25:46,410 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:46,417 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:46,418 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 10:25:46,419 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:31 [2021-06-05 10:25:46,477 WARN L313 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:25:46,500 INFO L354 Elim1Store]: treesize reduction 64, result has 42.3 percent of original size [2021-06-05 10:25:46,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 64 [2021-06-05 10:25:46,502 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:46,511 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:25:46,514 INFO L550 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. [2021-06-05 10:25:46,514 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:58 [2021-06-05 10:25:46,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:25:46,641 INFO L354 Elim1Store]: treesize reduction 80, result has 37.0 percent of original size [2021-06-05 10:25:46,642 INFO L388 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 4 case distinctions, treesize of input 49 treesize of output 67 [2021-06-05 10:25:46,643 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:46,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:25:46,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2021-06-05 10:25:46,653 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:46,655 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 10:25:46,656 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:46,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:25:46,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2021-06-05 10:25:46,661 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 10:25:46,711 INFO L628 ElimStorePlain]: treesize reduction 54, result has 57.8 percent of original size [2021-06-05 10:25:46,712 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 10:25:46,712 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:199, output treesize:74 [2021-06-05 10:25:50,780 WARN L205 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2021-06-05 10:26:00,885 WARN L205 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 34 [2021-06-05 10:26:04,944 WARN L205 SmtUtils]: Spent 4.01 s on a formula simplification that was a NOOP. DAG size: 33 [2021-06-05 10:26:04,980 INFO L354 Elim1Store]: treesize reduction 144, result has 24.2 percent of original size [2021-06-05 10:26:04,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 66 [2021-06-05 10:26:04,982 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:26:04,992 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 10:26:05,006 INFO L550 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. [2021-06-05 10:26:05,006 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:66 [2021-06-05 10:26:05,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:26:05,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:26:05,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:26:05,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 10:26:05,123 INFO L354 Elim1Store]: treesize reduction 21, result has 36.4 percent of original size [2021-06-05 10:26:05,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 28 [2021-06-05 10:26:05,125 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 10:26:05,129 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-06-05 10:26:05,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 13 [2021-06-05 10:26:05,131 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 10:26:05,151 INFO L628 ElimStorePlain]: treesize reduction 11, result has 74.4 percent of original size [2021-06-05 10:26:05,153 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 10:26:05,153 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:128, output treesize:3 [2021-06-05 10:26:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 61 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 10:26:05,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865319107] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 10:26:05,197 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 10:26:05,197 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 40 [2021-06-05 10:26:05,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226377219] [2021-06-05 10:26:05,197 INFO L462 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-06-05 10:26:05,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:26:05,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-06-05 10:26:05,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1415, Unknown=3, NotChecked=0, Total=1560 [2021-06-05 10:26:05,198 INFO L87 Difference]: Start difference. First operand 24647 states and 69740 transitions. Second operand has 40 states, 40 states have (on average 5.275) internal successors, (211), 40 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:29:15,577 WARN L205 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2021-06-05 10:29:39,753 WARN L205 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2021-06-05 10:29:57,927 WARN L205 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2021-06-05 10:30:00,027 WARN L205 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2021-06-05 10:30:10,228 WARN L205 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2021-06-05 10:30:24,332 WARN L205 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2021-06-05 10:30:40,589 WARN L205 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2021-06-05 10:30:42,791 WARN L205 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2021-06-05 10:30:52,873 WARN L205 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2021-06-05 10:31:33,294 WARN L205 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2021-06-05 10:32:09,534 WARN L205 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2021-06-05 10:32:11,629 WARN L205 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2021-06-05 10:32:29,958 WARN L205 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2021-06-05 10:33:02,271 WARN L205 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2021-06-05 10:33:18,459 WARN L205 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 61 DAG size of output: 46 Received shutdown request... [2021-06-05 10:34:16,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2021-06-05 10:34:16,922 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226,68 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 10:34:16,922 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 10:34:16,922 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT (1/2) [2021-06-05 10:34:16,922 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 10:34:16,923 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 10:34:16,923 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 10:34:16,923 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 10:34:16,923 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 10:34:16,923 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 10:34:16,923 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 10:34:16,923 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 10:34:16,923 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 10:34:16,924 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 106 transitions, 224 flow [2021-06-05 10:34:16,924 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 10:34:16,925 INFO L315 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2021-06-05 10:34:16,925 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2021-06-05 10:34:16,926 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 10:34:16,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 10:34:16 BasicIcfg [2021-06-05 10:34:16,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 10:34:16,927 INFO L168 Benchmark]: Toolchain (without parser) took 831662.75 ms. Allocated memory was 406.8 MB in the beginning and 9.1 GB in the end (delta: 8.7 GB). Free memory was 368.7 MB in the beginning and 7.4 GB in the end (delta: -7.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 16.0 GB. [2021-06-05 10:34:16,927 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 406.8 MB. Free memory is still 387.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 10:34:16,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 542.52 ms. Allocated memory is still 406.8 MB. Free memory was 368.4 MB in the beginning and 344.4 MB in the end (delta: 24.0 MB). Peak memory consumption was 26.6 MB. Max. memory is 16.0 GB. [2021-06-05 10:34:16,927 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.33 ms. Allocated memory is still 406.8 MB. Free memory was 344.4 MB in the beginning and 341.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 10:34:16,927 INFO L168 Benchmark]: Boogie Preprocessor took 29.38 ms. Allocated memory is still 406.8 MB. Free memory was 341.4 MB in the beginning and 340.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 10:34:16,927 INFO L168 Benchmark]: RCFGBuilder took 384.92 ms. Allocated memory is still 406.8 MB. Free memory was 340.2 MB in the beginning and 310.9 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.0 GB. [2021-06-05 10:34:16,927 INFO L168 Benchmark]: TraceAbstraction took 830645.75 ms. Allocated memory was 406.8 MB in the beginning and 9.1 GB in the end (delta: 8.7 GB). Free memory was 310.9 MB in the beginning and 7.4 GB in the end (delta: -7.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 16.0 GB. [2021-06-05 10:34:16,927 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 406.8 MB. Free memory is still 387.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 542.52 ms. Allocated memory is still 406.8 MB. Free memory was 368.4 MB in the beginning and 344.4 MB in the end (delta: 24.0 MB). Peak memory consumption was 26.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 54.33 ms. Allocated memory is still 406.8 MB. Free memory was 344.4 MB in the beginning and 341.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.38 ms. Allocated memory is still 406.8 MB. Free memory was 341.4 MB in the beginning and 340.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 384.92 ms. Allocated memory is still 406.8 MB. Free memory was 340.2 MB in the beginning and 310.9 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 830645.75 ms. Allocated memory was 406.8 MB in the beginning and 9.1 GB in the end (delta: 8.7 GB). Free memory was 310.9 MB in the beginning and 7.4 GB in the end (delta: -7.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (24647states) and FLOYD_HOARE automaton (currently 123 states, 40 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 161 known predicates. - TimeoutResultAtElement [Line: 1047]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 101 places, 106 transitions, 224 flow. Already constructed 2 states. Currently 1 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 97 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 874.5ms, OverallIterations: 3, TraceHistogramMax: 2, EmptinessCheckTime: 14.0ms, AutomataDifference: 421.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 27.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 231 SDtfs, 255 SDslu, 607 SDs, 0 SdLazy, 160 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 112.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 261.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=418occurred in iteration=0, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 36.0ms AutomataMinimizationTime, 3 MinimizatonAttempts, 42 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 8.7ms SsaConstructionTime, 52.0ms SatisfiabilityAnalysisTime, 221.9ms InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 365 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 124 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 829608.9ms, OverallIterations: 75, TraceHistogramMax: 5, EmptinessCheckTime: 1413.9ms, AutomataDifference: 708263.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 381.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 23087 SDtfs, 166192 SDslu, 274898 SDs, 0 SdLazy, 135503 SolverSat, 14973 SolverUnsat, 145 SolverUnknown, 0 SolverNotchecked, 343494.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17349 GetRequests, 8594 SyntacticMatches, 63 SemanticMatches, 8691 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492413 ImplicationChecksByTransitivity, 346207.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=47321occurred in iteration=63, InterpolantAutomatonStates: 7380, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 50524.0ms AutomataMinimizationTime, 74 MinimizatonAttempts, 3184337 StatesRemovedByMinimization, 73 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 762.4ms SsaConstructionTime, 1798.6ms SatisfiabilityAnalysisTime, 49766.0ms InterpolantComputationTime, 13373 NumberOfCodeBlocks, 12949 NumberOfCodeBlocksAsserted, 203 NumberOfCheckSat, 13231 ConstructedInterpolants, 132 QuantifiedInterpolants, 82821 SizeOfPredicates, 817 NumberOfNonLiveVariables, 14086 ConjunctsInSsa, 1061 ConjunctsInUnsatCore, 142 InterpolantComputations, 18 PerfectInterpolantSequences, 1234/4689 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 97 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 56.5ms, OverallIterations: 1, TraceHistogramMax: 2, EmptinessCheckTime: 1.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=418occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.4ms SsaConstructionTime, 6.8ms SatisfiabilityAnalysisTime, 0.0ms InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 124 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 1.7ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown