/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-ext/48_ticket_lock_low_contention_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 09:12:56,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 09:12:56,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 09:12:56,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 09:12:56,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 09:12:56,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 09:12:56,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 09:12:56,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 09:12:56,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 09:12:56,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 09:12:56,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 09:12:56,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 09:12:56,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 09:12:56,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 09:12:56,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 09:12:56,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 09:12:56,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 09:12:56,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 09:12:56,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 09:12:56,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 09:12:56,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 09:12:56,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 09:12:56,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 09:12:56,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 09:12:56,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 09:12:56,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 09:12:56,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 09:12:56,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 09:12:56,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 09:12:56,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 09:12:56,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 09:12:56,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 09:12:56,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 09:12:56,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 09:12:56,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 09:12:56,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 09:12:56,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 09:12:56,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 09:12:56,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 09:12:56,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 09:12:56,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 09:12:56,736 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 09:12:56,959 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 09:12:56,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 09:12:56,960 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 09:12:56,960 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 09:12:56,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 09:12:56,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 09:12:56,963 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 09:12:56,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 09:12:56,963 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 09:12:56,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 09:12:56,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 09:12:56,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 09:12:56,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 09:12:56,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 09:12:56,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 09:12:56,965 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 09:12:56,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 09:12:56,965 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 09:12:56,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 09:12:56,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 09:12:56,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 09:12:56,970 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 09:12:56,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 09:12:56,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 09:12:56,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 09:12:56,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 09:12:56,972 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 09:12:56,972 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 09:12:56,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 09:12:56,973 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 09:12:56,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 09:12:56,973 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 09:12:56,973 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 09:12:57,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 09:12:57,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 09:12:57,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 09:12:57,284 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 09:12:57,285 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 09:12:57,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs.i [2021-06-05 09:12:57,345 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23d6ce47c/283f4d05895548e3a83698ce9eaff53a/FLAG24f53b5dd [2021-06-05 09:12:57,820 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 09:12:57,821 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs.i [2021-06-05 09:12:57,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23d6ce47c/283f4d05895548e3a83698ce9eaff53a/FLAG24f53b5dd [2021-06-05 09:12:57,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23d6ce47c/283f4d05895548e3a83698ce9eaff53a [2021-06-05 09:12:57,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 09:12:57,864 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 09:12:57,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 09:12:57,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 09:12:57,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 09:12:57,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 09:12:57" (1/1) ... [2021-06-05 09:12:57,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@532f8ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:12:57, skipping insertion in model container [2021-06-05 09:12:57,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 09:12:57" (1/1) ... [2021-06-05 09:12:57,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 09:12:57,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 09:12:58,108 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-05 09:12:58,250 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-ext/48_ticket_lock_low_contention_vs.i[30893,30906] [2021-06-05 09:12:58,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 09:12:58,261 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 09:12:58,272 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-05 09:12:58,286 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-ext/48_ticket_lock_low_contention_vs.i[30893,30906] [2021-06-05 09:12:58,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 09:12:58,340 INFO L208 MainTranslator]: Completed translation [2021-06-05 09:12:58,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:12:58 WrapperNode [2021-06-05 09:12:58,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 09:12:58,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 09:12:58,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 09:12:58,342 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 09:12:58,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:12:58" (1/1) ... [2021-06-05 09:12:58,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:12:58" (1/1) ... [2021-06-05 09:12:58,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 09:12:58,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 09:12:58,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 09:12:58,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 09:12:58,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:12:58" (1/1) ... [2021-06-05 09:12:58,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:12:58" (1/1) ... [2021-06-05 09:12:58,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:12:58" (1/1) ... [2021-06-05 09:12:58,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:12:58" (1/1) ... [2021-06-05 09:12:58,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:12:58" (1/1) ... [2021-06-05 09:12:58,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:12:58" (1/1) ... [2021-06-05 09:12:58,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:12:58" (1/1) ... [2021-06-05 09:12:58,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 09:12:58,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 09:12:58,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 09:12:58,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 09:12:58,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:12:58" (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 09:12:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 09:12:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2021-06-05 09:12:58,491 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2021-06-05 09:12:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 09:12:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 09:12:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 09:12:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 09:12:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 09:12:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 09:12:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 09:12:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 09:12:58,493 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 09:12:59,175 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 09:12:59,176 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-06-05 09:12:59,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 09:12:59 BoogieIcfgContainer [2021-06-05 09:12:59,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 09:12:59,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 09:12:59,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 09:12:59,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 09:12:59,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 09:12:57" (1/3) ... [2021-06-05 09:12:59,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0ef1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 09:12:59, skipping insertion in model container [2021-06-05 09:12:59,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:12:58" (2/3) ... [2021-06-05 09:12:59,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0ef1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 09:12:59, skipping insertion in model container [2021-06-05 09:12:59,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 09:12:59" (3/3) ... [2021-06-05 09:12:59,199 INFO L111 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs.i [2021-06-05 09:12:59,204 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 09:12:59,204 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 09:12:59,204 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 09:12:59,205 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 09:12:59,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,226 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,228 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,228 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,229 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,229 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,230 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,230 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:59,240 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 09:12:59,259 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 09:12:59,276 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 09:12:59,277 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 09:12:59,277 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 09:12:59,277 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 09:12:59,277 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 09:12:59,277 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 09:12:59,277 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 09:12:59,277 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 09:12:59,286 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 69 transitions, 143 flow [2021-06-05 09:12:59,330 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 622 states, 614 states have (on average 2.066775244299674) internal successors, (1269), 621 states have internal predecessors, (1269), 0 states have call successors, (0), 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 09:12:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 622 states, 614 states have (on average 2.066775244299674) internal successors, (1269), 621 states have internal predecessors, (1269), 0 states have call successors, (0), 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 09:12:59,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-06-05 09:12:59,341 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:59,341 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] [2021-06-05 09:12:59,342 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:59,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:59,346 INFO L82 PathProgramCache]: Analyzing trace with hash 900842047, now seen corresponding path program 1 times [2021-06-05 09:12:59,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:59,354 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393648033] [2021-06-05 09:12:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:59,482 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 09:12:59,483 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:59,483 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393648033] [2021-06-05 09:12:59,483 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393648033] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:12:59,484 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:12:59,484 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 09:12:59,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115560814] [2021-06-05 09:12:59,488 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 09:12:59,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:59,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 09:12:59,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 09:12:59,502 INFO L87 Difference]: Start difference. First operand has 622 states, 614 states have (on average 2.066775244299674) internal successors, (1269), 621 states have internal predecessors, (1269), 0 states have call successors, (0), 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 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 09:12:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:59,532 INFO L93 Difference]: Finished difference Result 570 states and 1096 transitions. [2021-06-05 09:12:59,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 09:12:59,534 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-06-05 09:12:59,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:59,546 INFO L225 Difference]: With dead ends: 570 [2021-06-05 09:12:59,546 INFO L226 Difference]: Without dead ends: 424 [2021-06-05 09:12:59,547 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 09:12:59,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-06-05 09:12:59,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2021-06-05 09:12:59,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 419 states have (on average 1.9498806682577565) internal successors, (817), 423 states have internal predecessors, (817), 0 states have call successors, (0), 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 09:12:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 817 transitions. [2021-06-05 09:12:59,605 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 817 transitions. Word has length 24 [2021-06-05 09:12:59,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:59,605 INFO L482 AbstractCegarLoop]: Abstraction has 424 states and 817 transitions. [2021-06-05 09:12:59,605 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 09:12:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 817 transitions. [2021-06-05 09:12:59,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-06-05 09:12:59,606 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:59,606 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] [2021-06-05 09:12:59,607 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 09:12:59,607 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:59,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:59,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1719365106, now seen corresponding path program 1 times [2021-06-05 09:12:59,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:59,608 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980206852] [2021-06-05 09:12:59,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:59,707 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 09:12:59,707 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:59,708 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980206852] [2021-06-05 09:12:59,708 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980206852] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:12:59,708 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:12:59,708 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 09:12:59,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475463132] [2021-06-05 09:12:59,709 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 09:12:59,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:59,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 09:12:59,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 09:12:59,710 INFO L87 Difference]: Start difference. First operand 424 states and 817 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 09:12:59,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:59,753 INFO L93 Difference]: Finished difference Result 380 states and 707 transitions. [2021-06-05 09:12:59,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 09:12:59,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-06-05 09:12:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:59,756 INFO L225 Difference]: With dead ends: 380 [2021-06-05 09:12:59,756 INFO L226 Difference]: Without dead ends: 178 [2021-06-05 09:12:59,757 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 09:12:59,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-06-05 09:12:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2021-06-05 09:12:59,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 176 states have (on average 1.7840909090909092) internal successors, (314), 177 states have internal predecessors, (314), 0 states have call successors, (0), 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 09:12:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 314 transitions. [2021-06-05 09:12:59,767 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 314 transitions. Word has length 26 [2021-06-05 09:12:59,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:59,767 INFO L482 AbstractCegarLoop]: Abstraction has 178 states and 314 transitions. [2021-06-05 09:12:59,767 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 09:12:59,767 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 314 transitions. [2021-06-05 09:12:59,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 09:12:59,769 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:59,769 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:59,769 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 09:12:59,769 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:59,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:59,770 INFO L82 PathProgramCache]: Analyzing trace with hash 980714896, now seen corresponding path program 1 times [2021-06-05 09:12:59,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:59,776 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268342217] [2021-06-05 09:12:59,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:59,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:59,988 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:59,989 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268342217] [2021-06-05 09:12:59,989 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268342217] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:12:59,989 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:12:59,989 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 09:12:59,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013915052] [2021-06-05 09:12:59,990 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 09:12:59,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:59,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 09:12:59,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-05 09:12:59,991 INFO L87 Difference]: Start difference. First operand 178 states and 314 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:13:00,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:00,077 INFO L93 Difference]: Finished difference Result 182 states and 322 transitions. [2021-06-05 09:13:00,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 09:13:00,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 42 [2021-06-05 09:13:00,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:00,080 INFO L225 Difference]: With dead ends: 182 [2021-06-05 09:13:00,080 INFO L226 Difference]: Without dead ends: 134 [2021-06-05 09:13:00,081 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 59.3ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-05 09:13:00,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-06-05 09:13:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2021-06-05 09:13:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 132 states have (on average 1.628787878787879) internal successors, (215), 133 states have internal predecessors, (215), 0 states have call successors, (0), 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 09:13:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 215 transitions. [2021-06-05 09:13:00,103 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 215 transitions. Word has length 42 [2021-06-05 09:13:00,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:00,103 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 215 transitions. [2021-06-05 09:13:00,103 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:13:00,103 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 215 transitions. [2021-06-05 09:13:00,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 09:13:00,104 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:00,105 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:13:00,105 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 09:13:00,105 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:00,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:00,106 INFO L82 PathProgramCache]: Analyzing trace with hash -6442403, now seen corresponding path program 1 times [2021-06-05 09:13:00,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:00,106 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137041492] [2021-06-05 09:13:00,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:00,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:13:00,299 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:00,299 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137041492] [2021-06-05 09:13:00,300 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137041492] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:13:00,300 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:13:00,300 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 09:13:00,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374553776] [2021-06-05 09:13:00,301 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 09:13:00,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:00,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 09:13:00,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-05 09:13:00,304 INFO L87 Difference]: Start difference. First operand 134 states and 215 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:13:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:00,345 INFO L93 Difference]: Finished difference Result 69 states and 107 transitions. [2021-06-05 09:13:00,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 09:13:00,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 42 [2021-06-05 09:13:00,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:00,348 INFO L225 Difference]: With dead ends: 69 [2021-06-05 09:13:00,348 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 09:13:00,348 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.1ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-05 09:13:00,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 09:13:00,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 09:13:00,353 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 09:13:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 09:13:00,353 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2021-06-05 09:13:00,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:00,353 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 09:13:00,354 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:13:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 09:13:00,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 09:13:00,354 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 09:13:00,354 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 09:13:00,357 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 09:13:00,361 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 09:13:00,362 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 09:13:00,362 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 09:13:00,362 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 09:13:00,362 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 09:13:00,362 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 09:13:00,362 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 09:13:00,362 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 09:13:00,366 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 69 transitions, 143 flow [2021-06-05 09:13:00,378 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 622 states, 614 states have (on average 2.066775244299674) internal successors, (1269), 621 states have internal predecessors, (1269), 0 states have call successors, (0), 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 09:13:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 622 states, 614 states have (on average 2.066775244299674) internal successors, (1269), 621 states have internal predecessors, (1269), 0 states have call successors, (0), 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 09:13:00,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-06-05 09:13:00,385 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:00,385 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] [2021-06-05 09:13:00,385 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 09:13:00,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:00,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1162331487, now seen corresponding path program 1 times [2021-06-05 09:13:00,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:00,386 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161199320] [2021-06-05 09:13:00,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 09:13:00,400 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 09:13:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 09:13:00,408 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 09:13:00,426 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 09:13:00,426 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 09:13:00,426 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 09:13:00,426 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 09:13:00,427 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 09:13:00,427 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 09:13:00,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,439 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,441 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,441 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,441 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,441 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,441 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,441 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,441 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,441 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,442 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,442 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,442 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,442 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,442 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,444 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,444 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,444 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,444 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,444 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,445 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,445 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,445 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,445 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,445 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,445 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,445 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,446 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,446 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,446 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,446 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,446 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,446 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,447 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,447 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,447 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,447 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,447 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,447 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,447 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,448 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,448 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,448 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,448 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,448 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,448 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,448 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,448 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,449 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,449 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,449 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,449 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,449 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,449 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,449 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,449 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,449 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,449 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,449 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,450 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,450 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,450 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,450 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,450 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,450 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,450 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,451 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,451 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,451 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,451 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,451 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,451 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,452 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,452 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,452 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,452 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,456 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,456 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,456 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,456 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,456 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,456 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,457 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,457 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,457 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,457 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,457 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,458 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:00,463 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 09:13:00,464 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 09:13:00,466 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 09:13:00,466 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 09:13:00,466 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 09:13:00,466 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 09:13:00,466 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 09:13:00,466 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 09:13:00,466 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 09:13:00,466 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 09:13:00,469 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 87 transitions, 186 flow [2021-06-05 09:13:00,862 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9822 states, 9804 states have (on average 3.1175030599755202) internal successors, (30564), 9821 states have internal predecessors, (30564), 0 states have call successors, (0), 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 09:13:00,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 9822 states, 9804 states have (on average 3.1175030599755202) internal successors, (30564), 9821 states have internal predecessors, (30564), 0 states have call successors, (0), 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 09:13:00,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-06-05 09:13:00,902 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:00,902 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] [2021-06-05 09:13:00,902 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:00,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:00,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1748882623, now seen corresponding path program 1 times [2021-06-05 09:13:00,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:00,904 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185525302] [2021-06-05 09:13:00,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:00,940 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 09:13:00,940 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:00,941 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185525302] [2021-06-05 09:13:00,941 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185525302] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:13:00,941 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:13:00,941 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 09:13:00,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18589054] [2021-06-05 09:13:00,941 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 09:13:00,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:00,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 09:13:00,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 09:13:00,971 INFO L87 Difference]: Start difference. First operand has 9822 states, 9804 states have (on average 3.1175030599755202) internal successors, (30564), 9821 states have internal predecessors, (30564), 0 states have call successors, (0), 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 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 09:13:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:01,052 INFO L93 Difference]: Finished difference Result 8430 states and 24706 transitions. [2021-06-05 09:13:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 09:13:01,053 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-06-05 09:13:01,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:01,101 INFO L225 Difference]: With dead ends: 8430 [2021-06-05 09:13:01,101 INFO L226 Difference]: Without dead ends: 7395 [2021-06-05 09:13:01,102 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 09:13:01,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7395 states. [2021-06-05 09:13:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7395 to 7395. [2021-06-05 09:13:01,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7395 states, 7381 states have (on average 2.942419726324346) internal successors, (21718), 7394 states have internal predecessors, (21718), 0 states have call successors, (0), 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 09:13:01,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7395 states to 7395 states and 21718 transitions. [2021-06-05 09:13:01,429 INFO L78 Accepts]: Start accepts. Automaton has 7395 states and 21718 transitions. Word has length 24 [2021-06-05 09:13:01,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:01,429 INFO L482 AbstractCegarLoop]: Abstraction has 7395 states and 21718 transitions. [2021-06-05 09:13:01,430 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 09:13:01,430 INFO L276 IsEmpty]: Start isEmpty. Operand 7395 states and 21718 transitions. [2021-06-05 09:13:01,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-06-05 09:13:01,432 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:01,432 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] [2021-06-05 09:13:01,432 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 09:13:01,432 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:01,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:01,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1498812270, now seen corresponding path program 1 times [2021-06-05 09:13:01,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:01,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080431378] [2021-06-05 09:13:01,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:01,476 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 09:13:01,477 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:01,477 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080431378] [2021-06-05 09:13:01,477 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080431378] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:13:01,477 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:13:01,477 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 09:13:01,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606068516] [2021-06-05 09:13:01,478 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 09:13:01,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:01,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 09:13:01,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 09:13:01,479 INFO L87 Difference]: Start difference. First operand 7395 states and 21718 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 09:13:01,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:01,620 INFO L93 Difference]: Finished difference Result 7707 states and 22035 transitions. [2021-06-05 09:13:01,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 09:13:01,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-06-05 09:13:01,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:01,686 INFO L225 Difference]: With dead ends: 7707 [2021-06-05 09:13:01,686 INFO L226 Difference]: Without dead ends: 5765 [2021-06-05 09:13:01,687 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 09:13:01,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2021-06-05 09:13:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 5333. [2021-06-05 09:13:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5333 states, 5323 states have (on average 2.85139958669923) internal successors, (15178), 5332 states have internal predecessors, (15178), 0 states have call successors, (0), 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 09:13:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5333 states to 5333 states and 15178 transitions. [2021-06-05 09:13:01,880 INFO L78 Accepts]: Start accepts. Automaton has 5333 states and 15178 transitions. Word has length 26 [2021-06-05 09:13:01,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:01,882 INFO L482 AbstractCegarLoop]: Abstraction has 5333 states and 15178 transitions. [2021-06-05 09:13:01,883 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 09:13:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 5333 states and 15178 transitions. [2021-06-05 09:13:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 09:13:01,885 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:01,885 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:13:01,885 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 09:13:01,886 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:01,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:01,886 INFO L82 PathProgramCache]: Analyzing trace with hash 635540560, now seen corresponding path program 1 times [2021-06-05 09:13:01,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:01,887 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503083182] [2021-06-05 09:13:01,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:01,979 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:01,980 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503083182] [2021-06-05 09:13:01,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503083182] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:01,980 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903817377] [2021-06-05 09:13:01,980 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 09:13:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:02,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 09:13:02,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:02,350 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 11 treesize of output 7 [2021-06-05 09:13:02,351 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:02,360 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:02,364 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 09:13:02,364 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:13:02,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:02,408 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903817377] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:02,408 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:02,408 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2021-06-05 09:13:02,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047924203] [2021-06-05 09:13:02,410 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:13:02,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:02,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:13:02,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:13:02,411 INFO L87 Difference]: Start difference. First operand 5333 states and 15178 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 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 09:13:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:02,689 INFO L93 Difference]: Finished difference Result 5435 states and 15490 transitions. [2021-06-05 09:13:02,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:13:02,690 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 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 42 [2021-06-05 09:13:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:02,710 INFO L225 Difference]: With dead ends: 5435 [2021-06-05 09:13:02,711 INFO L226 Difference]: Without dead ends: 5395 [2021-06-05 09:13:02,711 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 104.6ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:13:02,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5395 states. [2021-06-05 09:13:02,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5395 to 5335. [2021-06-05 09:13:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5335 states, 5325 states have (on average 2.855774647887324) internal successors, (15207), 5334 states have internal predecessors, (15207), 0 states have call successors, (0), 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 09:13:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5335 states to 5335 states and 15207 transitions. [2021-06-05 09:13:02,870 INFO L78 Accepts]: Start accepts. Automaton has 5335 states and 15207 transitions. Word has length 42 [2021-06-05 09:13:02,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:02,870 INFO L482 AbstractCegarLoop]: Abstraction has 5335 states and 15207 transitions. [2021-06-05 09:13:02,870 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 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 09:13:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 5335 states and 15207 transitions. [2021-06-05 09:13:02,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 09:13:02,873 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:02,874 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:13:03,097 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-06-05 09:13:03,097 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:03,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:03,098 INFO L82 PathProgramCache]: Analyzing trace with hash 950682764, now seen corresponding path program 2 times [2021-06-05 09:13:03,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:03,098 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645512186] [2021-06-05 09:13:03,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:13:03,241 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:03,242 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645512186] [2021-06-05 09:13:03,242 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645512186] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:13:03,242 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:13:03,242 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 09:13:03,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117759605] [2021-06-05 09:13:03,243 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 09:13:03,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:03,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 09:13:03,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-05 09:13:03,243 INFO L87 Difference]: Start difference. First operand 5335 states and 15207 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:13:03,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:03,366 INFO L93 Difference]: Finished difference Result 5130 states and 14687 transitions. [2021-06-05 09:13:03,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 09:13:03,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 42 [2021-06-05 09:13:03,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:03,381 INFO L225 Difference]: With dead ends: 5130 [2021-06-05 09:13:03,381 INFO L226 Difference]: Without dead ends: 5061 [2021-06-05 09:13:03,381 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.3ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-05 09:13:03,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5061 states. [2021-06-05 09:13:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5061 to 5061. [2021-06-05 09:13:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5061 states, 5053 states have (on average 2.8733425687710272) internal successors, (14519), 5060 states have internal predecessors, (14519), 0 states have call successors, (0), 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 09:13:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5061 states to 5061 states and 14519 transitions. [2021-06-05 09:13:03,516 INFO L78 Accepts]: Start accepts. Automaton has 5061 states and 14519 transitions. Word has length 42 [2021-06-05 09:13:03,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:03,517 INFO L482 AbstractCegarLoop]: Abstraction has 5061 states and 14519 transitions. [2021-06-05 09:13:03,517 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:13:03,517 INFO L276 IsEmpty]: Start isEmpty. Operand 5061 states and 14519 transitions. [2021-06-05 09:13:03,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-06-05 09:13:03,552 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:03,552 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] [2021-06-05 09:13:03,552 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 09:13:03,553 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:03,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:03,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1340353198, now seen corresponding path program 1 times [2021-06-05 09:13:03,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:03,553 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183107876] [2021-06-05 09:13:03,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:03,664 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 09:13:03,664 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:03,664 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183107876] [2021-06-05 09:13:03,664 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183107876] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:03,664 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033747370] [2021-06-05 09:13:03,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:03,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 09:13:03,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:03,901 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 11 treesize of output 7 [2021-06-05 09:13:03,902 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:03,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:03,913 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 09:13:03,914 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:13:03,948 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 09:13:03,948 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033747370] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:03,948 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:03,948 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2021-06-05 09:13:03,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596421419] [2021-06-05 09:13:03,949 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:13:03,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:03,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:13:03,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:13:03,950 INFO L87 Difference]: Start difference. First operand 5061 states and 14519 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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 09:13:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:04,179 INFO L93 Difference]: Finished difference Result 4245 states and 12098 transitions. [2021-06-05 09:13:04,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:13:04,180 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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 43 [2021-06-05 09:13:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:04,190 INFO L225 Difference]: With dead ends: 4245 [2021-06-05 09:13:04,190 INFO L226 Difference]: Without dead ends: 4179 [2021-06-05 09:13:04,191 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 95.9ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:13:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4179 states. [2021-06-05 09:13:04,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4179 to 4007. [2021-06-05 09:13:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4007 states, 3999 states have (on average 2.8422105526381594) internal successors, (11366), 4006 states have internal predecessors, (11366), 0 states have call successors, (0), 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 09:13:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 11366 transitions. [2021-06-05 09:13:04,301 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 11366 transitions. Word has length 43 [2021-06-05 09:13:04,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:04,301 INFO L482 AbstractCegarLoop]: Abstraction has 4007 states and 11366 transitions. [2021-06-05 09:13:04,301 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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 09:13:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 11366 transitions. [2021-06-05 09:13:04,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-06-05 09:13:04,333 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:04,333 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:04,534 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-06-05 09:13:04,534 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:04,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:04,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1312543221, now seen corresponding path program 2 times [2021-06-05 09:13:04,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:04,535 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603012695] [2021-06-05 09:13:04,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:04,734 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:04,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603012695] [2021-06-05 09:13:04,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603012695] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:04,735 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510593298] [2021-06-05 09:13:04,735 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 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 09:13:04,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:13:04,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:04,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 38 conjunts are in the unsatisfiable core [2021-06-05 09:13:04,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:04,862 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 09:13:04,863 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:04,869 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:04,869 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:04,870 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:13:04,919 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:13:04,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2021-06-05 09:13:04,923 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:04,931 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:04,936 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:04,936 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2021-06-05 09:13:05,217 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 09:13:05,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:13:05,221 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:05,234 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:05,236 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:05,236 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2021-06-05 09:13:05,276 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 11 treesize of output 7 [2021-06-05 09:13:05,277 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:05,287 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:05,288 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:05,288 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-06-05 09:13:05,342 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 19 treesize of output 18 [2021-06-05 09:13:05,343 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:05,352 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:05,354 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 09:13:05,354 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:13:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:05,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510593298] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:05,383 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:05,384 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2021-06-05 09:13:05,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5713930] [2021-06-05 09:13:05,384 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 09:13:05,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:05,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 09:13:05,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:13:05,385 INFO L87 Difference]: Start difference. First operand 4007 states and 11366 transitions. Second operand has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 0 states have call successors, (0), 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 09:13:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:06,290 INFO L93 Difference]: Finished difference Result 4187 states and 11934 transitions. [2021-06-05 09:13:06,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 09:13:06,291 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 0 states have call successors, (0), 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 51 [2021-06-05 09:13:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:06,304 INFO L225 Difference]: With dead ends: 4187 [2021-06-05 09:13:06,304 INFO L226 Difference]: Without dead ends: 4115 [2021-06-05 09:13:06,304 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 473.7ms TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2021-06-05 09:13:06,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2021-06-05 09:13:06,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 4007. [2021-06-05 09:13:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4007 states, 3999 states have (on average 2.8422105526381594) internal successors, (11366), 4006 states have internal predecessors, (11366), 0 states have call successors, (0), 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 09:13:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 11366 transitions. [2021-06-05 09:13:06,404 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 11366 transitions. Word has length 51 [2021-06-05 09:13:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:06,405 INFO L482 AbstractCegarLoop]: Abstraction has 4007 states and 11366 transitions. [2021-06-05 09:13:06,405 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 0 states have call successors, (0), 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 09:13:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 11366 transitions. [2021-06-05 09:13:06,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-06-05 09:13:06,411 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:06,411 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:06,632 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-06-05 09:13:06,633 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:06,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:06,633 INFO L82 PathProgramCache]: Analyzing trace with hash -644510411, now seen corresponding path program 1 times [2021-06-05 09:13:06,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:06,633 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322961660] [2021-06-05 09:13:06,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:06,780 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:06,780 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322961660] [2021-06-05 09:13:06,780 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322961660] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:06,780 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964218739] [2021-06-05 09:13:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:06,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 09:13:06,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:06,910 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 09:13:06,911 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:06,916 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:06,917 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:06,917 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:13:06,949 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:13:06,950 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 09:13:06,952 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:06,958 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:06,959 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:06,959 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-06-05 09:13:07,026 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 11 treesize of output 7 [2021-06-05 09:13:07,027 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:07,034 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:07,035 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:07,035 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-06-05 09:13:07,111 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 19 treesize of output 18 [2021-06-05 09:13:07,113 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:07,121 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:07,123 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 09:13:07,124 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:13:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:07,204 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964218739] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:07,204 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:07,204 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 09:13:07,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874828714] [2021-06-05 09:13:07,204 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 09:13:07,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:07,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 09:13:07,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:13:07,205 INFO L87 Difference]: Start difference. First operand 4007 states and 11366 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 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 09:13:07,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:07,522 INFO L93 Difference]: Finished difference Result 4227 states and 12048 transitions. [2021-06-05 09:13:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:13:07,522 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 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 51 [2021-06-05 09:13:07,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:07,531 INFO L225 Difference]: With dead ends: 4227 [2021-06-05 09:13:07,531 INFO L226 Difference]: Without dead ends: 4175 [2021-06-05 09:13:07,531 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 224.4ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:13:07,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4175 states. [2021-06-05 09:13:07,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4175 to 4039. [2021-06-05 09:13:07,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4039 states, 4031 states have (on average 2.844455470106673) internal successors, (11466), 4038 states have internal predecessors, (11466), 0 states have call successors, (0), 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 09:13:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4039 states to 4039 states and 11466 transitions. [2021-06-05 09:13:07,623 INFO L78 Accepts]: Start accepts. Automaton has 4039 states and 11466 transitions. Word has length 51 [2021-06-05 09:13:07,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:07,625 INFO L482 AbstractCegarLoop]: Abstraction has 4039 states and 11466 transitions. [2021-06-05 09:13:07,625 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 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 09:13:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 4039 states and 11466 transitions. [2021-06-05 09:13:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-06-05 09:13:07,629 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:07,629 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:07,853 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:07,854 INFO L430 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:07,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:07,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1545884915, now seen corresponding path program 3 times [2021-06-05 09:13:07,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:07,854 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416852323] [2021-06-05 09:13:07,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:08,006 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:08,006 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416852323] [2021-06-05 09:13:08,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416852323] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:08,006 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68073013] [2021-06-05 09:13:08,006 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 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 09:13:08,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 09:13:08,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:08,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 36 conjunts are in the unsatisfiable core [2021-06-05 09:13:08,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:08,114 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 09:13:08,115 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:08,120 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:08,120 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:08,120 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:13:08,149 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-06-05 09:13:08,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 12 treesize of output 14 [2021-06-05 09:13:08,151 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:08,157 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:08,158 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:08,159 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2021-06-05 09:13:08,193 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:13:08,193 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 09:13:08,195 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:08,201 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:08,202 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:08,202 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-06-05 09:13:08,246 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 11 treesize of output 7 [2021-06-05 09:13:08,247 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:08,253 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:08,254 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:08,255 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-06-05 09:13:08,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 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 09:13:08,320 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:08,327 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:08,329 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 09:13:08,329 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:13:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:08,351 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68073013] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:08,352 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:08,352 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 09:13:08,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187712565] [2021-06-05 09:13:08,352 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 09:13:08,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:08,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 09:13:08,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:13:08,353 INFO L87 Difference]: Start difference. First operand 4039 states and 11466 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:13:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:08,601 INFO L93 Difference]: Finished difference Result 4195 states and 11944 transitions. [2021-06-05 09:13:08,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:13:08,602 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 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 51 [2021-06-05 09:13:08,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:08,612 INFO L225 Difference]: With dead ends: 4195 [2021-06-05 09:13:08,613 INFO L226 Difference]: Without dead ends: 4131 [2021-06-05 09:13:08,613 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 191.0ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:13:08,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4131 states. [2021-06-05 09:13:08,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4131 to 3963. [2021-06-05 09:13:08,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3963 states, 3955 states have (on average 2.838432364096081) internal successors, (11226), 3962 states have internal predecessors, (11226), 0 states have call successors, (0), 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 09:13:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3963 states to 3963 states and 11226 transitions. [2021-06-05 09:13:08,704 INFO L78 Accepts]: Start accepts. Automaton has 3963 states and 11226 transitions. Word has length 51 [2021-06-05 09:13:08,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:08,704 INFO L482 AbstractCegarLoop]: Abstraction has 3963 states and 11226 transitions. [2021-06-05 09:13:08,704 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:13:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3963 states and 11226 transitions. [2021-06-05 09:13:08,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-06-05 09:13:08,708 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:08,708 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:08,922 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-06-05 09:13:08,922 INFO L430 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:08,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:08,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1632035735, now seen corresponding path program 2 times [2021-06-05 09:13:08,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:08,923 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158170463] [2021-06-05 09:13:08,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:09,113 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:09,113 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158170463] [2021-06-05 09:13:09,113 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158170463] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:09,113 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205944887] [2021-06-05 09:13:09,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:09,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:13:09,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:09,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 38 conjunts are in the unsatisfiable core [2021-06-05 09:13:09,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:09,223 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 09:13:09,224 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:09,228 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:09,229 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:09,229 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:13:09,299 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:13:09,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2021-06-05 09:13:09,301 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:09,309 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:09,311 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:09,311 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2021-06-05 09:13:09,380 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 09:13:09,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:13:09,383 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:09,392 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:09,394 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:09,395 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2021-06-05 09:13:09,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:13:09,419 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:09,426 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:09,426 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:09,427 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-06-05 09:13:09,496 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 19 treesize of output 18 [2021-06-05 09:13:09,498 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:09,506 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:09,508 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 09:13:09,508 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:13:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:09,533 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205944887] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:09,533 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:09,533 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 09:13:09,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5067696] [2021-06-05 09:13:09,534 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 09:13:09,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:09,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 09:13:09,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:13:09,535 INFO L87 Difference]: Start difference. First operand 3963 states and 11226 transitions. Second operand has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 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 09:13:09,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:09,891 INFO L93 Difference]: Finished difference Result 4017 states and 11481 transitions. [2021-06-05 09:13:09,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:13:09,892 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 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 51 [2021-06-05 09:13:09,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:09,906 INFO L225 Difference]: With dead ends: 4017 [2021-06-05 09:13:09,906 INFO L226 Difference]: Without dead ends: 3909 [2021-06-05 09:13:09,906 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 219.7ms TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:13:09,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3909 states. [2021-06-05 09:13:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3909 to 3741. [2021-06-05 09:13:09,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3735 states have (on average 2.8495314591700134) internal successors, (10643), 3740 states have internal predecessors, (10643), 0 states have call successors, (0), 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 09:13:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 10643 transitions. [2021-06-05 09:13:10,000 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 10643 transitions. Word has length 51 [2021-06-05 09:13:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:10,000 INFO L482 AbstractCegarLoop]: Abstraction has 3741 states and 10643 transitions. [2021-06-05 09:13:10,000 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 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 09:13:10,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 10643 transitions. [2021-06-05 09:13:10,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:10,006 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:10,006 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:10,228 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:10,229 INFO L430 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:10,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:10,229 INFO L82 PathProgramCache]: Analyzing trace with hash -322806260, now seen corresponding path program 1 times [2021-06-05 09:13:10,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:10,229 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868329798] [2021-06-05 09:13:10,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:10,369 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 09:13:10,369 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:10,369 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868329798] [2021-06-05 09:13:10,369 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868329798] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:10,369 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036672354] [2021-06-05 09:13:10,369 INFO L95 rtionOrderModulation]: Keeping assertion order 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 09:13:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:10,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 09:13:10,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:10,575 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 09:13:10,575 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:10,582 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:10,583 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:10,584 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-06-05 09:13:10,618 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 11 treesize of output 7 [2021-06-05 09:13:10,619 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:10,628 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:10,629 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 09:13:10,629 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2021-06-05 09:13:10,690 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:13:10,691 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 09:13:10,693 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:10,700 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:10,701 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:10,701 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2021-06-05 09:13:10,736 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 26 treesize of output 21 [2021-06-05 09:13:10,737 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:10,747 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:10,748 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 09:13:10,749 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2021-06-05 09:13:10,777 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 09:13:10,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036672354] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:10,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:10,777 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2021-06-05 09:13:10,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763708655] [2021-06-05 09:13:10,778 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 09:13:10,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:10,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 09:13:10,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:13:10,779 INFO L87 Difference]: Start difference. First operand 3741 states and 10643 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 09:13:11,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:11,069 INFO L93 Difference]: Finished difference Result 3916 states and 11205 transitions. [2021-06-05 09:13:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:13:11,070 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 54 [2021-06-05 09:13:11,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:11,075 INFO L225 Difference]: With dead ends: 3916 [2021-06-05 09:13:11,075 INFO L226 Difference]: Without dead ends: 3916 [2021-06-05 09:13:11,076 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 179.3ms TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:13:11,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2021-06-05 09:13:11,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 3876. [2021-06-05 09:13:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3876 states, 3870 states have (on average 2.8622739018087855) internal successors, (11077), 3875 states have internal predecessors, (11077), 0 states have call successors, (0), 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 09:13:11,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3876 states to 3876 states and 11077 transitions. [2021-06-05 09:13:11,156 INFO L78 Accepts]: Start accepts. Automaton has 3876 states and 11077 transitions. Word has length 54 [2021-06-05 09:13:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:11,156 INFO L482 AbstractCegarLoop]: Abstraction has 3876 states and 11077 transitions. [2021-06-05 09:13:11,156 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 09:13:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3876 states and 11077 transitions. [2021-06-05 09:13:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:11,161 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:11,161 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:11,385 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 09:13:11,385 INFO L430 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:11,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:11,386 INFO L82 PathProgramCache]: Analyzing trace with hash -376133110, now seen corresponding path program 1 times [2021-06-05 09:13:11,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:11,386 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999459233] [2021-06-05 09:13:11,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:11,479 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 09:13:11,480 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:11,480 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999459233] [2021-06-05 09:13:11,480 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999459233] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:11,480 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422547913] [2021-06-05 09:13:11,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:11,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 21 conjunts are in the unsatisfiable core [2021-06-05 09:13:11,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:11,683 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 11 treesize of output 7 [2021-06-05 09:13:11,684 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:11,691 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:11,692 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 09:13:11,693 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:13:11,715 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 09:13:11,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422547913] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:11,715 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:11,716 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2021-06-05 09:13:11,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813017309] [2021-06-05 09:13:11,716 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:13:11,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:11,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:13:11,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:13:11,717 INFO L87 Difference]: Start difference. First operand 3876 states and 11077 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 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 09:13:11,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:11,915 INFO L93 Difference]: Finished difference Result 3921 states and 11223 transitions. [2021-06-05 09:13:11,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:13:11,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 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 54 [2021-06-05 09:13:11,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:11,922 INFO L225 Difference]: With dead ends: 3921 [2021-06-05 09:13:11,922 INFO L226 Difference]: Without dead ends: 3921 [2021-06-05 09:13:11,922 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 78.1ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:13:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3921 states. [2021-06-05 09:13:11,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3921 to 3881. [2021-06-05 09:13:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3881 states, 3875 states have (on average 2.862709677419355) internal successors, (11093), 3880 states have internal predecessors, (11093), 0 states have call successors, (0), 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 09:13:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3881 states to 3881 states and 11093 transitions. [2021-06-05 09:13:12,001 INFO L78 Accepts]: Start accepts. Automaton has 3881 states and 11093 transitions. Word has length 54 [2021-06-05 09:13:12,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:12,001 INFO L482 AbstractCegarLoop]: Abstraction has 3881 states and 11093 transitions. [2021-06-05 09:13:12,002 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 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 09:13:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 3881 states and 11093 transitions. [2021-06-05 09:13:12,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:12,007 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:12,007 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:12,228 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-06-05 09:13:12,229 INFO L430 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:12,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:12,229 INFO L82 PathProgramCache]: Analyzing trace with hash 644254272, now seen corresponding path program 2 times [2021-06-05 09:13:12,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:12,229 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553426259] [2021-06-05 09:13:12,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:12,344 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:12,344 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553426259] [2021-06-05 09:13:12,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553426259] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:12,344 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108192109] [2021-06-05 09:13:12,344 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 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 09:13:12,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:13:12,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:12,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 09:13:12,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:12,523 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 09:13:12,524 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:12,531 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:12,532 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:12,532 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-06-05 09:13:12,577 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:13:12,577 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 09:13:12,579 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:12,585 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:12,586 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:12,586 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2021-06-05 09:13:12,618 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 11 treesize of output 7 [2021-06-05 09:13:12,619 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:12,627 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:12,629 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 09:13:12,629 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2021-06-05 09:13:12,663 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 26 treesize of output 21 [2021-06-05 09:13:12,665 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:12,675 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:12,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 09:13:12,677 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2021-06-05 09:13:12,701 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:12,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108192109] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:12,702 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:12,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2021-06-05 09:13:12,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674962456] [2021-06-05 09:13:12,702 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 09:13:12,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:12,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 09:13:12,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:13:12,703 INFO L87 Difference]: Start difference. First operand 3881 states and 11093 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 09:13:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:13,057 INFO L93 Difference]: Finished difference Result 3936 states and 11269 transitions. [2021-06-05 09:13:13,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:13:13,058 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 54 [2021-06-05 09:13:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:13,064 INFO L225 Difference]: With dead ends: 3936 [2021-06-05 09:13:13,064 INFO L226 Difference]: Without dead ends: 3936 [2021-06-05 09:13:13,064 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 193.7ms TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:13:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3936 states. [2021-06-05 09:13:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3936 to 3886. [2021-06-05 09:13:13,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3886 states, 3880 states have (on average 2.8631443298969073) internal successors, (11109), 3885 states have internal predecessors, (11109), 0 states have call successors, (0), 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 09:13:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 11109 transitions. [2021-06-05 09:13:13,144 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 11109 transitions. Word has length 54 [2021-06-05 09:13:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:13,144 INFO L482 AbstractCegarLoop]: Abstraction has 3886 states and 11109 transitions. [2021-06-05 09:13:13,144 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 09:13:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 11109 transitions. [2021-06-05 09:13:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:13,149 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:13,149 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:13,364 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-06-05 09:13:13,365 INFO L430 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:13,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:13,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1925233566, now seen corresponding path program 3 times [2021-06-05 09:13:13,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:13,365 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730603538] [2021-06-05 09:13:13,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:13:13,465 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:13,465 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730603538] [2021-06-05 09:13:13,465 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730603538] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:13,465 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659953011] [2021-06-05 09:13:13,465 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 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 09:13:13,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:13:13,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:13,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 09:13:13,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:13,690 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 16 treesize of output 12 [2021-06-05 09:13:13,691 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:13,699 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:13,704 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:13,705 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:46 [2021-06-05 09:13:13,744 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:13:13,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659953011] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:13:13,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:13:13,745 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2021-06-05 09:13:13,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275957256] [2021-06-05 09:13:13,745 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 09:13:13,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:13,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 09:13:13,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:13:13,746 INFO L87 Difference]: Start difference. First operand 3886 states and 11109 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:13:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:13,828 INFO L93 Difference]: Finished difference Result 3968 states and 11364 transitions. [2021-06-05 09:13:13,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 09:13:13,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:13,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:13,834 INFO L225 Difference]: With dead ends: 3968 [2021-06-05 09:13:13,834 INFO L226 Difference]: Without dead ends: 3968 [2021-06-05 09:13:13,834 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 126.4ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:13:13,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2021-06-05 09:13:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3853. [2021-06-05 09:13:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3853 states, 3847 states have (on average 2.8583311671432283) internal successors, (10996), 3852 states have internal predecessors, (10996), 0 states have call successors, (0), 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 09:13:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 10996 transitions. [2021-06-05 09:13:13,926 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 10996 transitions. Word has length 54 [2021-06-05 09:13:13,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:13,926 INFO L482 AbstractCegarLoop]: Abstraction has 3853 states and 10996 transitions. [2021-06-05 09:13:13,926 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:13:13,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 10996 transitions. [2021-06-05 09:13:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:13,931 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:13,931 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:14,152 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-06-05 09:13:14,153 INFO L430 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:14,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:14,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1978560416, now seen corresponding path program 2 times [2021-06-05 09:13:14,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:14,154 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306533233] [2021-06-05 09:13:14,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:14,268 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:14,268 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306533233] [2021-06-05 09:13:14,268 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306533233] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:14,268 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100525140] [2021-06-05 09:13:14,268 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 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 09:13:14,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:13:14,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:14,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 09:13:14,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:14,449 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 09:13:14,450 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:14,457 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:14,457 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:14,458 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2021-06-05 09:13:14,488 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:13:14,489 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 09:13:14,491 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:14,498 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:14,499 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:14,499 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2021-06-05 09:13:14,532 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 11 treesize of output 7 [2021-06-05 09:13:14,533 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:14,542 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:14,544 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 09:13:14,544 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2021-06-05 09:13:14,580 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 26 treesize of output 21 [2021-06-05 09:13:14,582 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:14,592 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:14,597 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 09:13:14,597 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2021-06-05 09:13:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:14,621 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100525140] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:14,621 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:14,622 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2021-06-05 09:13:14,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28514893] [2021-06-05 09:13:14,622 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 09:13:14,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:14,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 09:13:14,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:13:14,623 INFO L87 Difference]: Start difference. First operand 3853 states and 10996 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:13:15,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:15,025 INFO L93 Difference]: Finished difference Result 3938 states and 11268 transitions. [2021-06-05 09:13:15,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:13:15,025 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:15,030 INFO L225 Difference]: With dead ends: 3938 [2021-06-05 09:13:15,030 INFO L226 Difference]: Without dead ends: 3938 [2021-06-05 09:13:15,030 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 181.6ms TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:13:15,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2021-06-05 09:13:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3913. [2021-06-05 09:13:15,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3913 states, 3907 states have (on average 2.8635781929869464) internal successors, (11188), 3912 states have internal predecessors, (11188), 0 states have call successors, (0), 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 09:13:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 11188 transitions. [2021-06-05 09:13:15,121 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 11188 transitions. Word has length 54 [2021-06-05 09:13:15,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:15,122 INFO L482 AbstractCegarLoop]: Abstraction has 3913 states and 11188 transitions. [2021-06-05 09:13:15,122 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:13:15,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 11188 transitions. [2021-06-05 09:13:15,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:15,126 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:15,126 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:15,340 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:15,340 INFO L430 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:15,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:15,341 INFO L82 PathProgramCache]: Analyzing trace with hash -509370388, now seen corresponding path program 3 times [2021-06-05 09:13:15,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:15,341 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800051710] [2021-06-05 09:13:15,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:15,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:13:15,454 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:15,454 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800051710] [2021-06-05 09:13:15,455 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800051710] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:15,455 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709391983] [2021-06-05 09:13:15,455 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 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 09:13:15,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 09:13:15,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:15,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 36 conjunts are in the unsatisfiable core [2021-06-05 09:13:15,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:15,621 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 11 treesize of output 7 [2021-06-05 09:13:15,626 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:15,630 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:15,631 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:15,631 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:10 [2021-06-05 09:13:15,694 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 09:13:15,695 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:15,702 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:15,703 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:15,703 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-06-05 09:13:15,730 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:13:15,730 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 09:13:15,739 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:15,748 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:15,749 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:15,749 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2021-06-05 09:13:15,793 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 11 treesize of output 7 [2021-06-05 09:13:15,794 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:15,804 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:15,805 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 09:13:15,805 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2021-06-05 09:13:15,849 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 26 treesize of output 21 [2021-06-05 09:13:15,851 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:15,860 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:15,863 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 09:13:15,863 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2021-06-05 09:13:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:13:15,888 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709391983] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:15,888 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:15,888 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2021-06-05 09:13:15,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709869419] [2021-06-05 09:13:15,888 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 09:13:15,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:15,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 09:13:15,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:13:15,889 INFO L87 Difference]: Start difference. First operand 3913 states and 11188 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:13:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:16,332 INFO L93 Difference]: Finished difference Result 3994 states and 11446 transitions. [2021-06-05 09:13:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:13:16,333 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:16,338 INFO L225 Difference]: With dead ends: 3994 [2021-06-05 09:13:16,338 INFO L226 Difference]: Without dead ends: 3994 [2021-06-05 09:13:16,339 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 196.8ms TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:13:16,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2021-06-05 09:13:16,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3923. [2021-06-05 09:13:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3923 states, 3917 states have (on average 2.8644370691856014) internal successors, (11220), 3922 states have internal predecessors, (11220), 0 states have call successors, (0), 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 09:13:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 11220 transitions. [2021-06-05 09:13:16,422 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 11220 transitions. Word has length 54 [2021-06-05 09:13:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:16,422 INFO L482 AbstractCegarLoop]: Abstraction has 3923 states and 11220 transitions. [2021-06-05 09:13:16,422 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:13:16,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 11220 transitions. [2021-06-05 09:13:16,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:16,427 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:16,427 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:16,642 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:16,644 INFO L430 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:16,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:16,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1998775384, now seen corresponding path program 4 times [2021-06-05 09:13:16,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:16,647 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9272748] [2021-06-05 09:13:16,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:13:16,781 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:16,781 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9272748] [2021-06-05 09:13:16,781 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9272748] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:16,781 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755956311] [2021-06-05 09:13:16,782 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 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 09:13:16,868 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:13:16,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:16,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 09:13:16,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:16,994 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 09:13:16,995 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:17,002 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:17,003 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:17,003 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-06-05 09:13:17,031 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 11 treesize of output 7 [2021-06-05 09:13:17,032 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:17,041 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:17,042 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 09:13:17,042 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2021-06-05 09:13:17,070 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:13:17,071 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 09:13:17,072 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:17,080 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:17,081 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:17,081 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2021-06-05 09:13:17,124 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 26 treesize of output 21 [2021-06-05 09:13:17,126 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:17,135 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:17,137 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 09:13:17,137 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2021-06-05 09:13:17,167 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:13:17,167 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755956311] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:17,167 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:17,168 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2021-06-05 09:13:17,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895296492] [2021-06-05 09:13:17,169 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 09:13:17,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:17,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 09:13:17,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:13:17,170 INFO L87 Difference]: Start difference. First operand 3923 states and 11220 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:13:17,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:17,434 INFO L93 Difference]: Finished difference Result 3989 states and 11430 transitions. [2021-06-05 09:13:17,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:13:17,434 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:17,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:17,439 INFO L225 Difference]: With dead ends: 3989 [2021-06-05 09:13:17,439 INFO L226 Difference]: Without dead ends: 3989 [2021-06-05 09:13:17,439 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 183.0ms TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:13:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3989 states. [2021-06-05 09:13:17,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3989 to 3933. [2021-06-05 09:13:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3933 states, 3927 states have (on average 2.865291571173924) internal successors, (11252), 3932 states have internal predecessors, (11252), 0 states have call successors, (0), 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 09:13:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3933 states to 3933 states and 11252 transitions. [2021-06-05 09:13:17,501 INFO L78 Accepts]: Start accepts. Automaton has 3933 states and 11252 transitions. Word has length 54 [2021-06-05 09:13:17,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:17,502 INFO L482 AbstractCegarLoop]: Abstraction has 3933 states and 11252 transitions. [2021-06-05 09:13:17,502 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:13:17,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3933 states and 11252 transitions. [2021-06-05 09:13:17,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:17,506 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:17,506 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:17,719 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-06-05 09:13:17,719 INFO L430 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:17,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:17,720 INFO L82 PathProgramCache]: Analyzing trace with hash -5499510, now seen corresponding path program 1 times [2021-06-05 09:13:17,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:17,720 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548026698] [2021-06-05 09:13:17,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:17,927 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:17,927 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548026698] [2021-06-05 09:13:17,927 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548026698] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:17,927 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632716858] [2021-06-05 09:13:17,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 09:13:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:18,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 09:13:18,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:18,049 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 09:13:18,050 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:18,055 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:18,056 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:18,056 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2021-06-05 09:13:18,109 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:13:18,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2021-06-05 09:13:18,111 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:18,120 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:18,121 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:18,122 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:24 [2021-06-05 09:13:18,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:13:18,177 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:18,187 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:18,189 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 09:13:18,190 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-06-05 09:13:18,337 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 09:13:18,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:13:18,340 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:18,349 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:18,351 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:18,351 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:18 [2021-06-05 09:13:18,381 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 19 treesize of output 18 [2021-06-05 09:13:18,383 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:18,391 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:18,392 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 09:13:18,392 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:13:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:18,416 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632716858] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:18,416 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:18,416 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 09:13:18,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110328360] [2021-06-05 09:13:18,417 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 09:13:18,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:18,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 09:13:18,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:13:18,417 INFO L87 Difference]: Start difference. First operand 3933 states and 11252 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 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 09:13:19,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:19,006 INFO L93 Difference]: Finished difference Result 4392 states and 12702 transitions. [2021-06-05 09:13:19,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 09:13:19,007 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:19,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:19,014 INFO L225 Difference]: With dead ends: 4392 [2021-06-05 09:13:19,014 INFO L226 Difference]: Without dead ends: 4368 [2021-06-05 09:13:19,014 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 301.4ms TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2021-06-05 09:13:19,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4368 states. [2021-06-05 09:13:19,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4368 to 4053. [2021-06-05 09:13:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4053 states, 4047 states have (on average 2.869285890783296) internal successors, (11612), 4052 states have internal predecessors, (11612), 0 states have call successors, (0), 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 09:13:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 11612 transitions. [2021-06-05 09:13:19,091 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 11612 transitions. Word has length 54 [2021-06-05 09:13:19,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:19,092 INFO L482 AbstractCegarLoop]: Abstraction has 4053 states and 11612 transitions. [2021-06-05 09:13:19,092 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 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 09:13:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 11612 transitions. [2021-06-05 09:13:19,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:19,096 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:19,096 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:19,316 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:19,317 INFO L430 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:19,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:19,317 INFO L82 PathProgramCache]: Analyzing trace with hash 74755808, now seen corresponding path program 2 times [2021-06-05 09:13:19,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:19,318 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100449986] [2021-06-05 09:13:19,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:19,405 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:19,405 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100449986] [2021-06-05 09:13:19,405 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100449986] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:19,405 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934297988] [2021-06-05 09:13:19,406 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 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 09:13:19,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:13:19,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:19,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 09:13:19,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:19,567 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 16 treesize of output 12 [2021-06-05 09:13:19,568 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:19,577 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:19,581 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:19,581 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:84 [2021-06-05 09:13:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:13:19,631 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934297988] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:13:19,631 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:13:19,631 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2021-06-05 09:13:19,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143766957] [2021-06-05 09:13:19,631 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 09:13:19,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:19,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 09:13:19,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:13:19,632 INFO L87 Difference]: Start difference. First operand 4053 states and 11612 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:13:19,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:19,732 INFO L93 Difference]: Finished difference Result 3595 states and 10220 transitions. [2021-06-05 09:13:19,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 09:13:19,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:19,737 INFO L225 Difference]: With dead ends: 3595 [2021-06-05 09:13:19,737 INFO L226 Difference]: Without dead ends: 3535 [2021-06-05 09:13:19,738 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 101.4ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:13:19,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3535 states. [2021-06-05 09:13:19,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3535 to 3415. [2021-06-05 09:13:19,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3415 states, 3412 states have (on average 2.813012895662368) internal successors, (9598), 3414 states have internal predecessors, (9598), 0 states have call successors, (0), 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 09:13:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 9598 transitions. [2021-06-05 09:13:19,795 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 9598 transitions. Word has length 54 [2021-06-05 09:13:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:19,795 INFO L482 AbstractCegarLoop]: Abstraction has 3415 states and 9598 transitions. [2021-06-05 09:13:19,796 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:13:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 9598 transitions. [2021-06-05 09:13:19,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:19,799 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:19,799 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:20,020 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-06-05 09:13:20,021 INFO L430 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:20,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:20,021 INFO L82 PathProgramCache]: Analyzing trace with hash 5222110, now seen corresponding path program 1 times [2021-06-05 09:13:20,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:20,021 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602570616] [2021-06-05 09:13:20,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:20,157 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:20,157 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:20,157 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602570616] [2021-06-05 09:13:20,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602570616] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:20,157 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81348410] [2021-06-05 09:13:20,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:20,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 35 conjunts are in the unsatisfiable core [2021-06-05 09:13:20,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:20,277 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 09:13:20,277 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:20,282 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:20,283 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:20,283 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:13:20,314 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-06-05 09:13:20,314 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 12 treesize of output 14 [2021-06-05 09:13:20,316 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:20,321 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:20,324 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:20,324 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2021-06-05 09:13:20,383 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:13:20,384 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 09:13:20,385 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:20,392 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:20,393 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:20,393 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2021-06-05 09:13:20,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:13:20,419 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:20,428 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:20,429 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 09:13:20,429 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2021-06-05 09:13:20,458 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 26 treesize of output 21 [2021-06-05 09:13:20,459 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:20,468 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:20,470 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 09:13:20,470 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2021-06-05 09:13:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:20,494 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81348410] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:20,494 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:20,495 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2021-06-05 09:13:20,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825939559] [2021-06-05 09:13:20,495 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 09:13:20,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:20,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 09:13:20,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:13:20,496 INFO L87 Difference]: Start difference. First operand 3415 states and 9598 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:13:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:20,938 INFO L93 Difference]: Finished difference Result 3532 states and 9956 transitions. [2021-06-05 09:13:20,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:13:20,939 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:20,943 INFO L225 Difference]: With dead ends: 3532 [2021-06-05 09:13:20,944 INFO L226 Difference]: Without dead ends: 3519 [2021-06-05 09:13:20,944 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 188.0ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:13:20,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2021-06-05 09:13:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 3475. [2021-06-05 09:13:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3475 states, 3472 states have (on average 2.8162442396313363) internal successors, (9778), 3474 states have internal predecessors, (9778), 0 states have call successors, (0), 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 09:13:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 3475 states and 9778 transitions. [2021-06-05 09:13:21,003 INFO L78 Accepts]: Start accepts. Automaton has 3475 states and 9778 transitions. Word has length 54 [2021-06-05 09:13:21,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:21,003 INFO L482 AbstractCegarLoop]: Abstraction has 3475 states and 9778 transitions. [2021-06-05 09:13:21,003 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:13:21,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3475 states and 9778 transitions. [2021-06-05 09:13:21,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:21,007 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:21,007 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:21,227 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:21,227 INFO L430 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:21,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:21,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2077435872, now seen corresponding path program 5 times [2021-06-05 09:13:21,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:21,228 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961670484] [2021-06-05 09:13:21,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:21,345 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:21,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961670484] [2021-06-05 09:13:21,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961670484] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:21,346 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446560897] [2021-06-05 09:13:21,346 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 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 09:13:21,431 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 09:13:21,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:21,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 36 conjunts are in the unsatisfiable core [2021-06-05 09:13:21,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:21,487 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 09:13:21,488 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:21,492 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:21,493 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:21,493 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:13:21,640 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:13:21,640 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 09:13:21,642 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:21,653 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:21,654 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:21,655 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2021-06-05 09:13:21,710 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 09:13:21,710 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 23 treesize of output 30 [2021-06-05 09:13:21,717 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:21,733 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:21,739 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 09:13:21,739 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2021-06-05 09:13:21,775 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 26 treesize of output 21 [2021-06-05 09:13:21,776 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:21,785 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:21,787 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 09:13:21,787 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2021-06-05 09:13:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:21,812 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446560897] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:21,812 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:21,812 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2021-06-05 09:13:21,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513459522] [2021-06-05 09:13:21,812 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 09:13:21,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:21,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 09:13:21,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:13:21,813 INFO L87 Difference]: Start difference. First operand 3475 states and 9778 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 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 09:13:22,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:22,309 INFO L93 Difference]: Finished difference Result 3556 states and 10032 transitions. [2021-06-05 09:13:22,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:13:22,309 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:22,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:22,316 INFO L225 Difference]: With dead ends: 3556 [2021-06-05 09:13:22,316 INFO L226 Difference]: Without dead ends: 3543 [2021-06-05 09:13:22,316 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 211.5ms TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:13:22,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2021-06-05 09:13:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 3415. [2021-06-05 09:13:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3415 states, 3412 states have (on average 2.813012895662368) internal successors, (9598), 3414 states have internal predecessors, (9598), 0 states have call successors, (0), 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 09:13:22,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 9598 transitions. [2021-06-05 09:13:22,376 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 9598 transitions. Word has length 54 [2021-06-05 09:13:22,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:22,376 INFO L482 AbstractCegarLoop]: Abstraction has 3415 states and 9598 transitions. [2021-06-05 09:13:22,376 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 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 09:13:22,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 9598 transitions. [2021-06-05 09:13:22,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:22,380 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:22,380 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:22,600 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-06-05 09:13:22,601 INFO L430 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:22,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:22,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1126014214, now seen corresponding path program 2 times [2021-06-05 09:13:22,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:22,601 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834999994] [2021-06-05 09:13:22,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:22,772 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:22,772 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834999994] [2021-06-05 09:13:22,772 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834999994] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:13:22,772 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:13:22,772 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:13:22,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380135076] [2021-06-05 09:13:22,772 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:13:22,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:22,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:13:22,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:13:22,773 INFO L87 Difference]: Start difference. First operand 3415 states and 9598 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 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 09:13:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:23,012 INFO L93 Difference]: Finished difference Result 3462 states and 9743 transitions. [2021-06-05 09:13:23,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:13:23,012 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:23,016 INFO L225 Difference]: With dead ends: 3462 [2021-06-05 09:13:23,016 INFO L226 Difference]: Without dead ends: 3459 [2021-06-05 09:13:23,016 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 121.1ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:13:23,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3459 states. [2021-06-05 09:13:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3459 to 3426. [2021-06-05 09:13:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3426 states, 3423 states have (on average 2.8136137890739117) internal successors, (9631), 3425 states have internal predecessors, (9631), 0 states have call successors, (0), 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 09:13:23,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3426 states to 3426 states and 9631 transitions. [2021-06-05 09:13:23,058 INFO L78 Accepts]: Start accepts. Automaton has 3426 states and 9631 transitions. Word has length 54 [2021-06-05 09:13:23,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:23,058 INFO L482 AbstractCegarLoop]: Abstraction has 3426 states and 9631 transitions. [2021-06-05 09:13:23,058 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 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 09:13:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3426 states and 9631 transitions. [2021-06-05 09:13:23,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:23,062 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:23,062 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:23,062 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 09:13:23,062 INFO L430 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:23,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:23,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1304915770, now seen corresponding path program 6 times [2021-06-05 09:13:23,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:23,063 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701468927] [2021-06-05 09:13:23,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:23,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:23,166 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:23,166 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701468927] [2021-06-05 09:13:23,166 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701468927] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:13:23,166 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:13:23,166 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:13:23,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319453297] [2021-06-05 09:13:23,166 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:13:23,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:23,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:13:23,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:13:23,167 INFO L87 Difference]: Start difference. First operand 3426 states and 9631 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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 09:13:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:23,367 INFO L93 Difference]: Finished difference Result 3508 states and 9887 transitions. [2021-06-05 09:13:23,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:13:23,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:23,371 INFO L225 Difference]: With dead ends: 3508 [2021-06-05 09:13:23,371 INFO L226 Difference]: Without dead ends: 3505 [2021-06-05 09:13:23,371 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 78.3ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:13:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3505 states. [2021-06-05 09:13:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3505 to 3429. [2021-06-05 09:13:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3429 states, 3426 states have (on average 2.8137769994162287) internal successors, (9640), 3428 states have internal predecessors, (9640), 0 states have call successors, (0), 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 09:13:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 3429 states and 9640 transitions. [2021-06-05 09:13:23,415 INFO L78 Accepts]: Start accepts. Automaton has 3429 states and 9640 transitions. Word has length 54 [2021-06-05 09:13:23,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:23,415 INFO L482 AbstractCegarLoop]: Abstraction has 3429 states and 9640 transitions. [2021-06-05 09:13:23,415 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 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 09:13:23,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3429 states and 9640 transitions. [2021-06-05 09:13:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:23,418 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:23,418 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:23,418 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 09:13:23,418 INFO L430 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:23,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:23,418 INFO L82 PathProgramCache]: Analyzing trace with hash -695612282, now seen corresponding path program 3 times [2021-06-05 09:13:23,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:23,419 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172317052] [2021-06-05 09:13:23,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:13:23,527 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:23,528 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172317052] [2021-06-05 09:13:23,528 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172317052] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:13:23,528 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:13:23,528 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:13:23,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775684434] [2021-06-05 09:13:23,528 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:13:23,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:23,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:13:23,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:13:23,529 INFO L87 Difference]: Start difference. First operand 3429 states and 9640 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 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 09:13:23,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:23,713 INFO L93 Difference]: Finished difference Result 3527 states and 9944 transitions. [2021-06-05 09:13:23,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:13:23,713 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:23,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:23,717 INFO L225 Difference]: With dead ends: 3527 [2021-06-05 09:13:23,717 INFO L226 Difference]: Without dead ends: 3524 [2021-06-05 09:13:23,717 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 71.0ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:13:23,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3524 states. [2021-06-05 09:13:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3524 to 3422. [2021-06-05 09:13:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3422 states, 3419 states have (on average 2.8133957297455394) internal successors, (9619), 3421 states have internal predecessors, (9619), 0 states have call successors, (0), 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 09:13:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 9619 transitions. [2021-06-05 09:13:23,759 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 9619 transitions. Word has length 54 [2021-06-05 09:13:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:23,759 INFO L482 AbstractCegarLoop]: Abstraction has 3422 states and 9619 transitions. [2021-06-05 09:13:23,759 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 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 09:13:23,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 9619 transitions. [2021-06-05 09:13:23,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:23,762 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:23,762 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:23,763 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 09:13:23,763 INFO L430 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:23,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:23,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1735317702, now seen corresponding path program 7 times [2021-06-05 09:13:23,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:23,763 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444287538] [2021-06-05 09:13:23,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:23,861 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:13:23,862 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:23,862 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444287538] [2021-06-05 09:13:23,862 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444287538] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:13:23,862 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:13:23,862 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:13:23,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904193618] [2021-06-05 09:13:23,862 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:13:23,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:23,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:13:23,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:13:23,863 INFO L87 Difference]: Start difference. First operand 3422 states and 9619 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:13:24,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:24,031 INFO L93 Difference]: Finished difference Result 3501 states and 9866 transitions. [2021-06-05 09:13:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:13:24,032 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:24,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:24,035 INFO L225 Difference]: With dead ends: 3501 [2021-06-05 09:13:24,035 INFO L226 Difference]: Without dead ends: 3498 [2021-06-05 09:13:24,036 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 70.8ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:13:24,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2021-06-05 09:13:24,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 3418. [2021-06-05 09:13:24,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3418 states, 3415 states have (on average 2.813177159590044) internal successors, (9607), 3417 states have internal predecessors, (9607), 0 states have call successors, (0), 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 09:13:24,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 9607 transitions. [2021-06-05 09:13:24,079 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 9607 transitions. Word has length 54 [2021-06-05 09:13:24,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:24,079 INFO L482 AbstractCegarLoop]: Abstraction has 3418 states and 9607 transitions. [2021-06-05 09:13:24,079 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:13:24,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 9607 transitions. [2021-06-05 09:13:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:24,083 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:24,083 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:24,083 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 09:13:24,083 INFO L430 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:24,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:24,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2044192738, now seen corresponding path program 8 times [2021-06-05 09:13:24,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:24,084 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751420857] [2021-06-05 09:13:24,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:13:24,181 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:24,181 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751420857] [2021-06-05 09:13:24,181 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751420857] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:13:24,181 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:13:24,182 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:13:24,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051383273] [2021-06-05 09:13:24,182 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:13:24,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:24,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:13:24,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:13:24,185 INFO L87 Difference]: Start difference. First operand 3418 states and 9607 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:13:24,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:24,416 INFO L93 Difference]: Finished difference Result 3501 states and 9866 transitions. [2021-06-05 09:13:24,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:13:24,416 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:24,420 INFO L225 Difference]: With dead ends: 3501 [2021-06-05 09:13:24,420 INFO L226 Difference]: Without dead ends: 3498 [2021-06-05 09:13:24,420 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 74.3ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:13:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2021-06-05 09:13:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 3412. [2021-06-05 09:13:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3412 states, 3409 states have (on average 2.8125550014667056) internal successors, (9588), 3411 states have internal predecessors, (9588), 0 states have call successors, (0), 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 09:13:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 9588 transitions. [2021-06-05 09:13:24,469 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 9588 transitions. Word has length 54 [2021-06-05 09:13:24,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:24,469 INFO L482 AbstractCegarLoop]: Abstraction has 3412 states and 9588 transitions. [2021-06-05 09:13:24,469 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:13:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 9588 transitions. [2021-06-05 09:13:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:24,472 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:24,472 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:24,472 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 09:13:24,472 INFO L430 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:24,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:24,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1807875418, now seen corresponding path program 9 times [2021-06-05 09:13:24,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:24,473 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301168656] [2021-06-05 09:13:24,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:13:24,575 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:24,575 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301168656] [2021-06-05 09:13:24,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301168656] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:13:24,575 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:13:24,575 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:13:24,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431268285] [2021-06-05 09:13:24,575 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:13:24,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:24,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:13:24,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:13:24,576 INFO L87 Difference]: Start difference. First operand 3412 states and 9588 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:13:24,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:24,775 INFO L93 Difference]: Finished difference Result 3284 states and 9206 transitions. [2021-06-05 09:13:24,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:13:24,776 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:24,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:24,780 INFO L225 Difference]: With dead ends: 3284 [2021-06-05 09:13:24,780 INFO L226 Difference]: Without dead ends: 3278 [2021-06-05 09:13:24,781 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 77.7ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:13:24,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3278 states. [2021-06-05 09:13:24,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3278 to 3192. [2021-06-05 09:13:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3192 states, 3189 states have (on average 2.79711508309815) internal successors, (8920), 3191 states have internal predecessors, (8920), 0 states have call successors, (0), 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 09:13:24,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3192 states to 3192 states and 8920 transitions. [2021-06-05 09:13:24,823 INFO L78 Accepts]: Start accepts. Automaton has 3192 states and 8920 transitions. Word has length 54 [2021-06-05 09:13:24,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:24,823 INFO L482 AbstractCegarLoop]: Abstraction has 3192 states and 8920 transitions. [2021-06-05 09:13:24,823 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:13:24,823 INFO L276 IsEmpty]: Start isEmpty. Operand 3192 states and 8920 transitions. [2021-06-05 09:13:24,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:24,827 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:24,827 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:24,827 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 09:13:24,827 INFO L430 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:24,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:24,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1164272426, now seen corresponding path program 4 times [2021-06-05 09:13:24,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:24,827 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442909985] [2021-06-05 09:13:24,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:24,928 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:24,928 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442909985] [2021-06-05 09:13:24,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442909985] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:24,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499584173] [2021-06-05 09:13:24,929 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 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 09:13:25,006 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:13:25,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:25,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 09:13:25,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:25,076 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 09:13:25,077 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:25,082 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:25,083 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:25,083 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2021-06-05 09:13:25,128 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:13:25,129 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 09:13:25,130 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:25,137 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:25,138 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:25,138 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2021-06-05 09:13:25,162 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 11 treesize of output 7 [2021-06-05 09:13:25,163 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:25,171 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:25,172 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 09:13:25,173 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2021-06-05 09:13:25,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 26 treesize of output 21 [2021-06-05 09:13:25,203 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:25,211 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:25,213 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 09:13:25,213 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2021-06-05 09:13:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:25,236 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499584173] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:25,236 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:25,236 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2021-06-05 09:13:25,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430394061] [2021-06-05 09:13:25,236 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 09:13:25,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:25,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 09:13:25,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:13:25,237 INFO L87 Difference]: Start difference. First operand 3192 states and 8920 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 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 09:13:25,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:25,629 INFO L93 Difference]: Finished difference Result 3261 states and 9132 transitions. [2021-06-05 09:13:25,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:13:25,629 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:25,633 INFO L225 Difference]: With dead ends: 3261 [2021-06-05 09:13:25,633 INFO L226 Difference]: Without dead ends: 3248 [2021-06-05 09:13:25,633 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 157.4ms TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:13:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2021-06-05 09:13:25,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 3132. [2021-06-05 09:13:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 3129 states have (on average 2.7900287631831255) internal successors, (8730), 3131 states have internal predecessors, (8730), 0 states have call successors, (0), 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 09:13:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 8730 transitions. [2021-06-05 09:13:25,669 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 8730 transitions. Word has length 54 [2021-06-05 09:13:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:25,670 INFO L482 AbstractCegarLoop]: Abstraction has 3132 states and 8730 transitions. [2021-06-05 09:13:25,670 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 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 09:13:25,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 8730 transitions. [2021-06-05 09:13:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:25,673 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:25,673 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:25,874 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-06-05 09:13:25,874 INFO L430 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:25,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:25,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1825783446, now seen corresponding path program 5 times [2021-06-05 09:13:25,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:25,875 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262573756] [2021-06-05 09:13:25,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:25,972 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:25,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262573756] [2021-06-05 09:13:25,972 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262573756] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:25,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134054984] [2021-06-05 09:13:25,972 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 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 09:13:26,051 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 09:13:26,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:26,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 36 conjunts are in the unsatisfiable core [2021-06-05 09:13:26,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:26,230 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 09:13:26,231 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:26,241 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:26,244 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:26,244 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2021-06-05 09:13:26,283 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:13:26,284 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 09:13:26,286 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:26,296 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:26,298 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:26,298 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2021-06-05 09:13:26,359 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 09:13:26,360 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 23 treesize of output 30 [2021-06-05 09:13:26,362 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:26,378 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:26,380 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 09:13:26,381 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2021-06-05 09:13:26,412 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 26 treesize of output 21 [2021-06-05 09:13:26,413 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:26,422 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:26,423 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 09:13:26,424 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2021-06-05 09:13:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:26,450 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134054984] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:26,451 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:26,451 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 15 [2021-06-05 09:13:26,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216648031] [2021-06-05 09:13:26,452 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 09:13:26,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:26,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 09:13:26,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:13:26,452 INFO L87 Difference]: Start difference. First operand 3132 states and 8730 transitions. Second operand has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 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 09:13:27,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:27,013 INFO L93 Difference]: Finished difference Result 3402 states and 9542 transitions. [2021-06-05 09:13:27,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 09:13:27,024 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:27,028 INFO L225 Difference]: With dead ends: 3402 [2021-06-05 09:13:27,028 INFO L226 Difference]: Without dead ends: 3399 [2021-06-05 09:13:27,028 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 273.7ms TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:13:27,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2021-06-05 09:13:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3144. [2021-06-05 09:13:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3144 states, 3141 states have (on average 2.7911493155046165) internal successors, (8767), 3143 states have internal predecessors, (8767), 0 states have call successors, (0), 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 09:13:27,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3144 states to 3144 states and 8767 transitions. [2021-06-05 09:13:27,101 INFO L78 Accepts]: Start accepts. Automaton has 3144 states and 8767 transitions. Word has length 54 [2021-06-05 09:13:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:27,102 INFO L482 AbstractCegarLoop]: Abstraction has 3144 states and 8767 transitions. [2021-06-05 09:13:27,102 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 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 09:13:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 8767 transitions. [2021-06-05 09:13:27,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:27,106 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:27,106 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:27,320 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:27,321 INFO L430 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:27,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:27,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1318932780, now seen corresponding path program 6 times [2021-06-05 09:13:27,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:27,321 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805693005] [2021-06-05 09:13:27,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:27,412 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:27,412 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:27,412 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805693005] [2021-06-05 09:13:27,412 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805693005] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:27,412 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603942638] [2021-06-05 09:13:27,413 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 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 09:13:27,497 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 09:13:27,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:27,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 09:13:27,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:27,611 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 09:13:27,612 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:27,618 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:27,619 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:27,619 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-06-05 09:13:27,650 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 11 treesize of output 7 [2021-06-05 09:13:27,651 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:27,659 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:27,660 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 09:13:27,661 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2021-06-05 09:13:27,683 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:13:27,684 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 09:13:27,685 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:27,691 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:27,692 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:27,692 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2021-06-05 09:13:27,719 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 26 treesize of output 21 [2021-06-05 09:13:27,720 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:27,727 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:27,731 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 09:13:27,731 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2021-06-05 09:13:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:27,762 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603942638] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:27,762 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:27,762 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2021-06-05 09:13:27,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703420165] [2021-06-05 09:13:27,762 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 09:13:27,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:27,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 09:13:27,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:13:27,763 INFO L87 Difference]: Start difference. First operand 3144 states and 8767 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 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 09:13:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:28,059 INFO L93 Difference]: Finished difference Result 3208 states and 8963 transitions. [2021-06-05 09:13:28,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:13:28,059 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:28,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:28,063 INFO L225 Difference]: With dead ends: 3208 [2021-06-05 09:13:28,063 INFO L226 Difference]: Without dead ends: 3182 [2021-06-05 09:13:28,063 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 151.2ms TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:13:28,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2021-06-05 09:13:28,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 3132. [2021-06-05 09:13:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 3129 states have (on average 2.786832853946948) internal successors, (8720), 3131 states have internal predecessors, (8720), 0 states have call successors, (0), 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 09:13:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 8720 transitions. [2021-06-05 09:13:28,105 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 8720 transitions. Word has length 54 [2021-06-05 09:13:28,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:28,105 INFO L482 AbstractCegarLoop]: Abstraction has 3132 states and 8720 transitions. [2021-06-05 09:13:28,105 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 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 09:13:28,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 8720 transitions. [2021-06-05 09:13:28,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:28,107 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:28,108 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:28,308 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-06-05 09:13:28,308 INFO L430 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:28,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:28,309 INFO L82 PathProgramCache]: Analyzing trace with hash 562511762, now seen corresponding path program 7 times [2021-06-05 09:13:28,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:28,309 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190642331] [2021-06-05 09:13:28,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:13:28,404 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:28,404 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190642331] [2021-06-05 09:13:28,404 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190642331] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:13:28,404 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:13:28,404 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:13:28,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195644729] [2021-06-05 09:13:28,404 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:13:28,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:28,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:13:28,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:13:28,405 INFO L87 Difference]: Start difference. First operand 3132 states and 8720 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:13:28,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:28,617 INFO L93 Difference]: Finished difference Result 3205 states and 8944 transitions. [2021-06-05 09:13:28,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:13:28,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:28,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:28,621 INFO L225 Difference]: With dead ends: 3205 [2021-06-05 09:13:28,621 INFO L226 Difference]: Without dead ends: 3202 [2021-06-05 09:13:28,621 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 70.1ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:13:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2021-06-05 09:13:28,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 3132. [2021-06-05 09:13:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 3129 states have (on average 2.78651326302333) internal successors, (8719), 3131 states have internal predecessors, (8719), 0 states have call successors, (0), 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 09:13:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 8719 transitions. [2021-06-05 09:13:28,657 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 8719 transitions. Word has length 54 [2021-06-05 09:13:28,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:28,657 INFO L482 AbstractCegarLoop]: Abstraction has 3132 states and 8719 transitions. [2021-06-05 09:13:28,657 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:13:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 8719 transitions. [2021-06-05 09:13:28,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:28,660 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:28,660 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:28,660 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-05 09:13:28,660 INFO L430 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:28,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:28,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1851916652, now seen corresponding path program 8 times [2021-06-05 09:13:28,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:28,661 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408566358] [2021-06-05 09:13:28,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:13:28,756 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:28,756 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408566358] [2021-06-05 09:13:28,756 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408566358] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:13:28,756 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:13:28,756 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:13:28,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239715231] [2021-06-05 09:13:28,756 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:13:28,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:28,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:13:28,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:13:28,757 INFO L87 Difference]: Start difference. First operand 3132 states and 8719 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:13:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:28,947 INFO L93 Difference]: Finished difference Result 3184 states and 8877 transitions. [2021-06-05 09:13:28,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:13:28,948 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:28,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:28,952 INFO L225 Difference]: With dead ends: 3184 [2021-06-05 09:13:28,952 INFO L226 Difference]: Without dead ends: 3178 [2021-06-05 09:13:28,954 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 74.7ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:13:28,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2021-06-05 09:13:28,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 3108. [2021-06-05 09:13:28,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3108 states, 3105 states have (on average 2.7838969404186797) internal successors, (8644), 3107 states have internal predecessors, (8644), 0 states have call successors, (0), 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 09:13:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 8644 transitions. [2021-06-05 09:13:29,005 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 8644 transitions. Word has length 54 [2021-06-05 09:13:29,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:29,005 INFO L482 AbstractCegarLoop]: Abstraction has 3108 states and 8644 transitions. [2021-06-05 09:13:29,005 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:13:29,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 8644 transitions. [2021-06-05 09:13:29,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:13:29,009 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:29,009 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:29,009 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-05 09:13:29,009 INFO L430 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:29,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:29,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1314285938, now seen corresponding path program 9 times [2021-06-05 09:13:29,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:29,010 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286171090] [2021-06-05 09:13:29,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:13:29,120 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:29,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286171090] [2021-06-05 09:13:29,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286171090] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:13:29,120 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:13:29,120 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:13:29,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151392209] [2021-06-05 09:13:29,121 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:13:29,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:29,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:13:29,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:13:29,122 INFO L87 Difference]: Start difference. First operand 3108 states and 8644 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:13:29,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:29,304 INFO L93 Difference]: Finished difference Result 2969 states and 8227 transitions. [2021-06-05 09:13:29,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:13:29,305 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:13:29,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:29,308 INFO L225 Difference]: With dead ends: 2969 [2021-06-05 09:13:29,309 INFO L226 Difference]: Without dead ends: 2966 [2021-06-05 09:13:29,309 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 70.8ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:13:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2021-06-05 09:13:29,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2903. [2021-06-05 09:13:29,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2903 states, 2900 states have (on average 2.766896551724138) internal successors, (8024), 2902 states have internal predecessors, (8024), 0 states have call successors, (0), 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 09:13:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 8024 transitions. [2021-06-05 09:13:29,354 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 8024 transitions. Word has length 54 [2021-06-05 09:13:29,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:29,355 INFO L482 AbstractCegarLoop]: Abstraction has 2903 states and 8024 transitions. [2021-06-05 09:13:29,355 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:13:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 8024 transitions. [2021-06-05 09:13:29,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:13:29,359 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:29,359 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:29,359 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-05 09:13:29,359 INFO L430 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:29,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:29,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1462099874, now seen corresponding path program 1 times [2021-06-05 09:13:29,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:29,360 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275552316] [2021-06-05 09:13:29,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:29,442 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 09:13:29,443 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:29,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275552316] [2021-06-05 09:13:29,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275552316] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:29,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344771457] [2021-06-05 09:13:29,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 09:13:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:29,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 09:13:29,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:29,669 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 11 treesize of output 7 [2021-06-05 09:13:29,670 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:29,677 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:29,678 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 09:13:29,678 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:13:29,699 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 09:13:29,699 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344771457] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:29,700 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:29,700 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2021-06-05 09:13:29,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606044695] [2021-06-05 09:13:29,700 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 09:13:29,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:29,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 09:13:29,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:13:29,701 INFO L87 Difference]: Start difference. First operand 2903 states and 8024 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 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 09:13:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:29,995 INFO L93 Difference]: Finished difference Result 3847 states and 10696 transitions. [2021-06-05 09:13:29,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:13:29,995 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 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 09:13:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:30,000 INFO L225 Difference]: With dead ends: 3847 [2021-06-05 09:13:30,000 INFO L226 Difference]: Without dead ends: 3287 [2021-06-05 09:13:30,000 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 120.2ms TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:13:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3287 states. [2021-06-05 09:13:30,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3287 to 2903. [2021-06-05 09:13:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2903 states, 2900 states have (on average 2.728965517241379) internal successors, (7914), 2902 states have internal predecessors, (7914), 0 states have call successors, (0), 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 09:13:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2903 states to 2903 states and 7914 transitions. [2021-06-05 09:13:30,040 INFO L78 Accepts]: Start accepts. Automaton has 2903 states and 7914 transitions. Word has length 59 [2021-06-05 09:13:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:30,040 INFO L482 AbstractCegarLoop]: Abstraction has 2903 states and 7914 transitions. [2021-06-05 09:13:30,040 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 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 09:13:30,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2903 states and 7914 transitions. [2021-06-05 09:13:30,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:13:30,044 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:30,044 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:30,244 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-06-05 09:13:30,244 INFO L430 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:30,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:30,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1797920798, now seen corresponding path program 2 times [2021-06-05 09:13:30,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:30,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476478945] [2021-06-05 09:13:30,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:13:30,337 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:30,337 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476478945] [2021-06-05 09:13:30,337 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476478945] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:30,337 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872618148] [2021-06-05 09:13:30,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 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 09:13:30,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:13:30,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:30,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 09:13:30,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:30,547 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 11 treesize of output 7 [2021-06-05 09:13:30,548 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:30,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:30,556 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 09:13:30,556 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:13:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:30,581 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872618148] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:30,581 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:30,581 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2021-06-05 09:13:30,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183397248] [2021-06-05 09:13:30,582 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 09:13:30,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:30,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 09:13:30,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:13:30,582 INFO L87 Difference]: Start difference. First operand 2903 states and 7914 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 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 09:13:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:30,790 INFO L93 Difference]: Finished difference Result 3699 states and 10149 transitions. [2021-06-05 09:13:30,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:13:30,790 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 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 09:13:30,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:30,794 INFO L225 Difference]: With dead ends: 3699 [2021-06-05 09:13:30,794 INFO L226 Difference]: Without dead ends: 3050 [2021-06-05 09:13:30,795 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 109.3ms TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:13:30,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3050 states. [2021-06-05 09:13:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3050 to 2693. [2021-06-05 09:13:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2693 states, 2690 states have (on average 2.73271375464684) internal successors, (7351), 2692 states have internal predecessors, (7351), 0 states have call successors, (0), 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 09:13:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 7351 transitions. [2021-06-05 09:13:30,838 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 7351 transitions. Word has length 59 [2021-06-05 09:13:30,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:30,838 INFO L482 AbstractCegarLoop]: Abstraction has 2693 states and 7351 transitions. [2021-06-05 09:13:30,838 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 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 09:13:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 7351 transitions. [2021-06-05 09:13:30,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:13:30,844 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:30,844 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:31,056 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:31,057 INFO L430 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:31,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:31,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1540441456, now seen corresponding path program 3 times [2021-06-05 09:13:31,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:31,057 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890870945] [2021-06-05 09:13:31,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:31,167 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 09:13:31,167 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:31,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890870945] [2021-06-05 09:13:31,167 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890870945] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:31,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977258797] [2021-06-05 09:13:31,167 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 09:13:31,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 09:13:31,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:31,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 09:13:31,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:31,334 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 13 treesize of output 9 [2021-06-05 09:13:31,335 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:31,339 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:31,339 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:31,340 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2021-06-05 09:13:31,474 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-06-05 09:13:31,474 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 29 treesize of output 28 [2021-06-05 09:13:31,476 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:31,485 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:31,487 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 09:13:31,487 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 09:13:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:31,519 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977258797] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:13:31,519 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:13:31,519 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-06-05 09:13:31,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734371054] [2021-06-05 09:13:31,520 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:13:31,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:31,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:13:31,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:13:31,521 INFO L87 Difference]: Start difference. First operand 2693 states and 7351 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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 09:13:31,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:31,776 INFO L93 Difference]: Finished difference Result 3402 states and 9252 transitions. [2021-06-05 09:13:31,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 09:13:31,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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 59 [2021-06-05 09:13:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:31,780 INFO L225 Difference]: With dead ends: 3402 [2021-06-05 09:13:31,780 INFO L226 Difference]: Without dead ends: 3222 [2021-06-05 09:13:31,780 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 156.3ms TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:13:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3222 states. [2021-06-05 09:13:31,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3222 to 2543. [2021-06-05 09:13:31,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2543 states, 2540 states have (on average 2.728740157480315) internal successors, (6931), 2542 states have internal predecessors, (6931), 0 states have call successors, (0), 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 09:13:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 6931 transitions. [2021-06-05 09:13:31,809 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 6931 transitions. Word has length 59 [2021-06-05 09:13:31,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:31,810 INFO L482 AbstractCegarLoop]: Abstraction has 2543 states and 6931 transitions. [2021-06-05 09:13:31,810 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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 09:13:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 6931 transitions. [2021-06-05 09:13:31,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:13:31,812 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:31,812 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:32,024 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-06-05 09:13:32,025 INFO L430 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:32,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:32,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1226640386, now seen corresponding path program 4 times [2021-06-05 09:13:32,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:32,025 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236625662] [2021-06-05 09:13:32,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:32,104 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 09:13:32,105 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:32,105 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236625662] [2021-06-05 09:13:32,105 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236625662] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:32,105 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236174088] [2021-06-05 09:13:32,105 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:32,192 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:13:32,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:32,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 09:13:32,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:32,328 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 11 treesize of output 7 [2021-06-05 09:13:32,329 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:32,336 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:32,337 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 09:13:32,337 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:13:32,363 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 09:13:32,364 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236174088] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:32,364 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:32,364 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 12 [2021-06-05 09:13:32,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194544951] [2021-06-05 09:13:32,365 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 09:13:32,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:32,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 09:13:32,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:13:32,366 INFO L87 Difference]: Start difference. First operand 2543 states and 6931 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 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 09:13:32,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:32,663 INFO L93 Difference]: Finished difference Result 2855 states and 7819 transitions. [2021-06-05 09:13:32,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:13:32,664 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 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 09:13:32,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:32,666 INFO L225 Difference]: With dead ends: 2855 [2021-06-05 09:13:32,666 INFO L226 Difference]: Without dead ends: 2445 [2021-06-05 09:13:32,667 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 145.9ms TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:13:32,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2021-06-05 09:13:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2253. [2021-06-05 09:13:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2253 states, 2250 states have (on average 2.7097777777777776) internal successors, (6097), 2252 states have internal predecessors, (6097), 0 states have call successors, (0), 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 09:13:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 6097 transitions. [2021-06-05 09:13:32,690 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 6097 transitions. Word has length 59 [2021-06-05 09:13:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:32,690 INFO L482 AbstractCegarLoop]: Abstraction has 2253 states and 6097 transitions. [2021-06-05 09:13:32,690 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 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 09:13:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 6097 transitions. [2021-06-05 09:13:32,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:13:32,692 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:32,696 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:32,913 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:32,913 INFO L430 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:32,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:32,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1527015678, now seen corresponding path program 5 times [2021-06-05 09:13:32,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:32,914 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844061226] [2021-06-05 09:13:32,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:32,997 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 09:13:32,997 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:32,997 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844061226] [2021-06-05 09:13:32,997 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844061226] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:32,997 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625773075] [2021-06-05 09:13:32,997 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 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 09:13:33,087 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 09:13:33,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:33,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 09:13:33,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:33,198 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 11 treesize of output 7 [2021-06-05 09:13:33,199 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:33,206 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:33,208 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 09:13:33,208 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:13:33,251 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 09:13:33,251 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625773075] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:33,251 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:33,251 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 12 [2021-06-05 09:13:33,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792258676] [2021-06-05 09:13:33,252 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 09:13:33,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:33,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 09:13:33,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:13:33,253 INFO L87 Difference]: Start difference. First operand 2253 states and 6097 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 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 09:13:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:33,530 INFO L93 Difference]: Finished difference Result 2363 states and 6409 transitions. [2021-06-05 09:13:33,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 09:13:33,530 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 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 09:13:33,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:33,532 INFO L225 Difference]: With dead ends: 2363 [2021-06-05 09:13:33,532 INFO L226 Difference]: Without dead ends: 2143 [2021-06-05 09:13:33,533 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 139.1ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:13:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2021-06-05 09:13:33,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2143. [2021-06-05 09:13:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2143 states, 2140 states have (on average 2.6537383177570093) internal successors, (5679), 2142 states have internal predecessors, (5679), 0 states have call successors, (0), 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 09:13:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 2143 states and 5679 transitions. [2021-06-05 09:13:33,554 INFO L78 Accepts]: Start accepts. Automaton has 2143 states and 5679 transitions. Word has length 59 [2021-06-05 09:13:33,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:33,554 INFO L482 AbstractCegarLoop]: Abstraction has 2143 states and 5679 transitions. [2021-06-05 09:13:33,554 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 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 09:13:33,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 5679 transitions. [2021-06-05 09:13:33,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:13:33,555 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:33,555 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:33,756 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2021-06-05 09:13:33,756 INFO L430 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:33,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:33,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1977129858, now seen corresponding path program 6 times [2021-06-05 09:13:33,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:33,756 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251948687] [2021-06-05 09:13:33,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:33,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:13:33,834 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:33,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251948687] [2021-06-05 09:13:33,834 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251948687] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:33,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694505501] [2021-06-05 09:13:33,835 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 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 09:13:33,917 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 09:13:33,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:33,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 09:13:33,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:34,013 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 11 treesize of output 7 [2021-06-05 09:13:34,014 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:34,020 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:34,021 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 09:13:34,021 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2021-06-05 09:13:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:13:34,045 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694505501] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:34,045 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:34,046 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 09:13:34,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329866916] [2021-06-05 09:13:34,046 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:13:34,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:34,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:13:34,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:13:34,046 INFO L87 Difference]: Start difference. First operand 2143 states and 5679 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 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 09:13:34,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:34,264 INFO L93 Difference]: Finished difference Result 2399 states and 6415 transitions. [2021-06-05 09:13:34,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:13:34,265 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 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 09:13:34,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:34,268 INFO L225 Difference]: With dead ends: 2399 [2021-06-05 09:13:34,268 INFO L226 Difference]: Without dead ends: 2143 [2021-06-05 09:13:34,268 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 116.5ms TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:13:34,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2021-06-05 09:13:34,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 1951. [2021-06-05 09:13:34,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1948 states have (on average 2.6288501026694044) internal successors, (5121), 1950 states have internal predecessors, (5121), 0 states have call successors, (0), 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 09:13:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 5121 transitions. [2021-06-05 09:13:34,298 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 5121 transitions. Word has length 59 [2021-06-05 09:13:34,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:34,298 INFO L482 AbstractCegarLoop]: Abstraction has 1951 states and 5121 transitions. [2021-06-05 09:13:34,298 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 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 09:13:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 5121 transitions. [2021-06-05 09:13:34,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:13:34,300 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:34,300 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:34,524 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:34,524 INFO L430 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:34,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:34,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1431396952, now seen corresponding path program 7 times [2021-06-05 09:13:34,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:34,525 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675584340] [2021-06-05 09:13:34,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:13:34,607 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:34,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675584340] [2021-06-05 09:13:34,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675584340] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:34,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283636782] [2021-06-05 09:13:34,608 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 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 09:13:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:34,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 09:13:34,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:34,816 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 11 treesize of output 7 [2021-06-05 09:13:34,817 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:34,824 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:34,825 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 09:13:34,825 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:13:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:34,865 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283636782] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:34,865 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:34,865 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2021-06-05 09:13:34,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725580759] [2021-06-05 09:13:34,865 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 09:13:34,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:34,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 09:13:34,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:13:34,866 INFO L87 Difference]: Start difference. First operand 1951 states and 5121 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 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 09:13:35,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:35,301 INFO L93 Difference]: Finished difference Result 2084 states and 5466 transitions. [2021-06-05 09:13:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 09:13:35,302 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 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 59 [2021-06-05 09:13:35,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:35,304 INFO L225 Difference]: With dead ends: 2084 [2021-06-05 09:13:35,304 INFO L226 Difference]: Without dead ends: 1623 [2021-06-05 09:13:35,304 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 205.8ms TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:13:35,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2021-06-05 09:13:35,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1593. [2021-06-05 09:13:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1590 states have (on average 2.6138364779874212) internal successors, (4156), 1592 states have internal predecessors, (4156), 0 states have call successors, (0), 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 09:13:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 4156 transitions. [2021-06-05 09:13:35,329 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 4156 transitions. Word has length 59 [2021-06-05 09:13:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:35,329 INFO L482 AbstractCegarLoop]: Abstraction has 1593 states and 4156 transitions. [2021-06-05 09:13:35,329 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 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 09:13:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 4156 transitions. [2021-06-05 09:13:35,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:13:35,332 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:35,332 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:35,545 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-06-05 09:13:35,545 INFO L430 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:35,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:35,546 INFO L82 PathProgramCache]: Analyzing trace with hash 736649229, now seen corresponding path program 1 times [2021-06-05 09:13:35,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:35,546 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066905477] [2021-06-05 09:13:35,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:35,635 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:35,635 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066905477] [2021-06-05 09:13:35,635 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066905477] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:35,635 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226752199] [2021-06-05 09:13:35,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 09:13:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:35,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 09:13:35,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:35,851 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 11 treesize of output 7 [2021-06-05 09:13:35,852 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:35,857 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:35,857 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:35,857 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-06-05 09:13:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:35,894 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226752199] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:35,894 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:35,894 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 14 [2021-06-05 09:13:35,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357726852] [2021-06-05 09:13:35,894 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 09:13:35,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:35,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 09:13:35,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:13:35,895 INFO L87 Difference]: Start difference. First operand 1593 states and 4156 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 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 09:13:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:36,167 INFO L93 Difference]: Finished difference Result 1685 states and 4396 transitions. [2021-06-05 09:13:36,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:13:36,168 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 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 09:13:36,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:36,170 INFO L225 Difference]: With dead ends: 1685 [2021-06-05 09:13:36,170 INFO L226 Difference]: Without dead ends: 1611 [2021-06-05 09:13:36,170 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 122.1ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:13:36,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2021-06-05 09:13:36,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1583. [2021-06-05 09:13:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1580 states have (on average 2.6044303797468356) internal successors, (4115), 1582 states have internal predecessors, (4115), 0 states have call successors, (0), 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 09:13:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 4115 transitions. [2021-06-05 09:13:36,215 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 4115 transitions. Word has length 59 [2021-06-05 09:13:36,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:36,215 INFO L482 AbstractCegarLoop]: Abstraction has 1583 states and 4115 transitions. [2021-06-05 09:13:36,215 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 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 09:13:36,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 4115 transitions. [2021-06-05 09:13:36,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:13:36,216 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:36,216 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:36,417 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:36,417 INFO L430 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:36,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:36,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1950002885, now seen corresponding path program 2 times [2021-06-05 09:13:36,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:36,417 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005710524] [2021-06-05 09:13:36,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:36,503 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:36,503 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005710524] [2021-06-05 09:13:36,503 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005710524] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:36,503 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008890757] [2021-06-05 09:13:36,503 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 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 09:13:36,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:13:36,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:36,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 09:13:36,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:36,729 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 11 treesize of output 7 [2021-06-05 09:13:36,730 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:36,734 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:36,735 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:36,735 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-06-05 09:13:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:36,760 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008890757] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:36,760 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:36,761 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2021-06-05 09:13:36,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029158196] [2021-06-05 09:13:36,761 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 09:13:36,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:36,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 09:13:36,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:13:36,762 INFO L87 Difference]: Start difference. First operand 1583 states and 4115 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 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 09:13:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:36,938 INFO L93 Difference]: Finished difference Result 1967 states and 5219 transitions. [2021-06-05 09:13:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:13:36,938 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 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 09:13:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:36,940 INFO L225 Difference]: With dead ends: 1967 [2021-06-05 09:13:36,940 INFO L226 Difference]: Without dead ends: 1553 [2021-06-05 09:13:36,940 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 103.2ms TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:13:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2021-06-05 09:13:36,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1553. [2021-06-05 09:13:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1550 states have (on average 2.581935483870968) internal successors, (4002), 1552 states have internal predecessors, (4002), 0 states have call successors, (0), 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 09:13:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 4002 transitions. [2021-06-05 09:13:36,956 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 4002 transitions. Word has length 59 [2021-06-05 09:13:36,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:36,957 INFO L482 AbstractCegarLoop]: Abstraction has 1553 states and 4002 transitions. [2021-06-05 09:13:36,957 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 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 09:13:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 4002 transitions. [2021-06-05 09:13:36,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:13:36,958 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:36,958 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:13:37,165 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-06-05 09:13:37,165 INFO L430 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:37,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:37,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1477118061, now seen corresponding path program 3 times [2021-06-05 09:13:37,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:37,165 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196821585] [2021-06-05 09:13:37,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:37,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:37,241 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:37,241 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196821585] [2021-06-05 09:13:37,241 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196821585] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:37,241 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053213873] [2021-06-05 09:13:37,241 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 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 09:13:37,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 09:13:37,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:37,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 09:13:37,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:37,430 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 11 treesize of output 7 [2021-06-05 09:13:37,431 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:37,437 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:37,438 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 09:13:37,438 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2021-06-05 09:13:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:37,469 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053213873] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:37,470 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:37,470 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 09:13:37,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752377566] [2021-06-05 09:13:37,470 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 09:13:37,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:37,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 09:13:37,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:13:37,470 INFO L87 Difference]: Start difference. First operand 1553 states and 4002 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 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 09:13:37,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:37,541 INFO L93 Difference]: Finished difference Result 876 states and 2266 transitions. [2021-06-05 09:13:37,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:13:37,541 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 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 59 [2021-06-05 09:13:37,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:37,541 INFO L225 Difference]: With dead ends: 876 [2021-06-05 09:13:37,541 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 09:13:37,542 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 83.3ms TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:13:37,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 09:13:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 09:13:37,542 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 09:13:37,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 09:13:37,542 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2021-06-05 09:13:37,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:37,542 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 09:13:37,542 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 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 09:13:37,542 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 09:13:37,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 09:13:37,743 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:37,743 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 09:13:37,743 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 09:13:37,743 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 09:13:37,743 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 09:13:37,744 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 09:13:37,744 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 09:13:37,744 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 09:13:37,744 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 09:13:37,744 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 09:13:37,744 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 09:13:37,745 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 87 transitions, 186 flow [2021-06-05 09:13:37,973 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9822 states, 9804 states have (on average 3.1175030599755202) internal successors, (30564), 9821 states have internal predecessors, (30564), 0 states have call successors, (0), 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 09:13:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 9822 states, 9804 states have (on average 3.1175030599755202) internal successors, (30564), 9821 states have internal predecessors, (30564), 0 states have call successors, (0), 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 09:13:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-06-05 09:13:37,990 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:37,990 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:13:37,990 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 09:13:37,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:37,990 INFO L82 PathProgramCache]: Analyzing trace with hash 2034251024, now seen corresponding path program 1 times [2021-06-05 09:13:37,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:37,991 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935906133] [2021-06-05 09:13:37,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 09:13:37,996 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 09:13:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 09:13:38,000 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 09:13:38,004 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 09:13:38,004 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 09:13:38,004 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-05 09:13:38,005 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 09:13:38,005 WARN L242 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 09:13:38,005 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2021-06-05 09:13:38,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,015 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,015 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,016 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,016 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,017 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,017 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,029 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,031 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,032 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,032 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,033 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,033 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,034 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,034 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:38,035 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 09:13:38,035 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-05 09:13:38,036 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 09:13:38,036 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 09:13:38,036 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 09:13:38,036 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 09:13:38,036 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 09:13:38,036 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 09:13:38,036 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 09:13:38,036 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 09:13:38,038 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 105 transitions, 231 flow [2021-06-05 09:14:18,071 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 157022 states, 156984 states have (on average 4.1767568669418536) internal successors, (655684), 157021 states have internal predecessors, (655684), 0 states have call successors, (0), 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 09:14:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 157022 states, 156984 states have (on average 4.1767568669418536) internal successors, (655684), 157021 states have internal predecessors, (655684), 0 states have call successors, (0), 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 09:14:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-06-05 09:14:18,275 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:18,275 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] [2021-06-05 09:14:18,275 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:18,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:18,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1226382785, now seen corresponding path program 1 times [2021-06-05 09:14:18,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:18,276 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015145120] [2021-06-05 09:14:18,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:18,291 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 09:14:18,291 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:18,291 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015145120] [2021-06-05 09:14:18,291 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015145120] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:14:18,291 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:14:18,291 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 09:14:18,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633531287] [2021-06-05 09:14:18,292 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 09:14:18,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:18,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 09:14:18,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 09:14:18,495 INFO L87 Difference]: Start difference. First operand has 157022 states, 156984 states have (on average 4.1767568669418536) internal successors, (655684), 157021 states have internal predecessors, (655684), 0 states have call successors, (0), 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 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 09:14:19,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:19,891 INFO L93 Difference]: Finished difference Result 126330 states and 496756 transitions. [2021-06-05 09:14:19,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 09:14:19,891 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-06-05 09:14:19,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:20,530 INFO L225 Difference]: With dead ends: 126330 [2021-06-05 09:14:20,530 INFO L226 Difference]: Without dead ends: 119072 [2021-06-05 09:14:20,530 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 09:14:22,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119072 states. [2021-06-05 09:14:24,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119072 to 119072. [2021-06-05 09:14:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119072 states, 119039 states have (on average 3.936373793462647) internal successors, (468582), 119071 states have internal predecessors, (468582), 0 states have call successors, (0), 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 09:14:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119072 states to 119072 states and 468582 transitions. [2021-06-05 09:14:26,101 INFO L78 Accepts]: Start accepts. Automaton has 119072 states and 468582 transitions. Word has length 24 [2021-06-05 09:14:26,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:26,101 INFO L482 AbstractCegarLoop]: Abstraction has 119072 states and 468582 transitions. [2021-06-05 09:14:26,101 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 09:14:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 119072 states and 468582 transitions. [2021-06-05 09:14:26,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-06-05 09:14:26,101 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:26,101 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] [2021-06-05 09:14:26,102 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-05 09:14:26,102 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:26,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:26,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1577989618, now seen corresponding path program 1 times [2021-06-05 09:14:26,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:26,102 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273864591] [2021-06-05 09:14:26,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:26,117 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 09:14:26,117 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:26,117 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273864591] [2021-06-05 09:14:26,117 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273864591] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:14:26,117 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:14:26,117 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 09:14:26,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898982962] [2021-06-05 09:14:26,118 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 09:14:26,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:26,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 09:14:26,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 09:14:26,118 INFO L87 Difference]: Start difference. First operand 119072 states and 468582 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 09:14:27,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:27,434 INFO L93 Difference]: Finished difference Result 143338 states and 551597 transitions. [2021-06-05 09:14:27,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 09:14:27,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-06-05 09:14:27,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:27,868 INFO L225 Difference]: With dead ends: 143338 [2021-06-05 09:14:27,868 INFO L226 Difference]: Without dead ends: 127284 [2021-06-05 09:14:27,868 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 09:14:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127284 states. [2021-06-05 09:14:31,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127284 to 112680. [2021-06-05 09:14:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112680 states, 112652 states have (on average 3.8590881653232967) internal successors, (434734), 112679 states have internal predecessors, (434734), 0 states have call successors, (0), 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 09:14:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112680 states to 112680 states and 434734 transitions. [2021-06-05 09:14:32,856 INFO L78 Accepts]: Start accepts. Automaton has 112680 states and 434734 transitions. Word has length 26 [2021-06-05 09:14:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:32,856 INFO L482 AbstractCegarLoop]: Abstraction has 112680 states and 434734 transitions. [2021-06-05 09:14:32,856 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 09:14:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand 112680 states and 434734 transitions. [2021-06-05 09:14:32,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 09:14:32,858 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:32,858 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:32,858 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-05 09:14:32,858 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:32,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:32,858 INFO L82 PathProgramCache]: Analyzing trace with hash -83333365, now seen corresponding path program 1 times [2021-06-05 09:14:32,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:32,859 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645997389] [2021-06-05 09:14:32,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:32,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:14:32,918 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:32,918 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645997389] [2021-06-05 09:14:32,918 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645997389] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:14:32,918 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:14:32,918 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 09:14:32,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370530948] [2021-06-05 09:14:32,919 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 09:14:32,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:32,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 09:14:32,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-05 09:14:32,919 INFO L87 Difference]: Start difference. First operand 112680 states and 434734 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:14:34,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:34,054 INFO L93 Difference]: Finished difference Result 112849 states and 435405 transitions. [2021-06-05 09:14:34,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 09:14:34,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 42 [2021-06-05 09:14:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:34,475 INFO L225 Difference]: With dead ends: 112849 [2021-06-05 09:14:34,475 INFO L226 Difference]: Without dead ends: 112817 [2021-06-05 09:14:34,475 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.1ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-05 09:14:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112817 states. [2021-06-05 09:14:38,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112817 to 112817. [2021-06-05 09:14:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112817 states, 112789 states have (on average 3.8596848983500163) internal successors, (435330), 112816 states have internal predecessors, (435330), 0 states have call successors, (0), 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 09:14:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112817 states to 112817 states and 435330 transitions. [2021-06-05 09:14:38,706 INFO L78 Accepts]: Start accepts. Automaton has 112817 states and 435330 transitions. Word has length 42 [2021-06-05 09:14:38,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:38,707 INFO L482 AbstractCegarLoop]: Abstraction has 112817 states and 435330 transitions. [2021-06-05 09:14:38,707 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:14:38,707 INFO L276 IsEmpty]: Start isEmpty. Operand 112817 states and 435330 transitions. [2021-06-05 09:14:38,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 09:14:38,708 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:38,708 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:38,708 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-05 09:14:38,708 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:38,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:38,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1669414486, now seen corresponding path program 1 times [2021-06-05 09:14:38,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:38,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951734337] [2021-06-05 09:14:38,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:14:39,317 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:39,317 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951734337] [2021-06-05 09:14:39,317 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951734337] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:14:39,317 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:14:39,318 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 09:14:39,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152495617] [2021-06-05 09:14:39,318 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 09:14:39,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:39,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 09:14:39,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-05 09:14:39,318 INFO L87 Difference]: Start difference. First operand 112817 states and 435330 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:14:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:40,153 INFO L93 Difference]: Finished difference Result 112457 states and 434274 transitions. [2021-06-05 09:14:40,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 09:14:40,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 42 [2021-06-05 09:14:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:40,487 INFO L225 Difference]: With dead ends: 112457 [2021-06-05 09:14:40,487 INFO L226 Difference]: Without dead ends: 112420 [2021-06-05 09:14:40,487 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 51.0ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-05 09:14:42,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112420 states. [2021-06-05 09:14:44,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112420 to 112420. [2021-06-05 09:14:44,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112420 states, 112394 states have (on average 3.8632311333345197) internal successors, (434204), 112419 states have internal predecessors, (434204), 0 states have call successors, (0), 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 09:14:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112420 states to 112420 states and 434204 transitions. [2021-06-05 09:14:45,522 INFO L78 Accepts]: Start accepts. Automaton has 112420 states and 434204 transitions. Word has length 42 [2021-06-05 09:14:45,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:45,522 INFO L482 AbstractCegarLoop]: Abstraction has 112420 states and 434204 transitions. [2021-06-05 09:14:45,522 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:14:45,523 INFO L276 IsEmpty]: Start isEmpty. Operand 112420 states and 434204 transitions. [2021-06-05 09:14:45,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-06-05 09:14:45,524 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:45,525 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] [2021-06-05 09:14:45,525 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-06-05 09:14:45,525 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:45,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:45,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1651937143, now seen corresponding path program 1 times [2021-06-05 09:14:45,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:45,525 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693221234] [2021-06-05 09:14:45,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:45,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:14:45,687 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:45,687 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693221234] [2021-06-05 09:14:45,687 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693221234] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:45,687 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28655530] [2021-06-05 09:14:45,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:45,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 09:14:45,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:45,894 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 11 treesize of output 7 [2021-06-05 09:14:45,895 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:45,902 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:45,903 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 09:14:45,903 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:14:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:14:45,925 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28655530] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:45,926 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:45,926 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2021-06-05 09:14:45,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434208386] [2021-06-05 09:14:45,926 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:14:45,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:45,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:14:45,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:14:45,927 INFO L87 Difference]: Start difference. First operand 112420 states and 434204 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 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 09:14:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:46,737 INFO L93 Difference]: Finished difference Result 112517 states and 435706 transitions. [2021-06-05 09:14:46,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:14:46,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 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 43 [2021-06-05 09:14:46,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:47,802 INFO L225 Difference]: With dead ends: 112517 [2021-06-05 09:14:47,803 INFO L226 Difference]: Without dead ends: 112517 [2021-06-05 09:14:47,803 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 96.7ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:14:49,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112517 states. [2021-06-05 09:14:51,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112517 to 111217. [2021-06-05 09:14:51,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111217 states, 111191 states have (on average 3.8710507145362483) internal successors, (430426), 111216 states have internal predecessors, (430426), 0 states have call successors, (0), 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 09:14:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111217 states to 111217 states and 430426 transitions. [2021-06-05 09:14:52,229 INFO L78 Accepts]: Start accepts. Automaton has 111217 states and 430426 transitions. Word has length 43 [2021-06-05 09:14:52,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:52,229 INFO L482 AbstractCegarLoop]: Abstraction has 111217 states and 430426 transitions. [2021-06-05 09:14:52,230 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 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 09:14:52,230 INFO L276 IsEmpty]: Start isEmpty. Operand 111217 states and 430426 transitions. [2021-06-05 09:14:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-06-05 09:14:52,240 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:52,240 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:14:52,455 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:52,455 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:52,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:52,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1169743056, now seen corresponding path program 2 times [2021-06-05 09:14:52,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:52,456 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765919441] [2021-06-05 09:14:52,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:52,584 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:14:52,585 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:52,585 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765919441] [2021-06-05 09:14:52,585 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765919441] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:52,585 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402695801] [2021-06-05 09:14:52,585 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 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 09:14:52,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:14:52,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:14:52,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 40 conjunts are in the unsatisfiable core [2021-06-05 09:14:52,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:52,696 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 09:14:52,697 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:52,701 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:52,702 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:52,702 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:14:52,737 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:14:52,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2021-06-05 09:14:52,740 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:52,751 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:52,752 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:52,752 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2021-06-05 09:14:52,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 11 treesize of output 7 [2021-06-05 09:14:52,800 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:52,808 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:52,809 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:14:52,809 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2021-06-05 09:14:52,952 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 09:14:52,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:14:52,954 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:52,963 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:52,964 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:52,964 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2021-06-05 09:14:52,986 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 11 treesize of output 7 [2021-06-05 09:14:52,986 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:52,992 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:52,992 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:52,992 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-06-05 09:14:53,017 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 19 treesize of output 18 [2021-06-05 09:14:53,018 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:53,024 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:53,026 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 09:14:53,026 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:14:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:14:53,046 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402695801] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:53,046 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:53,046 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2021-06-05 09:14:53,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190265693] [2021-06-05 09:14:53,046 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 09:14:53,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:53,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 09:14:53,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:14:53,047 INFO L87 Difference]: Start difference. First operand 111217 states and 430426 transitions. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 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 09:14:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:54,941 INFO L93 Difference]: Finished difference Result 113557 states and 439900 transitions. [2021-06-05 09:14:54,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 09:14:54,942 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 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 51 [2021-06-05 09:14:54,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:55,336 INFO L225 Difference]: With dead ends: 113557 [2021-06-05 09:14:55,336 INFO L226 Difference]: Without dead ends: 113557 [2021-06-05 09:14:55,336 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 282.5ms TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2021-06-05 09:14:56,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113557 states. [2021-06-05 09:14:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113557 to 111787. [2021-06-05 09:14:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111787 states, 111761 states have (on average 3.8725494582188777) internal successors, (432800), 111786 states have internal predecessors, (432800), 0 states have call successors, (0), 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 09:14:59,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111787 states to 111787 states and 432800 transitions. [2021-06-05 09:14:59,544 INFO L78 Accepts]: Start accepts. Automaton has 111787 states and 432800 transitions. Word has length 51 [2021-06-05 09:14:59,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:59,544 INFO L482 AbstractCegarLoop]: Abstraction has 111787 states and 432800 transitions. [2021-06-05 09:14:59,544 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 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 09:14:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 111787 states and 432800 transitions. [2021-06-05 09:14:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-06-05 09:14:59,555 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:59,555 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:14:59,755 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2021-06-05 09:14:59,756 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:59,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:59,756 INFO L82 PathProgramCache]: Analyzing trace with hash -476180336, now seen corresponding path program 1 times [2021-06-05 09:14:59,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:59,756 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166714762] [2021-06-05 09:14:59,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:14:59,856 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:59,856 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166714762] [2021-06-05 09:14:59,856 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166714762] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:59,856 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123184750] [2021-06-05 09:14:59,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:14:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:59,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 09:14:59,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:59,953 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 09:14:59,954 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:59,958 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:59,958 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:59,958 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:14:59,983 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:14:59,983 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 09:14:59,984 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:59,989 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:59,990 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:59,990 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-06-05 09:15:00,064 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 11 treesize of output 7 [2021-06-05 09:15:00,065 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:00,070 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:00,071 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:00,071 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-06-05 09:15:00,096 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 19 treesize of output 18 [2021-06-05 09:15:00,097 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:00,105 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:00,107 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 09:15:00,107 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:15:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:15:00,131 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123184750] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:00,131 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:15:00,131 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2021-06-05 09:15:00,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785910964] [2021-06-05 09:15:00,131 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 09:15:00,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:00,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 09:15:00,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:15:00,132 INFO L87 Difference]: Start difference. First operand 111787 states and 432800 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 0 states have call successors, (0), 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 09:15:01,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:01,626 INFO L93 Difference]: Finished difference Result 113417 states and 439451 transitions. [2021-06-05 09:15:01,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:15:01,627 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 0 states have call successors, (0), 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 51 [2021-06-05 09:15:01,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:02,017 INFO L225 Difference]: With dead ends: 113417 [2021-06-05 09:15:02,017 INFO L226 Difference]: Without dead ends: 113417 [2021-06-05 09:15:02,018 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 138.7ms TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:15:03,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113417 states. [2021-06-05 09:15:06,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113417 to 112397. [2021-06-05 09:15:06,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112397 states, 112371 states have (on average 3.8741935196803445) internal successors, (435347), 112396 states have internal predecessors, (435347), 0 states have call successors, (0), 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 09:15:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112397 states to 112397 states and 435347 transitions. [2021-06-05 09:15:06,656 INFO L78 Accepts]: Start accepts. Automaton has 112397 states and 435347 transitions. Word has length 51 [2021-06-05 09:15:06,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:06,656 INFO L482 AbstractCegarLoop]: Abstraction has 112397 states and 435347 transitions. [2021-06-05 09:15:06,656 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 0 states have call successors, (0), 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 09:15:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 112397 states and 435347 transitions. [2021-06-05 09:15:06,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-06-05 09:15:06,668 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:06,668 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:15:06,868 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:15:06,869 INFO L430 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:06,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:06,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1245880054, now seen corresponding path program 3 times [2021-06-05 09:15:06,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:06,869 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171628980] [2021-06-05 09:15:06,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:15:06,990 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:06,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171628980] [2021-06-05 09:15:06,990 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171628980] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:06,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528879468] [2021-06-05 09:15:06,990 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 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 09:15:07,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 09:15:07,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:15:07,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 38 conjunts are in the unsatisfiable core [2021-06-05 09:15:07,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:15:07,093 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 09:15:07,094 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:07,098 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:07,099 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:07,099 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:15:07,137 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:15:07,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2021-06-05 09:15:07,139 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:07,146 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:07,147 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:15:07,147 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2021-06-05 09:15:07,282 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 09:15:07,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:15:07,284 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:07,293 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:07,294 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:07,294 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2021-06-05 09:15:07,333 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 11 treesize of output 7 [2021-06-05 09:15:07,334 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:07,340 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:07,340 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:07,340 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-06-05 09:15:07,371 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 19 treesize of output 18 [2021-06-05 09:15:07,373 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:07,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:07,381 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 09:15:07,382 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:15:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:15:08,060 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528879468] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:08,060 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:15:08,060 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 09:15:08,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463402855] [2021-06-05 09:15:08,060 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 09:15:08,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:08,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 09:15:08,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:15:08,061 INFO L87 Difference]: Start difference. First operand 112397 states and 435347 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 0 states have call successors, (0), 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 09:15:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:09,097 INFO L93 Difference]: Finished difference Result 113652 states and 440378 transitions. [2021-06-05 09:15:09,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:15:09,098 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 0 states have call successors, (0), 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 51 [2021-06-05 09:15:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:09,442 INFO L225 Difference]: With dead ends: 113652 [2021-06-05 09:15:09,442 INFO L226 Difference]: Without dead ends: 113652 [2021-06-05 09:15:09,442 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 909.8ms TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:15:11,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113652 states. [2021-06-05 09:15:13,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113652 to 111787. [2021-06-05 09:15:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111787 states, 111761 states have (on average 3.8725494582188777) internal successors, (432800), 111786 states have internal predecessors, (432800), 0 states have call successors, (0), 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 09:15:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111787 states to 111787 states and 432800 transitions. [2021-06-05 09:15:13,780 INFO L78 Accepts]: Start accepts. Automaton has 111787 states and 432800 transitions. Word has length 51 [2021-06-05 09:15:13,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:13,780 INFO L482 AbstractCegarLoop]: Abstraction has 111787 states and 432800 transitions. [2021-06-05 09:15:13,780 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 0 states have call successors, (0), 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 09:15:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 111787 states and 432800 transitions. [2021-06-05 09:15:13,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-06-05 09:15:13,791 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:13,791 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:15:13,997 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2021-06-05 09:15:13,997 INFO L430 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:13,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:13,997 INFO L82 PathProgramCache]: Analyzing trace with hash -813525086, now seen corresponding path program 2 times [2021-06-05 09:15:13,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:13,998 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728971116] [2021-06-05 09:15:13,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-06-05 09:15:14,103 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:14,103 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728971116] [2021-06-05 09:15:14,103 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728971116] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:14,103 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489892840] [2021-06-05 09:15:14,103 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 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 09:15:14,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:15:14,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:15:14,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 38 conjunts are in the unsatisfiable core [2021-06-05 09:15:14,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:15:14,191 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 09:15:14,191 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:14,195 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:14,196 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:14,196 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:15:14,899 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:15:14,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2021-06-05 09:15:14,901 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:14,916 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:14,918 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:15:14,918 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2021-06-05 09:15:15,116 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 09:15:15,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:15:15,123 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:15,132 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:15,134 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:15,134 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2021-06-05 09:15:15,157 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 11 treesize of output 7 [2021-06-05 09:15:15,158 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:15,163 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:15,164 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:15,164 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-06-05 09:15:15,191 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 19 treesize of output 18 [2021-06-05 09:15:15,192 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:15,201 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:15,203 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 09:15:15,203 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:15:15,228 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-06-05 09:15:15,228 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489892840] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:15,228 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:15:15,229 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 15 [2021-06-05 09:15:15,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292041998] [2021-06-05 09:15:15,231 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 09:15:15,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:15,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 09:15:15,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:15:15,232 INFO L87 Difference]: Start difference. First operand 111787 states and 432800 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 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 09:15:17,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:17,024 INFO L93 Difference]: Finished difference Result 109943 states and 425375 transitions. [2021-06-05 09:15:17,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:15:17,025 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 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 51 [2021-06-05 09:15:17,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:17,597 INFO L225 Difference]: With dead ends: 109943 [2021-06-05 09:15:17,597 INFO L226 Difference]: Without dead ends: 109943 [2021-06-05 09:15:17,598 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 281.1ms TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:15:19,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109943 states. [2021-06-05 09:15:21,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109943 to 108063. [2021-06-05 09:15:21,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108063 states, 108037 states have (on average 3.866258781713672) internal successors, (417699), 108062 states have internal predecessors, (417699), 0 states have call successors, (0), 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 09:15:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108063 states to 108063 states and 417699 transitions. [2021-06-05 09:15:22,772 INFO L78 Accepts]: Start accepts. Automaton has 108063 states and 417699 transitions. Word has length 51 [2021-06-05 09:15:22,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:22,774 INFO L482 AbstractCegarLoop]: Abstraction has 108063 states and 417699 transitions. [2021-06-05 09:15:22,774 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 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 09:15:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 108063 states and 417699 transitions. [2021-06-05 09:15:22,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-06-05 09:15:22,815 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:22,815 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:15:23,039 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:15:23,039 INFO L430 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:23,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:23,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1008143938, now seen corresponding path program 1 times [2021-06-05 09:15:23,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:23,040 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038854935] [2021-06-05 09:15:23,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:15:23,108 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:23,108 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038854935] [2021-06-05 09:15:23,108 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038854935] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:23,108 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649923410] [2021-06-05 09:15:23,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:15:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:23,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 09:15:23,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:15:23,313 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 11 treesize of output 7 [2021-06-05 09:15:23,314 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:23,322 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:23,323 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 09:15:23,323 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:15:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:15:23,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649923410] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:23,344 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:15:23,344 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2021-06-05 09:15:23,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578906928] [2021-06-05 09:15:23,344 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:15:23,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:23,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:15:23,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:15:23,345 INFO L87 Difference]: Start difference. First operand 108063 states and 417699 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 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 09:15:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:24,161 INFO L93 Difference]: Finished difference Result 103551 states and 399276 transitions. [2021-06-05 09:15:24,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:15:24,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 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 52 [2021-06-05 09:15:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:24,477 INFO L225 Difference]: With dead ends: 103551 [2021-06-05 09:15:24,477 INFO L226 Difference]: Without dead ends: 103551 [2021-06-05 09:15:24,477 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 85.3ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:26,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103551 states. [2021-06-05 09:15:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103551 to 102441. [2021-06-05 09:15:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102441 states, 102415 states have (on average 3.853087926573256) internal successors, (394614), 102440 states have internal predecessors, (394614), 0 states have call successors, (0), 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 09:15:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102441 states to 102441 states and 394614 transitions. [2021-06-05 09:15:28,607 INFO L78 Accepts]: Start accepts. Automaton has 102441 states and 394614 transitions. Word has length 52 [2021-06-05 09:15:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:28,607 INFO L482 AbstractCegarLoop]: Abstraction has 102441 states and 394614 transitions. [2021-06-05 09:15:28,607 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 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 09:15:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 102441 states and 394614 transitions. [2021-06-05 09:15:28,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:15:28,623 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:28,623 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:15:28,847 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2021-06-05 09:15:28,847 INFO L430 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:28,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:28,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1734057852, now seen corresponding path program 1 times [2021-06-05 09:15:28,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:28,848 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859913243] [2021-06-05 09:15:28,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:15:28,940 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:28,940 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859913243] [2021-06-05 09:15:28,940 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859913243] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:28,940 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425256903] [2021-06-05 09:15:28,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:15:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:29,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 09:15:29,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:15:29,097 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 09:15:29,098 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:29,103 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:29,104 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:29,104 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2021-06-05 09:15:29,115 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:15:29,115 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 09:15:29,117 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:29,126 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:29,127 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:29,127 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2021-06-05 09:15:29,155 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 11 treesize of output 7 [2021-06-05 09:15:29,156 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:29,165 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:29,166 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 09:15:29,166 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2021-06-05 09:15:29,194 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 26 treesize of output 21 [2021-06-05 09:15:29,195 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:29,204 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:29,205 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 09:15:29,206 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2021-06-05 09:15:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:15:29,228 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425256903] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:29,228 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:15:29,228 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2021-06-05 09:15:29,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192618543] [2021-06-05 09:15:29,229 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 09:15:29,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:29,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 09:15:29,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:15:29,230 INFO L87 Difference]: Start difference. First operand 102441 states and 394614 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:15:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:30,693 INFO L93 Difference]: Finished difference Result 103182 states and 397661 transitions. [2021-06-05 09:15:30,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:15:30,693 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 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 54 [2021-06-05 09:15:30,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:31,045 INFO L225 Difference]: With dead ends: 103182 [2021-06-05 09:15:31,045 INFO L226 Difference]: Without dead ends: 103182 [2021-06-05 09:15:31,045 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 161.5ms TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:15:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103182 states. [2021-06-05 09:15:34,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103182 to 102797. [2021-06-05 09:15:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102797 states, 102771 states have (on average 3.85404442887585) internal successors, (396084), 102796 states have internal predecessors, (396084), 0 states have call successors, (0), 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 09:15:35,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102797 states to 102797 states and 396084 transitions. [2021-06-05 09:15:35,221 INFO L78 Accepts]: Start accepts. Automaton has 102797 states and 396084 transitions. Word has length 54 [2021-06-05 09:15:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:35,222 INFO L482 AbstractCegarLoop]: Abstraction has 102797 states and 396084 transitions. [2021-06-05 09:15:35,222 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:15:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 102797 states and 396084 transitions. [2021-06-05 09:15:35,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:15:35,238 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:35,238 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:15:35,439 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2021-06-05 09:15:35,439 INFO L430 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:35,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:35,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1819798398, now seen corresponding path program 1 times [2021-06-05 09:15:35,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:35,440 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442125440] [2021-06-05 09:15:35,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:15:35,507 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:35,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442125440] [2021-06-05 09:15:35,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442125440] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:35,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214161487] [2021-06-05 09:15:35,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 09:15:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:35,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 21 conjunts are in the unsatisfiable core [2021-06-05 09:15:35,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:15:35,681 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 11 treesize of output 7 [2021-06-05 09:15:35,682 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:35,691 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:35,692 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 09:15:35,692 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:15:35,717 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:15:35,717 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214161487] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:35,717 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:15:35,717 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2021-06-05 09:15:35,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686684362] [2021-06-05 09:15:35,717 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:35,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:35,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:35,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:35,718 INFO L87 Difference]: Start difference. First operand 102797 states and 396084 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:15:36,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:36,466 INFO L93 Difference]: Finished difference Result 103594 states and 399384 transitions. [2021-06-05 09:15:36,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:15:36,467 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 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 54 [2021-06-05 09:15:36,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:37,372 INFO L225 Difference]: With dead ends: 103594 [2021-06-05 09:15:37,373 INFO L226 Difference]: Without dead ends: 103594 [2021-06-05 09:15:37,373 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 86.1ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:38,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103594 states. [2021-06-05 09:15:40,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103594 to 102925. [2021-06-05 09:15:40,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102925 states, 102899 states have (on average 3.854536973148427) internal successors, (396628), 102924 states have internal predecessors, (396628), 0 states have call successors, (0), 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 09:15:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102925 states to 102925 states and 396628 transitions. [2021-06-05 09:15:40,957 INFO L78 Accepts]: Start accepts. Automaton has 102925 states and 396628 transitions. Word has length 54 [2021-06-05 09:15:40,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:40,957 INFO L482 AbstractCegarLoop]: Abstraction has 102925 states and 396628 transitions. [2021-06-05 09:15:40,957 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:15:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand 102925 states and 396628 transitions. [2021-06-05 09:15:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:15:40,971 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:40,971 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:15:41,172 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2021-06-05 09:15:41,172 INFO L430 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:41,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:41,172 INFO L82 PathProgramCache]: Analyzing trace with hash 854458658, now seen corresponding path program 2 times [2021-06-05 09:15:41,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:41,173 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270628748] [2021-06-05 09:15:41,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:15:41,257 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:41,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270628748] [2021-06-05 09:15:41,257 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270628748] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:41,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140145726] [2021-06-05 09:15:41,257 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 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 09:15:41,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:15:41,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:15:41,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 09:15:41,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:15:41,441 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 16 treesize of output 12 [2021-06-05 09:15:41,442 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:41,451 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:41,455 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:41,455 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:87 [2021-06-05 09:15:41,499 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:41,500 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140145726] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:41,500 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:15:41,500 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2021-06-05 09:15:41,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849458826] [2021-06-05 09:15:41,500 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 09:15:41,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:41,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 09:15:41,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:41,501 INFO L87 Difference]: Start difference. First operand 102925 states and 396628 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:15:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:42,773 INFO L93 Difference]: Finished difference Result 106211 states and 410184 transitions. [2021-06-05 09:15:42,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 09:15:42,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:15:42,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:43,112 INFO L225 Difference]: With dead ends: 106211 [2021-06-05 09:15:43,113 INFO L226 Difference]: Without dead ends: 106211 [2021-06-05 09:15:43,113 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 112.8ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:15:44,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106211 states. [2021-06-05 09:15:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106211 to 106076. [2021-06-05 09:15:46,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106076 states, 106050 states have (on average 3.863055162659123) internal successors, (409677), 106075 states have internal predecessors, (409677), 0 states have call successors, (0), 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 09:15:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106076 states to 106076 states and 409677 transitions. [2021-06-05 09:15:47,463 INFO L78 Accepts]: Start accepts. Automaton has 106076 states and 409677 transitions. Word has length 54 [2021-06-05 09:15:47,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:47,463 INFO L482 AbstractCegarLoop]: Abstraction has 106076 states and 409677 transitions. [2021-06-05 09:15:47,463 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:15:47,463 INFO L276 IsEmpty]: Start isEmpty. Operand 106076 states and 409677 transitions. [2021-06-05 09:15:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:15:47,484 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:47,484 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:15:47,684 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:15:47,685 INFO L430 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:47,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:47,685 INFO L82 PathProgramCache]: Analyzing trace with hash 768718112, now seen corresponding path program 2 times [2021-06-05 09:15:47,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:47,685 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746865960] [2021-06-05 09:15:47,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:15:47,800 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:47,800 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746865960] [2021-06-05 09:15:47,800 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746865960] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:47,801 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592392746] [2021-06-05 09:15:47,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:15:47,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:15:47,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:15:47,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 09:15:47,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:15:47,974 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 09:15:47,975 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:47,982 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:47,983 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:47,983 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-06-05 09:15:48,012 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:15:48,012 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 09:15:48,014 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:48,020 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:48,021 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:48,021 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2021-06-05 09:15:48,042 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 11 treesize of output 7 [2021-06-05 09:15:48,043 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:48,050 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:48,051 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 09:15:48,051 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2021-06-05 09:15:48,076 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 26 treesize of output 21 [2021-06-05 09:15:48,077 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:48,085 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:48,086 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 09:15:48,086 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2021-06-05 09:15:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:15:48,108 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592392746] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:48,108 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:15:48,108 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2021-06-05 09:15:48,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953402546] [2021-06-05 09:15:48,108 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 09:15:48,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:48,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 09:15:48,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:15:48,109 INFO L87 Difference]: Start difference. First operand 106076 states and 409677 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:15:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:49,656 INFO L93 Difference]: Finished difference Result 106505 states and 411393 transitions. [2021-06-05 09:15:49,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:15:49,657 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 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 54 [2021-06-05 09:15:49,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:50,046 INFO L225 Difference]: With dead ends: 106505 [2021-06-05 09:15:50,046 INFO L226 Difference]: Without dead ends: 106505 [2021-06-05 09:15:50,047 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 171.1ms TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:15:51,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106505 states. [2021-06-05 09:15:53,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106505 to 106116. [2021-06-05 09:15:53,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106116 states, 106090 states have (on average 3.8630879441983224) internal successors, (409835), 106115 states have internal predecessors, (409835), 0 states have call successors, (0), 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 09:15:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106116 states to 106116 states and 409835 transitions. [2021-06-05 09:15:53,687 INFO L78 Accepts]: Start accepts. Automaton has 106116 states and 409835 transitions. Word has length 54 [2021-06-05 09:15:53,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:53,687 INFO L482 AbstractCegarLoop]: Abstraction has 106116 states and 409835 transitions. [2021-06-05 09:15:53,687 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:15:53,688 INFO L276 IsEmpty]: Start isEmpty. Operand 106116 states and 409835 transitions. [2021-06-05 09:15:54,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:15:54,243 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:54,243 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:15:54,456 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:15:54,457 INFO L430 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:54,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:54,457 INFO L82 PathProgramCache]: Analyzing trace with hash 349398498, now seen corresponding path program 3 times [2021-06-05 09:15:54,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:54,457 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851339417] [2021-06-05 09:15:54,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:15:54,562 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:54,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851339417] [2021-06-05 09:15:54,562 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851339417] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:54,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201114580] [2021-06-05 09:15:54,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:15:54,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:15:54,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:15:54,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 24 conjunts are in the unsatisfiable core [2021-06-05 09:15:54,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:15:54,718 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 16 treesize of output 12 [2021-06-05 09:15:54,719 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:54,729 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:54,732 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:54,732 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:49 [2021-06-05 09:15:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:54,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201114580] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:54,771 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:15:54,772 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2021-06-05 09:15:54,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432084854] [2021-06-05 09:15:54,772 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 09:15:54,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:54,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 09:15:54,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:54,773 INFO L87 Difference]: Start difference. First operand 106116 states and 409835 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:15:55,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:55,558 INFO L93 Difference]: Finished difference Result 115505 states and 450147 transitions. [2021-06-05 09:15:55,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 09:15:55,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:15:55,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:55,902 INFO L225 Difference]: With dead ends: 115505 [2021-06-05 09:15:55,902 INFO L226 Difference]: Without dead ends: 115505 [2021-06-05 09:15:55,903 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 136.8ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:15:57,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115505 states. [2021-06-05 09:15:59,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115505 to 104509. [2021-06-05 09:15:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104509 states, 104483 states have (on average 3.8591828335710114) internal successors, (403219), 104508 states have internal predecessors, (403219), 0 states have call successors, (0), 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 09:16:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104509 states to 104509 states and 403219 transitions. [2021-06-05 09:16:00,220 INFO L78 Accepts]: Start accepts. Automaton has 104509 states and 403219 transitions. Word has length 54 [2021-06-05 09:16:00,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:00,220 INFO L482 AbstractCegarLoop]: Abstraction has 104509 states and 403219 transitions. [2021-06-05 09:16:00,220 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:16:00,220 INFO L276 IsEmpty]: Start isEmpty. Operand 104509 states and 403219 transitions. [2021-06-05 09:16:00,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:16:00,234 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:00,234 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:16:00,435 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:00,435 INFO L430 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:00,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:00,436 INFO L82 PathProgramCache]: Analyzing trace with hash 263657952, now seen corresponding path program 3 times [2021-06-05 09:16:00,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:00,436 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621157332] [2021-06-05 09:16:00,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:00,520 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:00,520 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621157332] [2021-06-05 09:16:00,520 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621157332] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:00,520 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307052071] [2021-06-05 09:16:00,521 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 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 09:16:00,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 09:16:00,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:16:00,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 09:16:00,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:16:00,668 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 09:16:00,669 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:00,675 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:00,676 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:00,676 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-06-05 09:16:00,698 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 11 treesize of output 7 [2021-06-05 09:16:00,699 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:00,706 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:00,707 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 09:16:00,707 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2021-06-05 09:16:00,731 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:16:00,731 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 09:16:00,732 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:00,738 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:00,739 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:00,739 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2021-06-05 09:16:00,764 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 26 treesize of output 21 [2021-06-05 09:16:00,766 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:00,776 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:00,777 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 09:16:00,777 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2021-06-05 09:16:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:00,797 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307052071] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:00,797 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:16:00,797 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2021-06-05 09:16:00,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410442760] [2021-06-05 09:16:00,797 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 09:16:00,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:00,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 09:16:00,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:16:00,798 INFO L87 Difference]: Start difference. First operand 104509 states and 403219 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:16:02,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:02,359 INFO L93 Difference]: Finished difference Result 104863 states and 404635 transitions. [2021-06-05 09:16:02,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:16:02,359 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 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 54 [2021-06-05 09:16:02,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:02,675 INFO L225 Difference]: With dead ends: 104863 [2021-06-05 09:16:02,675 INFO L226 Difference]: Without dead ends: 104863 [2021-06-05 09:16:02,676 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 145.0ms TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:16:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104863 states. [2021-06-05 09:16:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104863 to 104579. [2021-06-05 09:16:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104579 states, 104553 states have (on average 3.8593153711514736) internal successors, (403503), 104578 states have internal predecessors, (403503), 0 states have call successors, (0), 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 09:16:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104579 states to 104579 states and 403503 transitions. [2021-06-05 09:16:06,864 INFO L78 Accepts]: Start accepts. Automaton has 104579 states and 403503 transitions. Word has length 54 [2021-06-05 09:16:06,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:06,864 INFO L482 AbstractCegarLoop]: Abstraction has 104579 states and 403503 transitions. [2021-06-05 09:16:06,865 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:16:06,865 INFO L276 IsEmpty]: Start isEmpty. Operand 104579 states and 403503 transitions. [2021-06-05 09:16:06,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:16:06,882 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:06,882 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:16:07,082 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:07,083 INFO L430 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:07,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:07,083 INFO L82 PathProgramCache]: Analyzing trace with hash 438245314, now seen corresponding path program 4 times [2021-06-05 09:16:07,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:07,083 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211109903] [2021-06-05 09:16:07,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:07,185 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:07,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211109903] [2021-06-05 09:16:07,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211109903] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:07,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148495514] [2021-06-05 09:16:07,185 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 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 09:16:07,280 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:16:07,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:16:07,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 09:16:07,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:16:07,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 09:16:07,362 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:07,367 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:07,367 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:07,367 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2021-06-05 09:16:07,376 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:16:07,376 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 09:16:07,378 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:07,385 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:07,386 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:07,386 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2021-06-05 09:16:07,410 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 11 treesize of output 7 [2021-06-05 09:16:07,411 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:07,420 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:07,421 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 09:16:07,421 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2021-06-05 09:16:07,452 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 26 treesize of output 21 [2021-06-05 09:16:07,454 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:07,468 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:07,470 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 09:16:07,470 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2021-06-05 09:16:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:07,491 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148495514] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:07,491 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:16:07,491 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2021-06-05 09:16:07,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073130746] [2021-06-05 09:16:07,491 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 09:16:07,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:07,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 09:16:07,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:16:07,492 INFO L87 Difference]: Start difference. First operand 104579 states and 403503 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:16:08,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:08,865 INFO L93 Difference]: Finished difference Result 105334 states and 406569 transitions. [2021-06-05 09:16:08,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:16:08,865 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 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 54 [2021-06-05 09:16:08,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:09,268 INFO L225 Difference]: With dead ends: 105334 [2021-06-05 09:16:09,269 INFO L226 Difference]: Without dead ends: 105334 [2021-06-05 09:16:09,269 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 159.2ms TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:16:10,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105334 states. [2021-06-05 09:16:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105334 to 104954. [2021-06-05 09:16:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104954 states, 104928 states have (on average 3.860151723086307) internal successors, (405038), 104953 states have internal predecessors, (405038), 0 states have call successors, (0), 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 09:16:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104954 states to 104954 states and 405038 transitions. [2021-06-05 09:16:13,804 INFO L78 Accepts]: Start accepts. Automaton has 104954 states and 405038 transitions. Word has length 54 [2021-06-05 09:16:13,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:13,805 INFO L482 AbstractCegarLoop]: Abstraction has 104954 states and 405038 transitions. [2021-06-05 09:16:13,805 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 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 09:16:13,805 INFO L276 IsEmpty]: Start isEmpty. Operand 104954 states and 405038 transitions. [2021-06-05 09:16:13,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:16:13,823 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:13,823 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:16:14,044 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:14,045 INFO L430 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:14,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:14,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1422813152, now seen corresponding path program 5 times [2021-06-05 09:16:14,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:14,046 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967057373] [2021-06-05 09:16:14,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:14,199 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:14,200 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:14,200 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967057373] [2021-06-05 09:16:14,200 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967057373] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:14,200 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:14,200 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:16:14,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483844903] [2021-06-05 09:16:14,200 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:16:14,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:14,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:16:14,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:16:14,201 INFO L87 Difference]: Start difference. First operand 104954 states and 405038 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:16:15,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:15,698 INFO L93 Difference]: Finished difference Result 105333 states and 406549 transitions. [2021-06-05 09:16:15,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:16:15,699 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:16:15,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:16,065 INFO L225 Difference]: With dead ends: 105333 [2021-06-05 09:16:16,065 INFO L226 Difference]: Without dead ends: 105333 [2021-06-05 09:16:16,065 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 82.7ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:17,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105333 states. [2021-06-05 09:16:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105333 to 104954. [2021-06-05 09:16:19,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104954 states, 104928 states have (on average 3.860151723086307) internal successors, (405038), 104953 states have internal predecessors, (405038), 0 states have call successors, (0), 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 09:16:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104954 states to 104954 states and 405038 transitions. [2021-06-05 09:16:20,375 INFO L78 Accepts]: Start accepts. Automaton has 104954 states and 405038 transitions. Word has length 54 [2021-06-05 09:16:20,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:20,375 INFO L482 AbstractCegarLoop]: Abstraction has 104954 states and 405038 transitions. [2021-06-05 09:16:20,376 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:16:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 104954 states and 405038 transitions. [2021-06-05 09:16:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:16:20,412 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:20,412 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:16:20,412 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-06-05 09:16:20,412 INFO L430 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:20,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:20,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1927873312, now seen corresponding path program 6 times [2021-06-05 09:16:20,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:20,413 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191930788] [2021-06-05 09:16:20,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:20,556 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:20,556 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191930788] [2021-06-05 09:16:20,556 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191930788] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:20,556 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:20,557 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:16:20,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186564676] [2021-06-05 09:16:20,557 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:16:20,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:20,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:16:20,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:16:20,557 INFO L87 Difference]: Start difference. First operand 104954 states and 405038 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:16:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:21,471 INFO L93 Difference]: Finished difference Result 105308 states and 406454 transitions. [2021-06-05 09:16:21,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:16:21,472 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:16:21,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:21,786 INFO L225 Difference]: With dead ends: 105308 [2021-06-05 09:16:21,786 INFO L226 Difference]: Without dead ends: 105308 [2021-06-05 09:16:21,787 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 79.5ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:23,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105308 states. [2021-06-05 09:16:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105308 to 104814. [2021-06-05 09:16:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104814 states, 104788 states have (on average 3.8598885368553653) internal successors, (404470), 104813 states have internal predecessors, (404470), 0 states have call successors, (0), 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 09:16:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104814 states to 104814 states and 404470 transitions. [2021-06-05 09:16:25,935 INFO L78 Accepts]: Start accepts. Automaton has 104814 states and 404470 transitions. Word has length 54 [2021-06-05 09:16:25,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:25,935 INFO L482 AbstractCegarLoop]: Abstraction has 104814 states and 404470 transitions. [2021-06-05 09:16:25,935 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:16:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 104814 states and 404470 transitions. [2021-06-05 09:16:25,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:16:25,950 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:25,951 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:16:25,951 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-06-05 09:16:25,951 INFO L430 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:25,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:25,951 INFO L82 PathProgramCache]: Analyzing trace with hash 707049340, now seen corresponding path program 1 times [2021-06-05 09:16:25,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:25,951 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058208329] [2021-06-05 09:16:25,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:26,034 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:26,034 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:26,034 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058208329] [2021-06-05 09:16:26,034 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058208329] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:26,034 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:26,034 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:16:26,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111029339] [2021-06-05 09:16:26,034 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:16:26,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:26,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:16:26,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:16:26,035 INFO L87 Difference]: Start difference. First operand 104814 states and 404470 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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 09:16:27,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:27,332 INFO L93 Difference]: Finished difference Result 105148 states and 405797 transitions. [2021-06-05 09:16:27,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:16:27,333 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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 54 [2021-06-05 09:16:27,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:27,721 INFO L225 Difference]: With dead ends: 105148 [2021-06-05 09:16:27,721 INFO L226 Difference]: Without dead ends: 105146 [2021-06-05 09:16:27,721 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 67.6ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:29,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105146 states. [2021-06-05 09:16:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105146 to 104946. [2021-06-05 09:16:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104946 states, 104920 states have (on average 3.8600648112847886) internal successors, (404998), 104945 states have internal predecessors, (404998), 0 states have call successors, (0), 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 09:16:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104946 states to 104946 states and 404998 transitions. [2021-06-05 09:16:31,320 INFO L78 Accepts]: Start accepts. Automaton has 104946 states and 404998 transitions. Word has length 54 [2021-06-05 09:16:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:31,320 INFO L482 AbstractCegarLoop]: Abstraction has 104946 states and 404998 transitions. [2021-06-05 09:16:31,320 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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 09:16:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 104946 states and 404998 transitions. [2021-06-05 09:16:31,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:16:31,336 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:31,336 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:16:31,336 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-06-05 09:16:31,336 INFO L430 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:31,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:31,336 INFO L82 PathProgramCache]: Analyzing trace with hash 716563676, now seen corresponding path program 2 times [2021-06-05 09:16:31,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:31,336 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030536323] [2021-06-05 09:16:31,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:31,401 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:31,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030536323] [2021-06-05 09:16:31,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030536323] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:31,402 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:31,402 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:16:31,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076372892] [2021-06-05 09:16:31,402 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:16:31,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:31,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:16:31,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:16:31,402 INFO L87 Difference]: Start difference. First operand 104946 states and 404998 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:16:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:32,813 INFO L93 Difference]: Finished difference Result 103976 states and 401471 transitions. [2021-06-05 09:16:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 09:16:32,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:16:32,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:33,124 INFO L225 Difference]: With dead ends: 103976 [2021-06-05 09:16:33,125 INFO L226 Difference]: Without dead ends: 103976 [2021-06-05 09:16:33,125 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.2ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:16:34,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103976 states. [2021-06-05 09:16:36,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103976 to 103976. [2021-06-05 09:16:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103976 states, 103953 states have (on average 3.8620434234702223) internal successors, (401471), 103975 states have internal predecessors, (401471), 0 states have call successors, (0), 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 09:16:37,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103976 states to 103976 states and 401471 transitions. [2021-06-05 09:16:37,413 INFO L78 Accepts]: Start accepts. Automaton has 103976 states and 401471 transitions. Word has length 54 [2021-06-05 09:16:37,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:37,413 INFO L482 AbstractCegarLoop]: Abstraction has 103976 states and 401471 transitions. [2021-06-05 09:16:37,413 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:16:37,413 INFO L276 IsEmpty]: Start isEmpty. Operand 103976 states and 401471 transitions. [2021-06-05 09:16:37,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:16:37,432 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:37,432 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:16:37,432 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-06-05 09:16:37,432 INFO L430 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:37,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:37,433 INFO L82 PathProgramCache]: Analyzing trace with hash 647029978, now seen corresponding path program 1 times [2021-06-05 09:16:37,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:37,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467974279] [2021-06-05 09:16:37,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:37,520 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:37,521 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:37,521 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467974279] [2021-06-05 09:16:37,521 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467974279] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:37,521 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:37,521 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:16:37,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484598029] [2021-06-05 09:16:37,521 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:16:37,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:37,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:16:37,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:16:37,522 INFO L87 Difference]: Start difference. First operand 103976 states and 401471 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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 09:16:38,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:38,173 INFO L93 Difference]: Finished difference Result 104279 states and 402675 transitions. [2021-06-05 09:16:38,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:16:38,173 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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 54 [2021-06-05 09:16:38,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:39,081 INFO L225 Difference]: With dead ends: 104279 [2021-06-05 09:16:39,081 INFO L226 Difference]: Without dead ends: 104276 [2021-06-05 09:16:39,081 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 72.2ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104276 states. [2021-06-05 09:16:41,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104276 to 104018. [2021-06-05 09:16:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104018 states, 103995 states have (on average 3.8621279869224483) internal successors, (401642), 104017 states have internal predecessors, (401642), 0 states have call successors, (0), 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 09:16:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104018 states to 104018 states and 401642 transitions. [2021-06-05 09:16:42,461 INFO L78 Accepts]: Start accepts. Automaton has 104018 states and 401642 transitions. Word has length 54 [2021-06-05 09:16:42,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:42,461 INFO L482 AbstractCegarLoop]: Abstraction has 104018 states and 401642 transitions. [2021-06-05 09:16:42,461 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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 09:16:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 104018 states and 401642 transitions. [2021-06-05 09:16:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:16:42,477 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:42,477 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:16:42,477 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-06-05 09:16:42,477 INFO L430 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:42,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:42,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1761823704, now seen corresponding path program 7 times [2021-06-05 09:16:42,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:42,478 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819388737] [2021-06-05 09:16:42,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:42,564 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:42,564 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:42,564 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819388737] [2021-06-05 09:16:42,564 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819388737] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:42,564 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:42,564 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:16:42,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508666431] [2021-06-05 09:16:42,565 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:16:42,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:42,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:16:42,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:16:42,565 INFO L87 Difference]: Start difference. First operand 104018 states and 401642 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:16:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:43,881 INFO L93 Difference]: Finished difference Result 104399 states and 403151 transitions. [2021-06-05 09:16:43,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:16:43,881 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:16:43,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:44,232 INFO L225 Difference]: With dead ends: 104399 [2021-06-05 09:16:44,232 INFO L226 Difference]: Without dead ends: 104399 [2021-06-05 09:16:44,232 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 70.8ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:45,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104399 states. [2021-06-05 09:16:47,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104399 to 104034. [2021-06-05 09:16:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104034 states, 104011 states have (on average 3.8621107382872966) internal successors, (401702), 104033 states have internal predecessors, (401702), 0 states have call successors, (0), 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 09:16:48,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104034 states to 104034 states and 401702 transitions. [2021-06-05 09:16:48,529 INFO L78 Accepts]: Start accepts. Automaton has 104034 states and 401702 transitions. Word has length 54 [2021-06-05 09:16:48,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:48,529 INFO L482 AbstractCegarLoop]: Abstraction has 104034 states and 401702 transitions. [2021-06-05 09:16:48,529 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:16:48,529 INFO L276 IsEmpty]: Start isEmpty. Operand 104034 states and 401702 transitions. [2021-06-05 09:16:48,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:16:48,549 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:48,549 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:16:48,549 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-06-05 09:16:48,549 INFO L430 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:48,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:48,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1822483163, now seen corresponding path program 1 times [2021-06-05 09:16:48,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:48,550 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709065314] [2021-06-05 09:16:48,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:48,664 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:48,664 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709065314] [2021-06-05 09:16:48,664 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709065314] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:48,664 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:48,664 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 09:16:48,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948811188] [2021-06-05 09:16:48,664 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 09:16:48,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:48,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 09:16:48,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:16:48,665 INFO L87 Difference]: Start difference. First operand 104034 states and 401702 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 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 09:16:49,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:49,433 INFO L93 Difference]: Finished difference Result 104175 states and 402261 transitions. [2021-06-05 09:16:49,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:16:49,434 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 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 54 [2021-06-05 09:16:49,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:49,748 INFO L225 Difference]: With dead ends: 104175 [2021-06-05 09:16:49,748 INFO L226 Difference]: Without dead ends: 104175 [2021-06-05 09:16:49,749 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 96.5ms TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:16:51,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104175 states. [2021-06-05 09:16:53,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104175 to 104084. [2021-06-05 09:16:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104084 states, 104061 states have (on average 3.862176992341031) internal successors, (401902), 104083 states have internal predecessors, (401902), 0 states have call successors, (0), 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 09:16:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104084 states to 104084 states and 401902 transitions. [2021-06-05 09:16:53,816 INFO L78 Accepts]: Start accepts. Automaton has 104084 states and 401902 transitions. Word has length 54 [2021-06-05 09:16:53,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:53,816 INFO L482 AbstractCegarLoop]: Abstraction has 104084 states and 401902 transitions. [2021-06-05 09:16:53,816 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 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 09:16:53,817 INFO L276 IsEmpty]: Start isEmpty. Operand 104084 states and 401902 transitions. [2021-06-05 09:16:53,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:16:53,832 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:53,832 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:16:53,832 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-06-05 09:16:53,832 INFO L430 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:53,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:53,832 INFO L82 PathProgramCache]: Analyzing trace with hash 837815403, now seen corresponding path program 2 times [2021-06-05 09:16:53,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:53,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242671931] [2021-06-05 09:16:53,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:53,938 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:53,938 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242671931] [2021-06-05 09:16:53,939 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242671931] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:53,939 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:53,939 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:16:53,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235777720] [2021-06-05 09:16:53,939 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:16:53,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:53,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:16:53,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:16:53,939 INFO L87 Difference]: Start difference. First operand 104084 states and 401902 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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 09:16:55,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:55,266 INFO L93 Difference]: Finished difference Result 106504 states and 411871 transitions. [2021-06-05 09:16:55,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:16:55,267 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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 54 [2021-06-05 09:16:55,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:55,632 INFO L225 Difference]: With dead ends: 106504 [2021-06-05 09:16:55,632 INFO L226 Difference]: Without dead ends: 106496 [2021-06-05 09:16:55,632 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 89.1ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106496 states. [2021-06-05 09:16:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106496 to 105454. [2021-06-05 09:16:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105454 states, 105431 states have (on average 3.864698238658459) internal successors, (407459), 105453 states have internal predecessors, (407459), 0 states have call successors, (0), 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 09:17:00,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105454 states to 105454 states and 407459 transitions. [2021-06-05 09:17:00,337 INFO L78 Accepts]: Start accepts. Automaton has 105454 states and 407459 transitions. Word has length 54 [2021-06-05 09:17:00,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:00,337 INFO L482 AbstractCegarLoop]: Abstraction has 105454 states and 407459 transitions. [2021-06-05 09:17:00,337 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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 09:17:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 105454 states and 407459 transitions. [2021-06-05 09:17:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:17:00,358 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:00,358 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:17:00,359 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-06-05 09:17:00,359 INFO L430 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:00,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:00,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1055722692, now seen corresponding path program 2 times [2021-06-05 09:17:00,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:00,360 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710998959] [2021-06-05 09:17:00,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:17:00,575 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:00,575 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710998959] [2021-06-05 09:17:00,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710998959] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:00,575 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:00,575 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:17:00,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968792604] [2021-06-05 09:17:00,575 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:17:00,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:00,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:17:00,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:17:00,576 INFO L87 Difference]: Start difference. First operand 105454 states and 407459 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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 09:17:02,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:02,162 INFO L93 Difference]: Finished difference Result 105959 states and 409517 transitions. [2021-06-05 09:17:02,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:17:02,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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 54 [2021-06-05 09:17:02,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:02,521 INFO L225 Difference]: With dead ends: 105959 [2021-06-05 09:17:02,521 INFO L226 Difference]: Without dead ends: 105950 [2021-06-05 09:17:02,522 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 137.8ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105950 states. [2021-06-05 09:17:05,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105950 to 105299. [2021-06-05 09:17:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105299 states, 105276 states have (on average 3.864727003305597) internal successors, (406863), 105298 states have internal predecessors, (406863), 0 states have call successors, (0), 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 09:17:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105299 states to 105299 states and 406863 transitions. [2021-06-05 09:17:06,782 INFO L78 Accepts]: Start accepts. Automaton has 105299 states and 406863 transitions. Word has length 54 [2021-06-05 09:17:06,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:06,782 INFO L482 AbstractCegarLoop]: Abstraction has 105299 states and 406863 transitions. [2021-06-05 09:17:06,782 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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 09:17:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 105299 states and 406863 transitions. [2021-06-05 09:17:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:17:06,804 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:06,804 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:17:06,804 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-06-05 09:17:06,804 INFO L430 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:06,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:06,805 INFO L82 PathProgramCache]: Analyzing trace with hash -725971590, now seen corresponding path program 8 times [2021-06-05 09:17:06,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:06,805 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982892038] [2021-06-05 09:17:06,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:06,940 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:06,940 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982892038] [2021-06-05 09:17:06,940 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982892038] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:06,940 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:06,940 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:17:06,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906716355] [2021-06-05 09:17:06,941 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:17:06,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:06,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:17:06,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:17:06,941 INFO L87 Difference]: Start difference. First operand 105299 states and 406863 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:07,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:07,879 INFO L93 Difference]: Finished difference Result 105658 states and 408284 transitions. [2021-06-05 09:17:07,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:17:07,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:17:07,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:08,194 INFO L225 Difference]: With dead ends: 105658 [2021-06-05 09:17:08,194 INFO L226 Difference]: Without dead ends: 105658 [2021-06-05 09:17:08,194 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 89.3ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105658 states. [2021-06-05 09:17:11,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105658 to 105228. [2021-06-05 09:17:11,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105228 states, 105205 states have (on average 3.8646642269854095) internal successors, (406582), 105227 states have internal predecessors, (406582), 0 states have call successors, (0), 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 09:17:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105228 states to 105228 states and 406582 transitions. [2021-06-05 09:17:12,297 INFO L78 Accepts]: Start accepts. Automaton has 105228 states and 406582 transitions. Word has length 54 [2021-06-05 09:17:12,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:12,297 INFO L482 AbstractCegarLoop]: Abstraction has 105228 states and 406582 transitions. [2021-06-05 09:17:12,297 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 105228 states and 406582 transitions. [2021-06-05 09:17:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:17:12,314 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:12,315 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:17:12,315 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-06-05 09:17:12,315 INFO L430 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:12,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:12,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1190305990, now seen corresponding path program 3 times [2021-06-05 09:17:12,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:12,315 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463003639] [2021-06-05 09:17:12,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:12,405 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:12,405 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463003639] [2021-06-05 09:17:12,405 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463003639] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:12,405 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:12,405 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:17:12,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768208156] [2021-06-05 09:17:12,406 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:17:12,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:12,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:17:12,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:17:12,406 INFO L87 Difference]: Start difference. First operand 105228 states and 406582 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:13,801 INFO L93 Difference]: Finished difference Result 105486 states and 407607 transitions. [2021-06-05 09:17:13,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:17:13,802 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:17:13,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:14,169 INFO L225 Difference]: With dead ends: 105486 [2021-06-05 09:17:14,169 INFO L226 Difference]: Without dead ends: 105483 [2021-06-05 09:17:14,169 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 72.7ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:15,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105483 states. [2021-06-05 09:17:17,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105483 to 105177. [2021-06-05 09:17:17,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105177 states, 105154 states have (on average 3.8646271183216996) internal successors, (406381), 105176 states have internal predecessors, (406381), 0 states have call successors, (0), 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 09:17:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105177 states to 105177 states and 406381 transitions. [2021-06-05 09:17:17,749 INFO L78 Accepts]: Start accepts. Automaton has 105177 states and 406381 transitions. Word has length 54 [2021-06-05 09:17:17,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:17,750 INFO L482 AbstractCegarLoop]: Abstraction has 105177 states and 406381 transitions. [2021-06-05 09:17:17,750 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 105177 states and 406381 transitions. [2021-06-05 09:17:18,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:17:18,329 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:18,330 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:17:18,330 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-06-05 09:17:18,330 INFO L430 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:18,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:18,330 INFO L82 PathProgramCache]: Analyzing trace with hash 441201650, now seen corresponding path program 3 times [2021-06-05 09:17:18,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:18,330 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946567829] [2021-06-05 09:17:18,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:18,561 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:18,561 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946567829] [2021-06-05 09:17:18,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946567829] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:18,561 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:18,561 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:17:18,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379751160] [2021-06-05 09:17:18,561 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:17:18,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:18,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:17:18,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:17:18,562 INFO L87 Difference]: Start difference. First operand 105177 states and 406381 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:19,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:19,427 INFO L93 Difference]: Finished difference Result 105445 states and 407445 transitions. [2021-06-05 09:17:19,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:17:19,428 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:17:19,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:19,739 INFO L225 Difference]: With dead ends: 105445 [2021-06-05 09:17:19,739 INFO L226 Difference]: Without dead ends: 105443 [2021-06-05 09:17:19,740 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 131.9ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105443 states. [2021-06-05 09:17:23,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105443 to 105327. [2021-06-05 09:17:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105327 states, 105304 states have (on average 3.8648959203828914) internal successors, (406989), 105326 states have internal predecessors, (406989), 0 states have call successors, (0), 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 09:17:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105327 states to 105327 states and 406989 transitions. [2021-06-05 09:17:23,827 INFO L78 Accepts]: Start accepts. Automaton has 105327 states and 406989 transitions. Word has length 54 [2021-06-05 09:17:23,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:23,827 INFO L482 AbstractCegarLoop]: Abstraction has 105327 states and 406989 transitions. [2021-06-05 09:17:23,828 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand 105327 states and 406989 transitions. [2021-06-05 09:17:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:17:23,845 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:23,845 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:17:23,845 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-06-05 09:17:23,845 INFO L430 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:23,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:23,845 INFO L82 PathProgramCache]: Analyzing trace with hash 381182288, now seen corresponding path program 4 times [2021-06-05 09:17:23,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:23,846 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324969039] [2021-06-05 09:17:23,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:23,963 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:23,963 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324969039] [2021-06-05 09:17:23,964 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324969039] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:23,964 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:23,964 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:17:23,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57509680] [2021-06-05 09:17:23,964 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:17:23,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:23,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:17:23,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:17:23,964 INFO L87 Difference]: Start difference. First operand 105327 states and 406989 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:25,229 INFO L93 Difference]: Finished difference Result 105592 states and 408026 transitions. [2021-06-05 09:17:25,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:17:25,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:17:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:25,609 INFO L225 Difference]: With dead ends: 105592 [2021-06-05 09:17:25,610 INFO L226 Difference]: Without dead ends: 105589 [2021-06-05 09:17:25,610 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 98.8ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:27,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105589 states. [2021-06-05 09:17:28,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105589 to 105321. [2021-06-05 09:17:28,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105321 states, 105298 states have (on average 3.864935706281221) internal successors, (406970), 105320 states have internal predecessors, (406970), 0 states have call successors, (0), 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 09:17:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105321 states to 105321 states and 406970 transitions. [2021-06-05 09:17:29,201 INFO L78 Accepts]: Start accepts. Automaton has 105321 states and 406970 transitions. Word has length 54 [2021-06-05 09:17:29,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:29,201 INFO L482 AbstractCegarLoop]: Abstraction has 105321 states and 406970 transitions. [2021-06-05 09:17:29,201 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:29,201 INFO L276 IsEmpty]: Start isEmpty. Operand 105321 states and 406970 transitions. [2021-06-05 09:17:29,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:17:29,218 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:29,219 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:17:29,219 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-06-05 09:17:29,219 INFO L430 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:29,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:29,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1531433358, now seen corresponding path program 5 times [2021-06-05 09:17:29,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:29,219 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468549007] [2021-06-05 09:17:29,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:29,333 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:29,333 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468549007] [2021-06-05 09:17:29,333 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468549007] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:29,334 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:29,334 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:17:29,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043775485] [2021-06-05 09:17:29,334 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:17:29,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:29,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:17:29,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:17:29,335 INFO L87 Difference]: Start difference. First operand 105321 states and 406970 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:30,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:30,799 INFO L93 Difference]: Finished difference Result 105821 states and 409012 transitions. [2021-06-05 09:17:30,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:17:30,799 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:17:30,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:31,108 INFO L225 Difference]: With dead ends: 105821 [2021-06-05 09:17:31,108 INFO L226 Difference]: Without dead ends: 105815 [2021-06-05 09:17:31,108 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 98.8ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:32,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105815 states. [2021-06-05 09:17:34,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105815 to 105269. [2021-06-05 09:17:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105269 states, 105246 states have (on average 3.8646694411189024) internal successors, (406741), 105268 states have internal predecessors, (406741), 0 states have call successors, (0), 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 09:17:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105269 states to 105269 states and 406741 transitions. [2021-06-05 09:17:35,335 INFO L78 Accepts]: Start accepts. Automaton has 105269 states and 406741 transitions. Word has length 54 [2021-06-05 09:17:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:35,335 INFO L482 AbstractCegarLoop]: Abstraction has 105269 states and 406741 transitions. [2021-06-05 09:17:35,335 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:35,335 INFO L276 IsEmpty]: Start isEmpty. Operand 105269 states and 406741 transitions. [2021-06-05 09:17:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:17:35,354 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:35,354 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:17:35,354 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-06-05 09:17:35,354 INFO L430 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:35,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:35,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1925207545, now seen corresponding path program 3 times [2021-06-05 09:17:35,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:35,354 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093182205] [2021-06-05 09:17:35,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:35,447 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:35,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093182205] [2021-06-05 09:17:35,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093182205] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:35,447 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:35,447 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:17:35,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66065492] [2021-06-05 09:17:35,447 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:17:35,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:35,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:17:35,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:17:35,448 INFO L87 Difference]: Start difference. First operand 105269 states and 406741 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:36,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:36,775 INFO L93 Difference]: Finished difference Result 106540 states and 411901 transitions. [2021-06-05 09:17:36,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:17:36,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:17:36,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:37,238 INFO L225 Difference]: With dead ends: 106540 [2021-06-05 09:17:37,238 INFO L226 Difference]: Without dead ends: 106540 [2021-06-05 09:17:37,238 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 79.2ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:38,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106540 states. [2021-06-05 09:17:40,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106540 to 105464. [2021-06-05 09:17:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105464 states, 105441 states have (on average 3.865147333579917) internal successors, (407545), 105463 states have internal predecessors, (407545), 0 states have call successors, (0), 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 09:17:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105464 states to 105464 states and 407545 transitions. [2021-06-05 09:17:40,783 INFO L78 Accepts]: Start accepts. Automaton has 105464 states and 407545 transitions. Word has length 54 [2021-06-05 09:17:40,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:40,783 INFO L482 AbstractCegarLoop]: Abstraction has 105464 states and 407545 transitions. [2021-06-05 09:17:40,783 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 105464 states and 407545 transitions. [2021-06-05 09:17:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:17:40,801 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:40,801 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:17:40,801 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-06-05 09:17:40,801 INFO L430 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:40,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:40,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1245377393, now seen corresponding path program 4 times [2021-06-05 09:17:40,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:40,802 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119037820] [2021-06-05 09:17:40,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:40,889 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:40,889 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119037820] [2021-06-05 09:17:40,889 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119037820] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:40,889 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:40,889 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:17:40,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370334143] [2021-06-05 09:17:40,889 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:17:40,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:40,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:17:40,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:17:40,890 INFO L87 Difference]: Start difference. First operand 105464 states and 407545 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:42,413 INFO L93 Difference]: Finished difference Result 106135 states and 410265 transitions. [2021-06-05 09:17:42,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:17:42,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:17:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:42,727 INFO L225 Difference]: With dead ends: 106135 [2021-06-05 09:17:42,727 INFO L226 Difference]: Without dead ends: 106135 [2021-06-05 09:17:42,727 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 72.0ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:44,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106135 states. [2021-06-05 09:17:47,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106135 to 105404. [2021-06-05 09:17:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105404 states, 105381 states have (on average 3.8650515747620537) internal successors, (407303), 105403 states have internal predecessors, (407303), 0 states have call successors, (0), 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 09:17:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105404 states to 105404 states and 407303 transitions. [2021-06-05 09:17:47,704 INFO L78 Accepts]: Start accepts. Automaton has 105404 states and 407303 transitions. Word has length 54 [2021-06-05 09:17:47,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:47,704 INFO L482 AbstractCegarLoop]: Abstraction has 105404 states and 407303 transitions. [2021-06-05 09:17:47,704 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:47,705 INFO L276 IsEmpty]: Start isEmpty. Operand 105404 states and 407303 transitions. [2021-06-05 09:17:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:17:47,727 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:47,727 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:17:47,727 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-06-05 09:17:47,727 INFO L430 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:47,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:47,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2045381969, now seen corresponding path program 5 times [2021-06-05 09:17:47,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:47,728 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805020325] [2021-06-05 09:17:47,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:47,876 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:47,876 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805020325] [2021-06-05 09:17:47,876 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805020325] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:47,877 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:47,877 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:17:47,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127627314] [2021-06-05 09:17:47,877 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:17:47,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:47,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:17:47,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:17:47,877 INFO L87 Difference]: Start difference. First operand 105404 states and 407303 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:49,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:49,482 INFO L93 Difference]: Finished difference Result 106096 states and 410157 transitions. [2021-06-05 09:17:49,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:17:49,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:17:49,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:49,845 INFO L225 Difference]: With dead ends: 106096 [2021-06-05 09:17:49,846 INFO L226 Difference]: Without dead ends: 106096 [2021-06-05 09:17:49,846 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 101.7ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106096 states. [2021-06-05 09:17:53,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106096 to 105379. [2021-06-05 09:17:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105379 states, 105356 states have (on average 3.865209385322146) internal successors, (407223), 105378 states have internal predecessors, (407223), 0 states have call successors, (0), 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 09:17:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105379 states to 105379 states and 407223 transitions. [2021-06-05 09:17:54,136 INFO L78 Accepts]: Start accepts. Automaton has 105379 states and 407223 transitions. Word has length 54 [2021-06-05 09:17:54,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:54,136 INFO L482 AbstractCegarLoop]: Abstraction has 105379 states and 407223 transitions. [2021-06-05 09:17:54,136 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:54,136 INFO L276 IsEmpty]: Start isEmpty. Operand 105379 states and 407223 transitions. [2021-06-05 09:17:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:17:54,159 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:54,160 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:17:54,160 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-06-05 09:17:54,160 INFO L430 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:54,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:54,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1820422547, now seen corresponding path program 6 times [2021-06-05 09:17:54,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:54,160 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120709508] [2021-06-05 09:17:54,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:54,253 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:54,253 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120709508] [2021-06-05 09:17:54,253 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120709508] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:54,253 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:54,253 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:17:54,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69092743] [2021-06-05 09:17:54,257 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:17:54,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:54,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:17:54,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:17:54,257 INFO L87 Difference]: Start difference. First operand 105379 states and 407223 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:55,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:55,017 INFO L93 Difference]: Finished difference Result 105498 states and 407937 transitions. [2021-06-05 09:17:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:17:55,018 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:17:55,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:55,338 INFO L225 Difference]: With dead ends: 105498 [2021-06-05 09:17:55,339 INFO L226 Difference]: Without dead ends: 105498 [2021-06-05 09:17:55,339 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 75.7ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105498 states. [2021-06-05 09:17:58,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105498 to 104296. [2021-06-05 09:17:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104296 states, 104273 states have (on average 3.8650465604710713) internal successors, (403020), 104295 states have internal predecessors, (403020), 0 states have call successors, (0), 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 09:17:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104296 states to 104296 states and 403020 transitions. [2021-06-05 09:17:59,485 INFO L78 Accepts]: Start accepts. Automaton has 104296 states and 403020 transitions. Word has length 54 [2021-06-05 09:17:59,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:59,485 INFO L482 AbstractCegarLoop]: Abstraction has 104296 states and 403020 transitions. [2021-06-05 09:17:59,485 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:17:59,485 INFO L276 IsEmpty]: Start isEmpty. Operand 104296 states and 403020 transitions. [2021-06-05 09:17:59,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:17:59,503 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:59,503 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:17:59,504 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-06-05 09:17:59,504 INFO L430 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:59,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:59,504 INFO L82 PathProgramCache]: Analyzing trace with hash 225773896, now seen corresponding path program 4 times [2021-06-05 09:17:59,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:59,504 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4775193] [2021-06-05 09:17:59,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:59,601 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:59,601 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4775193] [2021-06-05 09:17:59,601 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4775193] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:59,602 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:59,602 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:17:59,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875631808] [2021-06-05 09:17:59,602 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:17:59,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:59,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:17:59,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:17:59,602 INFO L87 Difference]: Start difference. First operand 104296 states and 403020 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:18:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:00,928 INFO L93 Difference]: Finished difference Result 104828 states and 405196 transitions. [2021-06-05 09:18:00,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:18:00,929 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:18:00,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:01,285 INFO L225 Difference]: With dead ends: 104828 [2021-06-05 09:18:01,285 INFO L226 Difference]: Without dead ends: 104826 [2021-06-05 09:18:01,285 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 70.6ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:02,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104826 states. [2021-06-05 09:18:04,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104826 to 104340. [2021-06-05 09:18:04,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104340 states, 104317 states have (on average 3.8651130688190802) internal successors, (403197), 104339 states have internal predecessors, (403197), 0 states have call successors, (0), 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 09:18:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104340 states to 104340 states and 403197 transitions. [2021-06-05 09:18:05,465 INFO L78 Accepts]: Start accepts. Automaton has 104340 states and 403197 transitions. Word has length 54 [2021-06-05 09:18:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:05,466 INFO L482 AbstractCegarLoop]: Abstraction has 104340 states and 403197 transitions. [2021-06-05 09:18:05,466 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:18:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 104340 states and 403197 transitions. [2021-06-05 09:18:05,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:18:05,524 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:05,524 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:18:05,524 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-06-05 09:18:05,524 INFO L430 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:05,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:05,525 INFO L82 PathProgramCache]: Analyzing trace with hash 165754534, now seen corresponding path program 6 times [2021-06-05 09:18:05,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:05,525 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305575376] [2021-06-05 09:18:05,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:18:05,671 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:05,671 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305575376] [2021-06-05 09:18:05,671 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305575376] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:05,671 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:18:05,671 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:18:05,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528765629] [2021-06-05 09:18:05,671 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:18:05,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:05,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:18:05,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:18:05,672 INFO L87 Difference]: Start difference. First operand 104340 states and 403197 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:18:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:06,500 INFO L93 Difference]: Finished difference Result 104521 states and 403922 transitions. [2021-06-05 09:18:06,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:18:06,501 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:18:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:06,828 INFO L225 Difference]: With dead ends: 104521 [2021-06-05 09:18:06,828 INFO L226 Difference]: Without dead ends: 104518 [2021-06-05 09:18:06,829 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 112.8ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104518 states. [2021-06-05 09:18:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104518 to 104342. [2021-06-05 09:18:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104342 states, 104319 states have (on average 3.865173170755088) internal successors, (403211), 104341 states have internal predecessors, (403211), 0 states have call successors, (0), 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 09:18:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104342 states to 104342 states and 403211 transitions. [2021-06-05 09:18:11,058 INFO L78 Accepts]: Start accepts. Automaton has 104342 states and 403211 transitions. Word has length 54 [2021-06-05 09:18:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:11,058 INFO L482 AbstractCegarLoop]: Abstraction has 104342 states and 403211 transitions. [2021-06-05 09:18:11,058 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:18:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 104342 states and 403211 transitions. [2021-06-05 09:18:11,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:18:11,075 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:11,076 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:18:11,076 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-06-05 09:18:11,076 INFO L430 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:11,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:11,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1316005604, now seen corresponding path program 7 times [2021-06-05 09:18:11,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:11,076 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989587975] [2021-06-05 09:18:11,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:18:11,180 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:11,180 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989587975] [2021-06-05 09:18:11,180 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989587975] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:11,180 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:18:11,180 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:18:11,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185315255] [2021-06-05 09:18:11,180 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:18:11,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:11,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:18:11,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:18:11,182 INFO L87 Difference]: Start difference. First operand 104342 states and 403211 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:18:12,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:12,523 INFO L93 Difference]: Finished difference Result 104621 states and 404326 transitions. [2021-06-05 09:18:12,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:18:12,524 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:18:12,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:12,902 INFO L225 Difference]: With dead ends: 104621 [2021-06-05 09:18:12,903 INFO L226 Difference]: Without dead ends: 104615 [2021-06-05 09:18:12,903 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 84.2ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:14,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104615 states. [2021-06-05 09:18:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104615 to 104258. [2021-06-05 09:18:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104258 states, 104235 states have (on average 3.8651316736221037) internal successors, (402882), 104257 states have internal predecessors, (402882), 0 states have call successors, (0), 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 09:18:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104258 states to 104258 states and 402882 transitions. [2021-06-05 09:18:16,419 INFO L78 Accepts]: Start accepts. Automaton has 104258 states and 402882 transitions. Word has length 54 [2021-06-05 09:18:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:16,419 INFO L482 AbstractCegarLoop]: Abstraction has 104258 states and 402882 transitions. [2021-06-05 09:18:16,419 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:18:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 104258 states and 402882 transitions. [2021-06-05 09:18:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:18:16,438 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:16,438 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:18:16,438 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-06-05 09:18:16,438 INFO L430 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:16,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:16,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1161836588, now seen corresponding path program 5 times [2021-06-05 09:18:16,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:16,438 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062467347] [2021-06-05 09:18:16,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:18:16,525 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:16,525 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062467347] [2021-06-05 09:18:16,525 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062467347] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:16,525 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:18:16,525 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:18:16,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507438826] [2021-06-05 09:18:16,525 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:18:16,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:16,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:18:16,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:18:16,526 INFO L87 Difference]: Start difference. First operand 104258 states and 402882 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:18:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:18,029 INFO L93 Difference]: Finished difference Result 104773 states and 404979 transitions. [2021-06-05 09:18:18,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:18:18,029 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:18:18,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:18,342 INFO L225 Difference]: With dead ends: 104773 [2021-06-05 09:18:18,342 INFO L226 Difference]: Without dead ends: 104771 [2021-06-05 09:18:18,342 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 72.4ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:19,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104771 states. [2021-06-05 09:18:21,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104771 to 104258. [2021-06-05 09:18:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104258 states, 104235 states have (on average 3.8651220799155754) internal successors, (402881), 104257 states have internal predecessors, (402881), 0 states have call successors, (0), 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 09:18:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104258 states to 104258 states and 402881 transitions. [2021-06-05 09:18:22,569 INFO L78 Accepts]: Start accepts. Automaton has 104258 states and 402881 transitions. Word has length 54 [2021-06-05 09:18:22,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:22,570 INFO L482 AbstractCegarLoop]: Abstraction has 104258 states and 402881 transitions. [2021-06-05 09:18:22,570 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:18:22,570 INFO L276 IsEmpty]: Start isEmpty. Operand 104258 states and 402881 transitions. [2021-06-05 09:18:22,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:18:22,591 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:22,591 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:18:22,591 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-06-05 09:18:22,591 INFO L430 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:22,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:22,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1101817226, now seen corresponding path program 8 times [2021-06-05 09:18:22,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:22,591 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016734586] [2021-06-05 09:18:22,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:18:22,663 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:22,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016734586] [2021-06-05 09:18:22,664 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016734586] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:22,664 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:18:22,664 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:18:22,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144016955] [2021-06-05 09:18:22,664 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:18:22,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:22,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:18:22,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:18:22,664 INFO L87 Difference]: Start difference. First operand 104258 states and 402881 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:18:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:23,438 INFO L93 Difference]: Finished difference Result 103659 states and 400643 transitions. [2021-06-05 09:18:23,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:18:23,438 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:18:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:24,319 INFO L225 Difference]: With dead ends: 103659 [2021-06-05 09:18:24,319 INFO L226 Difference]: Without dead ends: 103656 [2021-06-05 09:18:24,319 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 62.6ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103656 states. [2021-06-05 09:18:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103656 to 103407. [2021-06-05 09:18:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103407 states, 103384 states have (on average 3.865598158322371) internal successors, (399641), 103406 states have internal predecessors, (399641), 0 states have call successors, (0), 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 09:18:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103407 states to 103407 states and 399641 transitions. [2021-06-05 09:18:27,694 INFO L78 Accepts]: Start accepts. Automaton has 103407 states and 399641 transitions. Word has length 54 [2021-06-05 09:18:27,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:27,694 INFO L482 AbstractCegarLoop]: Abstraction has 103407 states and 399641 transitions. [2021-06-05 09:18:27,694 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:18:27,694 INFO L276 IsEmpty]: Start isEmpty. Operand 103407 states and 399641 transitions. [2021-06-05 09:18:27,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 09:18:27,711 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:27,712 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:18:27,712 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-06-05 09:18:27,712 INFO L430 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:27,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:27,712 INFO L82 PathProgramCache]: Analyzing trace with hash -862155162, now seen corresponding path program 6 times [2021-06-05 09:18:27,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:27,712 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798784813] [2021-06-05 09:18:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:27,807 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:18:27,807 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:27,807 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798784813] [2021-06-05 09:18:27,807 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798784813] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:27,807 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:18:27,808 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:18:27,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779950954] [2021-06-05 09:18:27,808 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:18:27,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:27,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:18:27,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:18:27,808 INFO L87 Difference]: Start difference. First operand 103407 states and 399641 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:18:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:29,132 INFO L93 Difference]: Finished difference Result 103902 states and 401758 transitions. [2021-06-05 09:18:29,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:18:29,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 54 [2021-06-05 09:18:29,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:29,468 INFO L225 Difference]: With dead ends: 103902 [2021-06-05 09:18:29,468 INFO L226 Difference]: Without dead ends: 103876 [2021-06-05 09:18:29,469 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 76.3ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103876 states. [2021-06-05 09:18:33,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103876 to 103034. [2021-06-05 09:18:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103034 states, 103011 states have (on average 3.866674432827562) internal successors, (398310), 103033 states have internal predecessors, (398310), 0 states have call successors, (0), 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 09:18:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103034 states to 103034 states and 398310 transitions. [2021-06-05 09:18:33,954 INFO L78 Accepts]: Start accepts. Automaton has 103034 states and 398310 transitions. Word has length 54 [2021-06-05 09:18:33,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:33,954 INFO L482 AbstractCegarLoop]: Abstraction has 103034 states and 398310 transitions. [2021-06-05 09:18:33,954 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 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 09:18:33,954 INFO L276 IsEmpty]: Start isEmpty. Operand 103034 states and 398310 transitions. [2021-06-05 09:18:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:18:33,976 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:33,976 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:18:33,977 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-06-05 09:18:33,977 INFO L430 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:33,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:33,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2068970973, now seen corresponding path program 1 times [2021-06-05 09:18:33,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:33,978 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132680173] [2021-06-05 09:18:33,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:34,091 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:18:34,091 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:34,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132680173] [2021-06-05 09:18:34,091 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132680173] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:18:34,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070506735] [2021-06-05 09:18:34,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 09:18:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:34,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 09:18:34,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:18:34,275 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 09:18:34,276 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:18:34,283 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:18:34,283 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:18:34,284 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-06-05 09:18:34,325 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 11 treesize of output 7 [2021-06-05 09:18:34,326 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:18:34,334 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:18:34,335 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 09:18:34,336 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2021-06-05 09:18:34,377 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:18:34,378 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 09:18:34,379 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:18:34,386 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:18:34,387 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:18:34,387 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2021-06-05 09:18:34,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-06-05 09:18:34,418 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:18:34,440 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:18:34,441 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 09:18:34,441 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2021-06-05 09:18:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:18:34,479 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070506735] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:18:34,479 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:18:34,479 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2021-06-05 09:18:34,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443387211] [2021-06-05 09:18:34,480 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 09:18:34,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:34,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 09:18:34,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:18:34,480 INFO L87 Difference]: Start difference. First operand 103034 states and 398310 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 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 09:18:36,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:36,259 INFO L93 Difference]: Finished difference Result 104581 states and 404783 transitions. [2021-06-05 09:18:36,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:18:36,260 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 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 55 [2021-06-05 09:18:36,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:36,586 INFO L225 Difference]: With dead ends: 104581 [2021-06-05 09:18:36,586 INFO L226 Difference]: Without dead ends: 104581 [2021-06-05 09:18:36,586 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 169.9ms TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:18:38,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104581 states. [2021-06-05 09:18:39,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104581 to 103644. [2021-06-05 09:18:39,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103644 states, 103621 states have (on average 3.868636666312813) internal successors, (400872), 103643 states have internal predecessors, (400872), 0 states have call successors, (0), 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 09:18:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103644 states to 103644 states and 400872 transitions. [2021-06-05 09:18:40,768 INFO L78 Accepts]: Start accepts. Automaton has 103644 states and 400872 transitions. Word has length 55 [2021-06-05 09:18:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:40,768 INFO L482 AbstractCegarLoop]: Abstraction has 103644 states and 400872 transitions. [2021-06-05 09:18:40,768 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 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 09:18:40,768 INFO L276 IsEmpty]: Start isEmpty. Operand 103644 states and 400872 transitions. [2021-06-05 09:18:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:18:40,794 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:40,794 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:18:40,995 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2021-06-05 09:18:40,995 INFO L430 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:40,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:40,995 INFO L82 PathProgramCache]: Analyzing trace with hash -476692219, now seen corresponding path program 2 times [2021-06-05 09:18:40,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:40,995 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930302822] [2021-06-05 09:18:40,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:18:41,046 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:41,046 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930302822] [2021-06-05 09:18:41,046 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930302822] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:18:41,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407422171] [2021-06-05 09:18:41,047 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 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 09:18:41,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:18:41,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:18:41,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 09:18:41,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:18:41,197 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 16 treesize of output 12 [2021-06-05 09:18:41,198 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:18:41,206 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:18:41,209 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:18:41,209 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:87 [2021-06-05 09:18:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-06-05 09:18:41,244 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407422171] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:41,244 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:18:41,245 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2021-06-05 09:18:41,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902984815] [2021-06-05 09:18:41,245 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 09:18:41,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:41,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 09:18:41,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:41,245 INFO L87 Difference]: Start difference. First operand 103644 states and 400872 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:18:41,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:41,853 INFO L93 Difference]: Finished difference Result 107012 states and 415003 transitions. [2021-06-05 09:18:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 09:18:41,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 55 [2021-06-05 09:18:41,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:42,780 INFO L225 Difference]: With dead ends: 107012 [2021-06-05 09:18:42,781 INFO L226 Difference]: Without dead ends: 106970 [2021-06-05 09:18:42,781 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 90.6ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:18:44,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106970 states. [2021-06-05 09:18:45,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106970 to 106369. [2021-06-05 09:18:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106369 states, 106346 states have (on average 3.8771745058582363) internal successors, (412322), 106368 states have internal predecessors, (412322), 0 states have call successors, (0), 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 09:18:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106369 states to 106369 states and 412322 transitions. [2021-06-05 09:18:46,203 INFO L78 Accepts]: Start accepts. Automaton has 106369 states and 412322 transitions. Word has length 55 [2021-06-05 09:18:46,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:46,203 INFO L482 AbstractCegarLoop]: Abstraction has 106369 states and 412322 transitions. [2021-06-05 09:18:46,203 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:18:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 106369 states and 412322 transitions. [2021-06-05 09:18:46,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:18:46,227 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:46,228 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:18:46,428 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:18:46,428 INFO L430 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:46,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:46,429 INFO L82 PathProgramCache]: Analyzing trace with hash 386344833, now seen corresponding path program 3 times [2021-06-05 09:18:46,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:46,429 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189730664] [2021-06-05 09:18:46,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:46,524 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:18:46,524 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:46,524 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189730664] [2021-06-05 09:18:46,524 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189730664] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:18:46,524 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586813468] [2021-06-05 09:18:46,525 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 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 09:18:46,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 09:18:46,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:18:46,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 09:18:46,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:18:46,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 09:18:46,672 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:18:46,678 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:18:46,678 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:18:46,678 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-06-05 09:18:46,700 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:18:46,700 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 09:18:46,702 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:18:46,707 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:18:46,708 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:18:46,708 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2021-06-05 09:18:46,729 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 11 treesize of output 7 [2021-06-05 09:18:46,730 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:18:46,737 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:18:46,737 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 09:18:46,738 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2021-06-05 09:18:46,761 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 26 treesize of output 21 [2021-06-05 09:18:46,762 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:18:46,769 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:18:46,770 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 09:18:46,770 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2021-06-05 09:18:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:18:46,789 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586813468] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:18:46,789 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:18:46,789 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2021-06-05 09:18:46,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914219357] [2021-06-05 09:18:46,789 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 09:18:46,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:46,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 09:18:46,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:18:46,790 INFO L87 Difference]: Start difference. First operand 106369 states and 412322 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 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 09:18:48,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:48,332 INFO L93 Difference]: Finished difference Result 107555 states and 417251 transitions. [2021-06-05 09:18:48,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:18:48,333 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 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 55 [2021-06-05 09:18:48,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:48,658 INFO L225 Difference]: With dead ends: 107555 [2021-06-05 09:18:48,658 INFO L226 Difference]: Without dead ends: 107555 [2021-06-05 09:18:48,658 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 157.8ms TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:18:50,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107555 states. [2021-06-05 09:18:52,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107555 to 106384. [2021-06-05 09:18:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106384 states, 106361 states have (on average 3.8773610627955737) internal successors, (412400), 106383 states have internal predecessors, (412400), 0 states have call successors, (0), 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 09:18:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106384 states to 106384 states and 412400 transitions. [2021-06-05 09:18:52,811 INFO L78 Accepts]: Start accepts. Automaton has 106384 states and 412400 transitions. Word has length 55 [2021-06-05 09:18:52,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:52,811 INFO L482 AbstractCegarLoop]: Abstraction has 106384 states and 412400 transitions. [2021-06-05 09:18:52,811 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 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 09:18:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 106384 states and 412400 transitions. [2021-06-05 09:18:52,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:18:52,834 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:52,834 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:18:53,035 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,47 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:18:53,035 INFO L430 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:53,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:53,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1055649245, now seen corresponding path program 4 times [2021-06-05 09:18:53,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:53,035 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168125906] [2021-06-05 09:18:53,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:53,089 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:18:53,089 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:53,089 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168125906] [2021-06-05 09:18:53,089 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168125906] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:18:53,089 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274219260] [2021-06-05 09:18:53,090 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 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 09:18:53,159 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:18:53,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:18:53,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 24 conjunts are in the unsatisfiable core [2021-06-05 09:18:53,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:18:53,248 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 11 treesize of output 7 [2021-06-05 09:18:53,249 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:18:53,256 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:18:53,257 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 09:18:53,257 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:18:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:18:53,276 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274219260] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:18:53,277 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:18:53,277 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2021-06-05 09:18:53,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588882643] [2021-06-05 09:18:53,277 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:18:53,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:53,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:18:53,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:18:53,277 INFO L87 Difference]: Start difference. First operand 106384 states and 412400 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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 09:18:54,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:54,485 INFO L93 Difference]: Finished difference Result 100061 states and 385756 transitions. [2021-06-05 09:18:54,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:18:54,485 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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 55 [2021-06-05 09:18:54,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:54,864 INFO L225 Difference]: With dead ends: 100061 [2021-06-05 09:18:54,864 INFO L226 Difference]: Without dead ends: 100053 [2021-06-05 09:18:54,864 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 62.3ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:18:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100053 states. [2021-06-05 09:18:57,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100053 to 98366. [2021-06-05 09:18:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98366 states, 98343 states have (on average 3.8502181141514904) internal successors, (378642), 98365 states have internal predecessors, (378642), 0 states have call successors, (0), 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 09:18:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98366 states to 98366 states and 378642 transitions. [2021-06-05 09:18:58,217 INFO L78 Accepts]: Start accepts. Automaton has 98366 states and 378642 transitions. Word has length 55 [2021-06-05 09:18:58,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:58,217 INFO L482 AbstractCegarLoop]: Abstraction has 98366 states and 378642 transitions. [2021-06-05 09:18:58,217 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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 09:18:58,217 INFO L276 IsEmpty]: Start isEmpty. Operand 98366 states and 378642 transitions. [2021-06-05 09:18:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:18:58,240 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:58,240 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:18:58,441 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:18:58,441 INFO L430 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:58,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:58,441 INFO L82 PathProgramCache]: Analyzing trace with hash -63574011, now seen corresponding path program 5 times [2021-06-05 09:18:58,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:58,442 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30493699] [2021-06-05 09:18:58,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:58,518 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:18:58,518 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:58,519 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30493699] [2021-06-05 09:18:58,519 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30493699] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:18:58,519 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949703223] [2021-06-05 09:18:58,519 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 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 09:18:58,586 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 09:18:58,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:18:58,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 36 conjunts are in the unsatisfiable core [2021-06-05 09:18:58,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:18:58,637 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 11 treesize of output 7 [2021-06-05 09:18:58,639 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:18:58,643 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:18:58,644 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:18:58,644 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:10 [2021-06-05 09:18:58,689 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 09:18:58,689 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:18:58,694 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:18:58,695 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:18:58,695 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2021-06-05 09:18:58,704 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:18:58,705 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 09:18:58,706 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:18:58,712 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:18:58,712 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:18:58,712 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2021-06-05 09:18:58,734 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 11 treesize of output 7 [2021-06-05 09:18:58,735 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:18:58,742 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:18:58,743 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 09:18:58,743 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2021-06-05 09:18:58,768 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 26 treesize of output 21 [2021-06-05 09:18:58,769 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:18:58,776 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:18:58,777 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 09:18:58,777 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2021-06-05 09:18:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:18:58,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949703223] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:18:58,796 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:18:58,796 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2021-06-05 09:18:58,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704846236] [2021-06-05 09:18:58,796 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 09:18:58,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:58,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 09:18:58,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:18:58,796 INFO L87 Difference]: Start difference. First operand 98366 states and 378642 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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 09:19:00,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:19:00,207 INFO L93 Difference]: Finished difference Result 99542 states and 383431 transitions. [2021-06-05 09:19:00,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:19:00,208 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-06-05 09:19:00,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:19:00,495 INFO L225 Difference]: With dead ends: 99542 [2021-06-05 09:19:00,495 INFO L226 Difference]: Without dead ends: 99542 [2021-06-05 09:19:00,495 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 139.8ms TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:19:01,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99542 states. [2021-06-05 09:19:03,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99542 to 98621. [2021-06-05 09:19:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98621 states, 98598 states have (on average 3.850717053084241) internal successors, (379673), 98620 states have internal predecessors, (379673), 0 states have call successors, (0), 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 09:19:04,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98621 states to 98621 states and 379673 transitions. [2021-06-05 09:19:04,542 INFO L78 Accepts]: Start accepts. Automaton has 98621 states and 379673 transitions. Word has length 55 [2021-06-05 09:19:04,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:19:04,542 INFO L482 AbstractCegarLoop]: Abstraction has 98621 states and 379673 transitions. [2021-06-05 09:19:04,542 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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 09:19:04,542 INFO L276 IsEmpty]: Start isEmpty. Operand 98621 states and 379673 transitions. [2021-06-05 09:19:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:19:04,573 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:19:04,573 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:19:04,796 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:19:04,797 INFO L430 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:19:04,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:19:04,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1563509627, now seen corresponding path program 1 times [2021-06-05 09:19:04,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:19:04,797 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167473862] [2021-06-05 09:19:04,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:19:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:19:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:19:04,931 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:19:04,931 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167473862] [2021-06-05 09:19:04,931 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167473862] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:19:04,931 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546532468] [2021-06-05 09:19:04,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:19:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:19:04,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 09:19:04,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:19:05,018 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 09:19:05,018 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:05,022 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:05,023 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:19:05,023 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:19:05,053 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:19:05,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2021-06-05 09:19:05,054 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:05,060 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:05,062 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:19:05,062 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2021-06-05 09:19:05,212 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 09:19:05,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 33 [2021-06-05 09:19:05,214 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:05,224 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:05,226 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:19:05,226 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:37 [2021-06-05 09:19:05,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:19:05,259 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:05,269 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:05,271 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 09:19:05,271 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:41 [2021-06-05 09:19:05,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 09:19:05,311 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:05,323 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:05,327 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:19:05,328 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:41 [2021-06-05 09:19:05,408 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 09:19:05,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 25 [2021-06-05 09:19:05,411 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:05,423 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:05,425 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:19:05,425 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:18 [2021-06-05 09:19:05,460 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 09:19:05,462 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:05,475 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:05,482 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 09:19:05,482 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:50 [2021-06-05 09:19:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:19:05,539 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546532468] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:19:05,540 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:19:05,540 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2021-06-05 09:19:05,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395605651] [2021-06-05 09:19:05,540 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 09:19:05,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:19:05,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 09:19:05,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-06-05 09:19:05,541 INFO L87 Difference]: Start difference. First operand 98621 states and 379673 transitions. Second operand has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 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 09:19:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:19:27,954 INFO L93 Difference]: Finished difference Result 100818 states and 388611 transitions. [2021-06-05 09:19:27,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 09:19:27,954 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 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 55 [2021-06-05 09:19:27,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:19:28,277 INFO L225 Difference]: With dead ends: 100818 [2021-06-05 09:19:28,277 INFO L226 Difference]: Without dead ends: 100818 [2021-06-05 09:19:28,277 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 518.7ms TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2021-06-05 09:19:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100818 states. [2021-06-05 09:19:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100818 to 99126. [2021-06-05 09:19:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99126 states, 99103 states have (on average 3.8525473497270517) internal successors, (381799), 99125 states have internal predecessors, (381799), 0 states have call successors, (0), 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 09:19:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99126 states to 99126 states and 381799 transitions. [2021-06-05 09:19:31,581 INFO L78 Accepts]: Start accepts. Automaton has 99126 states and 381799 transitions. Word has length 55 [2021-06-05 09:19:31,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:19:31,582 INFO L482 AbstractCegarLoop]: Abstraction has 99126 states and 381799 transitions. [2021-06-05 09:19:31,582 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 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 09:19:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 99126 states and 381799 transitions. [2021-06-05 09:19:31,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:19:31,609 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:19:31,609 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:19:31,811 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:19:31,811 INFO L430 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:19:31,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:19:31,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1411382863, now seen corresponding path program 1 times [2021-06-05 09:19:31,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:19:31,812 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825983806] [2021-06-05 09:19:31,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:19:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:19:31,914 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:19:31,914 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:19:31,914 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825983806] [2021-06-05 09:19:31,914 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825983806] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:19:31,914 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:19:31,914 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:19:31,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106011416] [2021-06-05 09:19:31,914 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:19:31,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:19:31,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:19:31,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:19:31,915 INFO L87 Difference]: Start difference. First operand 99126 states and 381799 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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 09:19:33,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:19:33,353 INFO L93 Difference]: Finished difference Result 100435 states and 387175 transitions. [2021-06-05 09:19:33,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:19:33,353 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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 55 [2021-06-05 09:19:33,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:19:33,658 INFO L225 Difference]: With dead ends: 100435 [2021-06-05 09:19:33,658 INFO L226 Difference]: Without dead ends: 100425 [2021-06-05 09:19:33,658 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 84.1ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:19:35,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100425 states. [2021-06-05 09:19:36,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100425 to 99172. [2021-06-05 09:19:37,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99172 states, 99149 states have (on average 3.8528679058790307) internal successors, (382008), 99171 states have internal predecessors, (382008), 0 states have call successors, (0), 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 09:19:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99172 states to 99172 states and 382008 transitions. [2021-06-05 09:19:37,884 INFO L78 Accepts]: Start accepts. Automaton has 99172 states and 382008 transitions. Word has length 55 [2021-06-05 09:19:37,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:19:37,884 INFO L482 AbstractCegarLoop]: Abstraction has 99172 states and 382008 transitions. [2021-06-05 09:19:37,884 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 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 09:19:37,884 INFO L276 IsEmpty]: Start isEmpty. Operand 99172 states and 382008 transitions. [2021-06-05 09:19:37,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:19:37,955 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:19:37,955 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:19:37,955 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-06-05 09:19:37,955 INFO L430 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:19:37,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:19:37,955 INFO L82 PathProgramCache]: Analyzing trace with hash -105225011, now seen corresponding path program 6 times [2021-06-05 09:19:37,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:19:37,956 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030938760] [2021-06-05 09:19:37,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:19:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:19:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-06-05 09:19:38,098 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:19:38,098 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030938760] [2021-06-05 09:19:38,098 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030938760] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:19:38,098 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:19:38,098 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:19:38,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607533026] [2021-06-05 09:19:38,099 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:19:38,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:19:38,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:19:38,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:19:38,099 INFO L87 Difference]: Start difference. First operand 99172 states and 382008 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:19:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:19:38,942 INFO L93 Difference]: Finished difference Result 98331 states and 378631 transitions. [2021-06-05 09:19:38,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:19:38,943 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 55 [2021-06-05 09:19:38,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:19:39,228 INFO L225 Difference]: With dead ends: 98331 [2021-06-05 09:19:39,228 INFO L226 Difference]: Without dead ends: 98331 [2021-06-05 09:19:39,228 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 93.7ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:19:40,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98331 states. [2021-06-05 09:19:42,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98331 to 96871. [2021-06-05 09:19:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96871 states, 96848 states have (on average 3.8475136296051544) internal successors, (372624), 96870 states have internal predecessors, (372624), 0 states have call successors, (0), 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 09:19:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96871 states to 96871 states and 372624 transitions. [2021-06-05 09:19:43,286 INFO L78 Accepts]: Start accepts. Automaton has 96871 states and 372624 transitions. Word has length 55 [2021-06-05 09:19:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:19:43,286 INFO L482 AbstractCegarLoop]: Abstraction has 96871 states and 372624 transitions. [2021-06-05 09:19:43,286 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:19:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 96871 states and 372624 transitions. [2021-06-05 09:19:43,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:19:43,323 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:19:43,323 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:19:43,323 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-06-05 09:19:43,323 INFO L430 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:19:43,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:19:43,324 INFO L82 PathProgramCache]: Analyzing trace with hash -140222267, now seen corresponding path program 1 times [2021-06-05 09:19:43,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:19:43,324 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806621462] [2021-06-05 09:19:43,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:19:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:19:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:19:43,525 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:19:43,525 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806621462] [2021-06-05 09:19:43,525 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806621462] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:19:43,525 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379746010] [2021-06-05 09:19:43,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 09:19:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:19:43,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 09:19:43,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:19:43,678 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 09:19:43,679 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:43,684 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:43,685 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:19:43,685 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:19:43,724 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:19:43,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2021-06-05 09:19:43,726 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:43,735 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:43,735 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:19:43,736 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2021-06-05 09:19:43,843 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-06-05 09:19:43,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 22 [2021-06-05 09:19:43,845 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:43,855 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:43,857 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:19:43,857 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:29 [2021-06-05 09:19:43,954 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 11 treesize of output 7 [2021-06-05 09:19:43,955 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:43,964 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:43,965 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:19:43,966 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2021-06-05 09:19:44,010 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 19 treesize of output 18 [2021-06-05 09:19:44,011 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:44,022 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:44,030 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:19:44,030 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:28 [2021-06-05 09:19:44,102 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 09:19:44,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:19:44,104 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:44,129 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:44,130 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:19:44,130 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:18 [2021-06-05 09:19:44,188 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 19 treesize of output 18 [2021-06-05 09:19:44,189 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:44,198 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:44,209 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 09:19:44,210 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:19:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:19:44,237 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379746010] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:19:44,237 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:19:44,237 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2021-06-05 09:19:44,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605289064] [2021-06-05 09:19:44,237 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 09:19:44,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:19:44,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 09:19:44,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:19:44,238 INFO L87 Difference]: Start difference. First operand 96871 states and 372624 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 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 09:19:46,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:19:46,411 INFO L93 Difference]: Finished difference Result 98447 states and 378980 transitions. [2021-06-05 09:19:46,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:19:46,417 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 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 55 [2021-06-05 09:19:46,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:19:47,011 INFO L225 Difference]: With dead ends: 98447 [2021-06-05 09:19:47,011 INFO L226 Difference]: Without dead ends: 98439 [2021-06-05 09:19:47,012 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 321.7ms TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:19:48,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98439 states. [2021-06-05 09:19:50,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98439 to 97219. [2021-06-05 09:19:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97219 states, 97196 states have (on average 3.8484608420099593) internal successors, (374055), 97218 states have internal predecessors, (374055), 0 states have call successors, (0), 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 09:19:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97219 states to 97219 states and 374055 transitions. [2021-06-05 09:19:50,608 INFO L78 Accepts]: Start accepts. Automaton has 97219 states and 374055 transitions. Word has length 55 [2021-06-05 09:19:50,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:19:50,608 INFO L482 AbstractCegarLoop]: Abstraction has 97219 states and 374055 transitions. [2021-06-05 09:19:50,608 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 18 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 09:19:50,608 INFO L276 IsEmpty]: Start isEmpty. Operand 97219 states and 374055 transitions. [2021-06-05 09:19:50,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:19:50,635 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:19:50,635 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:19:50,840 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:19:50,841 INFO L430 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:19:50,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:19:50,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1363033485, now seen corresponding path program 2 times [2021-06-05 09:19:50,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:19:50,842 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953995792] [2021-06-05 09:19:50,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:19:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:19:50,989 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-06-05 09:19:50,989 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:19:50,989 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953995792] [2021-06-05 09:19:50,989 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953995792] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:19:50,989 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921909349] [2021-06-05 09:19:50,989 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 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 09:19:51,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:19:51,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:19:51,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 48 conjunts are in the unsatisfiable core [2021-06-05 09:19:51,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:19:51,080 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 09:19:51,080 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:51,084 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:51,085 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:19:51,085 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:19:51,111 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-06-05 09:19:51,112 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 12 treesize of output 14 [2021-06-05 09:19:51,113 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:51,118 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:51,118 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:19:51,119 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2021-06-05 09:19:51,178 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:19:51,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:19:51,180 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:51,190 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:51,191 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:19:51,191 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:33 [2021-06-05 09:19:51,253 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 11 treesize of output 7 [2021-06-05 09:19:51,254 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:51,262 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:51,262 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:19:51,263 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2021-06-05 09:19:51,314 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 19 treesize of output 18 [2021-06-05 09:19:51,315 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:51,326 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:51,330 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:19:51,330 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:31 [2021-06-05 09:19:51,412 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 09:19:51,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:19:51,414 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:51,421 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:51,423 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:19:51,423 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:18 [2021-06-05 09:19:51,462 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 19 treesize of output 18 [2021-06-05 09:19:51,463 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:19:51,472 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:19:51,473 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 09:19:51,473 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:19:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:19:51,500 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921909349] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:19:51,500 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:19:51,500 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2021-06-05 09:19:51,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445435770] [2021-06-05 09:19:51,501 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 09:19:51,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:19:51,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 09:19:51,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:19:51,501 INFO L87 Difference]: Start difference. First operand 97219 states and 374055 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 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 09:19:52,227 WARN L205 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-06-05 09:19:53,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:19:53,586 INFO L93 Difference]: Finished difference Result 102657 states and 396164 transitions. [2021-06-05 09:19:53,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 09:19:53,587 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 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 55 [2021-06-05 09:19:53,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:19:53,885 INFO L225 Difference]: With dead ends: 102657 [2021-06-05 09:19:53,885 INFO L226 Difference]: Without dead ends: 102657 [2021-06-05 09:19:53,885 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 887.5ms TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2021-06-05 09:19:55,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102657 states. [2021-06-05 09:19:57,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102657 to 97335. [2021-06-05 09:19:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97335 states, 97312 states have (on average 3.8488778362380796) internal successors, (374542), 97334 states have internal predecessors, (374542), 0 states have call successors, (0), 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 09:19:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97335 states to 97335 states and 374542 transitions. [2021-06-05 09:19:57,939 INFO L78 Accepts]: Start accepts. Automaton has 97335 states and 374542 transitions. Word has length 55 [2021-06-05 09:19:57,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:19:57,939 INFO L482 AbstractCegarLoop]: Abstraction has 97335 states and 374542 transitions. [2021-06-05 09:19:57,939 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 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 09:19:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 97335 states and 374542 transitions. [2021-06-05 09:19:57,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:19:57,970 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:19:57,970 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:19:58,171 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2021-06-05 09:19:58,172 INFO L430 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:19:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:19:58,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1764467191, now seen corresponding path program 2 times [2021-06-05 09:19:58,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:19:58,172 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141253328] [2021-06-05 09:19:58,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:19:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:19:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-06-05 09:19:58,299 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:19:58,299 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141253328] [2021-06-05 09:19:58,300 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141253328] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:19:58,300 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:19:58,300 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:19:58,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351613431] [2021-06-05 09:19:58,300 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:19:58,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:19:58,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:19:58,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:19:58,301 INFO L87 Difference]: Start difference. First operand 97335 states and 374542 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:19:59,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:19:59,059 INFO L93 Difference]: Finished difference Result 98408 states and 378991 transitions. [2021-06-05 09:19:59,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:19:59,059 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 55 [2021-06-05 09:19:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:19:59,947 INFO L225 Difference]: With dead ends: 98408 [2021-06-05 09:19:59,947 INFO L226 Difference]: Without dead ends: 98398 [2021-06-05 09:19:59,947 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 108.4ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:20:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98398 states. [2021-06-05 09:20:02,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98398 to 97274. [2021-06-05 09:20:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97274 states, 97251 states have (on average 3.8487830459326897) internal successors, (374298), 97273 states have internal predecessors, (374298), 0 states have call successors, (0), 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 09:20:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97274 states to 97274 states and 374298 transitions. [2021-06-05 09:20:03,395 INFO L78 Accepts]: Start accepts. Automaton has 97274 states and 374298 transitions. Word has length 55 [2021-06-05 09:20:03,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:20:03,395 INFO L482 AbstractCegarLoop]: Abstraction has 97274 states and 374298 transitions. [2021-06-05 09:20:03,395 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:20:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 97274 states and 374298 transitions. [2021-06-05 09:20:03,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:20:03,424 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:20:03,424 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:20:03,424 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-06-05 09:20:03,424 INFO L430 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:20:03,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:20:03,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1376657001, now seen corresponding path program 2 times [2021-06-05 09:20:03,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:20:03,424 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918821237] [2021-06-05 09:20:03,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:20:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:20:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-06-05 09:20:03,519 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:20:03,519 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918821237] [2021-06-05 09:20:03,519 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918821237] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:20:03,519 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:20:03,519 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:20:03,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096097876] [2021-06-05 09:20:03,519 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:20:03,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:20:03,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:20:03,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:20:03,520 INFO L87 Difference]: Start difference. First operand 97274 states and 374298 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:20:04,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:20:04,229 INFO L93 Difference]: Finished difference Result 98066 states and 377539 transitions. [2021-06-05 09:20:04,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:20:04,231 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 55 [2021-06-05 09:20:04,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:20:05,296 INFO L225 Difference]: With dead ends: 98066 [2021-06-05 09:20:05,296 INFO L226 Difference]: Without dead ends: 98062 [2021-06-05 09:20:05,297 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 76.6ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:20:06,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98062 states. [2021-06-05 09:20:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98062 to 97397. [2021-06-05 09:20:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97397 states, 97374 states have (on average 3.8491691827387187) internal successors, (374809), 97396 states have internal predecessors, (374809), 0 states have call successors, (0), 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 09:20:08,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97397 states to 97397 states and 374809 transitions. [2021-06-05 09:20:08,933 INFO L78 Accepts]: Start accepts. Automaton has 97397 states and 374809 transitions. Word has length 55 [2021-06-05 09:20:08,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:20:08,933 INFO L482 AbstractCegarLoop]: Abstraction has 97397 states and 374809 transitions. [2021-06-05 09:20:08,933 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:20:08,933 INFO L276 IsEmpty]: Start isEmpty. Operand 97397 states and 374809 transitions. [2021-06-05 09:20:08,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:20:08,962 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:20:08,962 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:20:08,962 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-06-05 09:20:08,962 INFO L430 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:20:08,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:20:08,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1186138325, now seen corresponding path program 3 times [2021-06-05 09:20:08,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:20:08,963 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112968405] [2021-06-05 09:20:08,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:20:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:20:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-06-05 09:20:09,049 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:20:09,049 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112968405] [2021-06-05 09:20:09,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112968405] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:20:09,049 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:20:09,049 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:20:09,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422604596] [2021-06-05 09:20:09,049 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:20:09,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:20:09,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:20:09,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:20:09,050 INFO L87 Difference]: Start difference. First operand 97397 states and 374809 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:20:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:20:10,534 INFO L93 Difference]: Finished difference Result 97965 states and 377120 transitions. [2021-06-05 09:20:10,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:20:10,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 55 [2021-06-05 09:20:10,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:20:10,863 INFO L225 Difference]: With dead ends: 97965 [2021-06-05 09:20:10,864 INFO L226 Difference]: Without dead ends: 97959 [2021-06-05 09:20:10,864 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 73.1ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:20:12,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97959 states. [2021-06-05 09:20:13,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97959 to 97340. [2021-06-05 09:20:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97340 states, 97317 states have (on average 3.8490397361201025) internal successors, (374577), 97339 states have internal predecessors, (374577), 0 states have call successors, (0), 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 09:20:14,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97340 states to 97340 states and 374577 transitions. [2021-06-05 09:20:14,258 INFO L78 Accepts]: Start accepts. Automaton has 97340 states and 374577 transitions. Word has length 55 [2021-06-05 09:20:14,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:20:14,258 INFO L482 AbstractCegarLoop]: Abstraction has 97340 states and 374577 transitions. [2021-06-05 09:20:14,258 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:20:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 97340 states and 374577 transitions. [2021-06-05 09:20:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:20:14,292 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:20:14,292 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:20:14,292 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-06-05 09:20:14,292 INFO L430 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:20:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:20:14,293 INFO L82 PathProgramCache]: Analyzing trace with hash 576652425, now seen corresponding path program 3 times [2021-06-05 09:20:14,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:20:14,293 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605005174] [2021-06-05 09:20:14,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:20:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:20:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-06-05 09:20:14,400 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:20:14,400 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605005174] [2021-06-05 09:20:14,400 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605005174] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:20:14,401 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:20:14,401 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:20:14,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048748858] [2021-06-05 09:20:14,401 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:20:14,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:20:14,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:20:14,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:20:14,401 INFO L87 Difference]: Start difference. First operand 97340 states and 374577 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:20:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:20:15,772 INFO L93 Difference]: Finished difference Result 98609 states and 379813 transitions. [2021-06-05 09:20:15,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:20:15,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 55 [2021-06-05 09:20:15,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:20:16,126 INFO L225 Difference]: With dead ends: 98609 [2021-06-05 09:20:16,126 INFO L226 Difference]: Without dead ends: 98597 [2021-06-05 09:20:16,126 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 85.6ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:20:17,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98597 states. [2021-06-05 09:20:19,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98597 to 97196. [2021-06-05 09:20:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97196 states, 97173 states have (on average 3.8488366109927656) internal successors, (374003), 97195 states have internal predecessors, (374003), 0 states have call successors, (0), 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 09:20:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97196 states to 97196 states and 374003 transitions. [2021-06-05 09:20:19,684 INFO L78 Accepts]: Start accepts. Automaton has 97196 states and 374003 transitions. Word has length 55 [2021-06-05 09:20:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:20:19,684 INFO L482 AbstractCegarLoop]: Abstraction has 97196 states and 374003 transitions. [2021-06-05 09:20:19,684 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:20:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 97196 states and 374003 transitions. [2021-06-05 09:20:19,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:20:19,714 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:20:19,714 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:20:19,714 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-06-05 09:20:19,714 INFO L430 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:20:19,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:20:19,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1151697579, now seen corresponding path program 4 times [2021-06-05 09:20:19,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:20:19,715 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733374234] [2021-06-05 09:20:19,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:20:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:20:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-06-05 09:20:19,802 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:20:19,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733374234] [2021-06-05 09:20:19,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733374234] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:20:19,803 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:20:19,803 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:20:19,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516119524] [2021-06-05 09:20:19,803 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:20:19,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:20:19,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:20:19,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:20:19,803 INFO L87 Difference]: Start difference. First operand 97196 states and 374003 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:20:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:20:21,220 INFO L93 Difference]: Finished difference Result 95516 states and 367183 transitions. [2021-06-05 09:20:21,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:20:21,221 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 55 [2021-06-05 09:20:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:20:21,495 INFO L225 Difference]: With dead ends: 95516 [2021-06-05 09:20:21,495 INFO L226 Difference]: Without dead ends: 95512 [2021-06-05 09:20:21,495 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 74.8ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:20:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95512 states. [2021-06-05 09:20:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95512 to 94545. [2021-06-05 09:20:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94545 states, 94522 states have (on average 3.8429042974122427) internal successors, (363239), 94544 states have internal predecessors, (363239), 0 states have call successors, (0), 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 09:20:24,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94545 states to 94545 states and 363239 transitions. [2021-06-05 09:20:24,934 INFO L78 Accepts]: Start accepts. Automaton has 94545 states and 363239 transitions. Word has length 55 [2021-06-05 09:20:24,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:20:24,934 INFO L482 AbstractCegarLoop]: Abstraction has 94545 states and 363239 transitions. [2021-06-05 09:20:24,934 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:20:24,934 INFO L276 IsEmpty]: Start isEmpty. Operand 94545 states and 363239 transitions. [2021-06-05 09:20:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:20:24,961 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:20:24,961 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:20:24,961 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-06-05 09:20:24,961 INFO L430 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:20:24,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:20:24,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1411097747, now seen corresponding path program 4 times [2021-06-05 09:20:24,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:20:24,962 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400778552] [2021-06-05 09:20:24,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:20:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:20:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-06-05 09:20:25,053 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:20:25,053 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400778552] [2021-06-05 09:20:25,053 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400778552] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:20:25,053 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:20:25,053 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:20:25,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341410001] [2021-06-05 09:20:25,053 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:20:25,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:20:25,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:20:25,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:20:25,054 INFO L87 Difference]: Start difference. First operand 94545 states and 363239 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:20:26,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:20:26,494 INFO L93 Difference]: Finished difference Result 95334 states and 366420 transitions. [2021-06-05 09:20:26,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:20:26,495 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 55 [2021-06-05 09:20:26,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:20:26,757 INFO L225 Difference]: With dead ends: 95334 [2021-06-05 09:20:26,757 INFO L226 Difference]: Without dead ends: 95328 [2021-06-05 09:20:26,757 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 81.4ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:20:28,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95328 states. [2021-06-05 09:20:29,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95328 to 94341. [2021-06-05 09:20:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94341 states, 94318 states have (on average 3.8421298161538626) internal successors, (362382), 94340 states have internal predecessors, (362382), 0 states have call successors, (0), 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 09:20:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94341 states to 94341 states and 362382 transitions. [2021-06-05 09:20:30,239 INFO L78 Accepts]: Start accepts. Automaton has 94341 states and 362382 transitions. Word has length 55 [2021-06-05 09:20:30,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:20:30,239 INFO L482 AbstractCegarLoop]: Abstraction has 94341 states and 362382 transitions. [2021-06-05 09:20:30,239 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:20:30,239 INFO L276 IsEmpty]: Start isEmpty. Operand 94341 states and 362382 transitions. [2021-06-05 09:20:30,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:20:30,264 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:20:30,264 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:20:30,265 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-06-05 09:20:30,265 INFO L430 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:20:30,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:20:30,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1099520137, now seen corresponding path program 5 times [2021-06-05 09:20:30,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:20:30,265 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199356606] [2021-06-05 09:20:30,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:20:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:20:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-06-05 09:20:30,365 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:20:30,365 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199356606] [2021-06-05 09:20:30,365 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199356606] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:20:30,365 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:20:30,365 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 09:20:30,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498248778] [2021-06-05 09:20:30,365 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:20:30,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:20:30,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:20:30,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:20:30,366 INFO L87 Difference]: Start difference. First operand 94341 states and 362382 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:20:31,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:20:31,889 INFO L93 Difference]: Finished difference Result 94974 states and 364931 transitions. [2021-06-05 09:20:31,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:20:31,890 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 55 [2021-06-05 09:20:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:20:32,173 INFO L225 Difference]: With dead ends: 94974 [2021-06-05 09:20:32,173 INFO L226 Difference]: Without dead ends: 94954 [2021-06-05 09:20:32,173 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 83.7ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:20:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94954 states. [2021-06-05 09:20:35,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94954 to 93478. [2021-06-05 09:20:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93478 states, 93455 states have (on average 3.8399443582472848) internal successors, (358862), 93477 states have internal predecessors, (358862), 0 states have call successors, (0), 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 09:20:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93478 states to 93478 states and 358862 transitions. [2021-06-05 09:20:35,925 INFO L78 Accepts]: Start accepts. Automaton has 93478 states and 358862 transitions. Word has length 55 [2021-06-05 09:20:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:20:35,926 INFO L482 AbstractCegarLoop]: Abstraction has 93478 states and 358862 transitions. [2021-06-05 09:20:35,926 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 09:20:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 93478 states and 358862 transitions. [2021-06-05 09:20:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:20:35,960 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:20:35,960 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:20:35,960 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-06-05 09:20:35,961 INFO L430 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:20:35,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:20:35,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1058337065, now seen corresponding path program 6 times [2021-06-05 09:20:35,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:20:35,961 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360504796] [2021-06-05 09:20:35,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:20:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:20:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-06-05 09:20:36,169 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:20:36,169 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360504796] [2021-06-05 09:20:36,170 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360504796] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:20:36,170 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197486608] [2021-06-05 09:20:36,170 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 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 09:20:36,254 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 09:20:36,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:20:36,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 09:20:36,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:20:36,283 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 09:20:36,284 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:36,289 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:20:36,290 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:20:36,304 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:20:36,370 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:20:36,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2021-06-05 09:20:36,372 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:36,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:20:36,382 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:20:36,382 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2021-06-05 09:20:36,550 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 09:20:36,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 33 [2021-06-05 09:20:36,552 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:36,566 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:20:36,568 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:20:36,568 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:37 [2021-06-05 09:20:36,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:20:36,614 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:36,627 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:20:36,629 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 09:20:36,629 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:41 [2021-06-05 09:20:36,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 09:20:36,713 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:36,729 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:20:36,761 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:20:36,761 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:41 [2021-06-05 09:20:37,310 WARN L205 SmtUtils]: Spent 522.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-06-05 09:20:37,389 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 09:20:37,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 25 [2021-06-05 09:20:37,392 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:37,406 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:20:37,408 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:20:37,408 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:18 [2021-06-05 09:20:37,468 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 19 treesize of output 18 [2021-06-05 09:20:37,469 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:37,476 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:20:37,478 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 09:20:37,478 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:20:37,520 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-06-05 09:20:37,521 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197486608] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:20:37,521 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:20:37,521 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2021-06-05 09:20:37,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448802207] [2021-06-05 09:20:37,521 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 09:20:37,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:20:37,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 09:20:37,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2021-06-05 09:20:37,522 INFO L87 Difference]: Start difference. First operand 93478 states and 358862 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 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 09:20:39,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:20:39,534 INFO L93 Difference]: Finished difference Result 95252 states and 366036 transitions. [2021-06-05 09:20:39,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 09:20:39,535 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-06-05 09:20:39,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:20:40,335 INFO L225 Difference]: With dead ends: 95252 [2021-06-05 09:20:40,335 INFO L226 Difference]: Without dead ends: 95244 [2021-06-05 09:20:40,335 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1141.3ms TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2021-06-05 09:20:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95244 states. [2021-06-05 09:20:42,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95244 to 92956. [2021-06-05 09:20:42,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92956 states, 92933 states have (on average 3.8384427490772923) internal successors, (356718), 92955 states have internal predecessors, (356718), 0 states have call successors, (0), 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 09:20:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92956 states to 92956 states and 356718 transitions. [2021-06-05 09:20:43,622 INFO L78 Accepts]: Start accepts. Automaton has 92956 states and 356718 transitions. Word has length 55 [2021-06-05 09:20:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:20:43,622 INFO L482 AbstractCegarLoop]: Abstraction has 92956 states and 356718 transitions. [2021-06-05 09:20:43,622 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 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 09:20:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 92956 states and 356718 transitions. [2021-06-05 09:20:43,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 09:20:43,652 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:20:43,652 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:20:43,852 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106 [2021-06-05 09:20:43,853 INFO L430 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:20:43,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:20:43,853 INFO L82 PathProgramCache]: Analyzing trace with hash 39903929, now seen corresponding path program 3 times [2021-06-05 09:20:43,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:20:43,853 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254394705] [2021-06-05 09:20:43,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:20:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:20:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-06-05 09:20:44,057 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:20:44,057 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254394705] [2021-06-05 09:20:44,057 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254394705] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:20:44,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864518286] [2021-06-05 09:20:44,058 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 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 09:20:44,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:20:44,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:20:44,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 41 conjunts are in the unsatisfiable core [2021-06-05 09:20:44,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:20:44,164 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 09:20:44,165 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:44,170 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:20:44,171 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:20:44,171 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:20:44,225 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:20:44,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2021-06-05 09:20:44,227 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:44,235 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:20:44,236 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:20:44,236 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2021-06-05 09:20:44,291 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 09:20:44,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 33 [2021-06-05 09:20:44,293 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:44,307 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:20:44,309 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:20:44,309 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:37 [2021-06-05 09:20:44,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:20:44,388 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:44,405 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:20:44,406 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 09:20:44,407 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:41 [2021-06-05 09:20:44,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 09:20:44,512 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:44,526 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:20:44,530 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:20:44,530 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:55, output treesize:44 [2021-06-05 09:20:44,654 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 09:20:44,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 25 [2021-06-05 09:20:44,657 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:44,668 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:20:44,669 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:20:44,669 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:18 [2021-06-05 09:20:44,697 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 19 treesize of output 18 [2021-06-05 09:20:44,698 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:44,704 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:20:44,705 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 09:20:44,705 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:20:44,729 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-06-05 09:20:44,729 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864518286] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:20:44,729 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:20:44,729 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2021-06-05 09:20:44,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391187069] [2021-06-05 09:20:44,729 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 09:20:44,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:20:44,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 09:20:44,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2021-06-05 09:20:44,730 INFO L87 Difference]: Start difference. First operand 92956 states and 356718 transitions. Second operand has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 23 states have internal predecessors, (59), 0 states have call successors, (0), 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 09:20:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:20:46,945 INFO L93 Difference]: Finished difference Result 95712 states and 367782 transitions. [2021-06-05 09:20:46,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 09:20:46,946 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 23 states have internal predecessors, (59), 0 states have call successors, (0), 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 55 [2021-06-05 09:20:46,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:20:47,229 INFO L225 Difference]: With dead ends: 95712 [2021-06-05 09:20:47,229 INFO L226 Difference]: Without dead ends: 95704 [2021-06-05 09:20:47,229 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 665.7ms TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2021-06-05 09:20:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95704 states. [2021-06-05 09:20:49,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95704 to 90427. [2021-06-05 09:20:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90427 states, 90404 states have (on average 3.8313902039732755) internal successors, (346373), 90426 states have internal predecessors, (346373), 0 states have call successors, (0), 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 09:20:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90427 states to 90427 states and 346373 transitions. [2021-06-05 09:20:50,360 INFO L78 Accepts]: Start accepts. Automaton has 90427 states and 346373 transitions. Word has length 55 [2021-06-05 09:20:50,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:20:50,360 INFO L482 AbstractCegarLoop]: Abstraction has 90427 states and 346373 transitions. [2021-06-05 09:20:50,360 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 23 states have internal predecessors, (59), 0 states have call successors, (0), 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 09:20:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 90427 states and 346373 transitions. [2021-06-05 09:20:50,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:20:50,394 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:20:50,395 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:20:50,595 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2021-06-05 09:20:50,595 INFO L430 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:20:50,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:20:50,595 INFO L82 PathProgramCache]: Analyzing trace with hash 664965967, now seen corresponding path program 1 times [2021-06-05 09:20:50,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:20:50,596 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349951489] [2021-06-05 09:20:50,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:20:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:20:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:20:50,655 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:20:50,655 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349951489] [2021-06-05 09:20:50,655 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349951489] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:20:50,655 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133624963] [2021-06-05 09:20:50,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 09:20:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:20:50,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 09:20:50,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:20:50,853 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 11 treesize of output 7 [2021-06-05 09:20:50,853 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:50,861 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:20:50,862 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 09:20:50,862 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:20:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:20:50,881 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133624963] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:20:50,882 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:20:50,882 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2021-06-05 09:20:50,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488463134] [2021-06-05 09:20:50,882 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 09:20:50,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:20:50,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 09:20:50,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:20:50,882 INFO L87 Difference]: Start difference. First operand 90427 states and 346373 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 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 09:20:52,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:20:52,386 INFO L93 Difference]: Finished difference Result 115886 states and 441721 transitions. [2021-06-05 09:20:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 09:20:52,387 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 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 09:20:52,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:20:52,724 INFO L225 Difference]: With dead ends: 115886 [2021-06-05 09:20:52,724 INFO L226 Difference]: Without dead ends: 111886 [2021-06-05 09:20:52,724 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 117.8ms TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:20:54,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111886 states. [2021-06-05 09:20:55,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111886 to 98977. [2021-06-05 09:20:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98977 states, 98954 states have (on average 3.8228166622875275) internal successors, (378283), 98976 states have internal predecessors, (378283), 0 states have call successors, (0), 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 09:20:56,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98977 states to 98977 states and 378283 transitions. [2021-06-05 09:20:56,882 INFO L78 Accepts]: Start accepts. Automaton has 98977 states and 378283 transitions. Word has length 59 [2021-06-05 09:20:56,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:20:56,883 INFO L482 AbstractCegarLoop]: Abstraction has 98977 states and 378283 transitions. [2021-06-05 09:20:56,883 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 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 09:20:56,883 INFO L276 IsEmpty]: Start isEmpty. Operand 98977 states and 378283 transitions. [2021-06-05 09:20:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:20:56,985 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:20:56,985 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:20:57,216 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,55 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:20:57,217 INFO L430 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:20:57,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:20:57,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1269204103, now seen corresponding path program 2 times [2021-06-05 09:20:57,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:20:57,217 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708023368] [2021-06-05 09:20:57,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:20:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:20:57,299 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:20:57,299 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:20:57,299 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708023368] [2021-06-05 09:20:57,299 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708023368] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:20:57,299 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199503803] [2021-06-05 09:20:57,299 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 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 09:20:57,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:20:57,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:20:57,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:20:57,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:20:57,451 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 09:20:57,452 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:57,456 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:20:57,456 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:20:57,456 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 09:20:57,478 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:20:57,478 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 09:20:57,480 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:57,485 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:20:57,486 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:20:57,486 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 09:20:57,503 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 13 treesize of output 9 [2021-06-05 09:20:57,504 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:57,509 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:20:57,510 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:20:57,510 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-06-05 09:20:57,529 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 17 treesize of output 17 [2021-06-05 09:20:57,530 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:20:57,539 INFO L628 ElimStorePlain]: treesize reduction 4, result has 83.3 percent of original size [2021-06-05 09:20:57,540 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:20:57,540 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-06-05 09:20:57,607 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:20:57,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199503803] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:20:57,608 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:20:57,608 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-06-05 09:20:57,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28442174] [2021-06-05 09:20:57,608 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:20:57,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:20:57,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:20:57,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:20:57,609 INFO L87 Difference]: Start difference. First operand 98977 states and 378283 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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 09:20:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:20:59,512 INFO L93 Difference]: Finished difference Result 188049 states and 720970 transitions. [2021-06-05 09:20:59,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:20:59,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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 59 [2021-06-05 09:20:59,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:21:00,127 INFO L225 Difference]: With dead ends: 188049 [2021-06-05 09:21:00,128 INFO L226 Difference]: Without dead ends: 187887 [2021-06-05 09:21:00,128 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 184.2ms TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:21:01,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187887 states. [2021-06-05 09:21:03,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187887 to 100287. [2021-06-05 09:21:04,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100287 states, 100264 states have (on average 3.8271263863400624) internal successors, (383723), 100286 states have internal predecessors, (383723), 0 states have call successors, (0), 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 09:21:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100287 states to 100287 states and 383723 transitions. [2021-06-05 09:21:04,871 INFO L78 Accepts]: Start accepts. Automaton has 100287 states and 383723 transitions. Word has length 59 [2021-06-05 09:21:04,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:21:04,871 INFO L482 AbstractCegarLoop]: Abstraction has 100287 states and 383723 transitions. [2021-06-05 09:21:04,871 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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 09:21:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 100287 states and 383723 transitions. [2021-06-05 09:21:04,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:21:04,918 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:21:04,918 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:21:05,118 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:21:05,119 INFO L430 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:21:05,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:21:05,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1823777921, now seen corresponding path program 3 times [2021-06-05 09:21:05,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:21:05,119 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215148546] [2021-06-05 09:21:05,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:21:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:21:05,182 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:21:05,182 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:21:05,182 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215148546] [2021-06-05 09:21:05,182 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215148546] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:21:05,182 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089281798] [2021-06-05 09:21:05,182 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 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 09:21:05,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:21:05,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:21:05,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:21:05,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:21:05,299 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 09:21:05,300 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:21:05,303 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:21:05,303 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:21:05,303 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 09:21:05,321 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:21:05,321 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 09:21:05,323 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:21:05,327 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:21:05,327 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:21:05,327 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 09:21:05,342 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 13 treesize of output 9 [2021-06-05 09:21:05,343 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:21:05,349 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:21:05,349 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:21:05,350 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-06-05 09:21:05,369 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 17 treesize of output 17 [2021-06-05 09:21:05,370 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:21:05,379 INFO L628 ElimStorePlain]: treesize reduction 4, result has 83.3 percent of original size [2021-06-05 09:21:05,380 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:21:05,380 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-06-05 09:21:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:21:05,429 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089281798] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:21:05,429 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:21:05,429 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-06-05 09:21:05,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910673298] [2021-06-05 09:21:05,430 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:21:05,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:21:05,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:21:05,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:21:05,430 INFO L87 Difference]: Start difference. First operand 100287 states and 383723 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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 09:21:07,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:21:07,298 INFO L93 Difference]: Finished difference Result 188969 states and 724314 transitions. [2021-06-05 09:21:07,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:21:07,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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 59 [2021-06-05 09:21:07,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:21:07,969 INFO L225 Difference]: With dead ends: 188969 [2021-06-05 09:21:07,969 INFO L226 Difference]: Without dead ends: 188748 [2021-06-05 09:21:07,972 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 189.0ms TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:21:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188748 states. [2021-06-05 09:21:12,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188748 to 100692. [2021-06-05 09:21:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100692 states, 100669 states have (on average 3.826401374802571) internal successors, (385200), 100691 states have internal predecessors, (385200), 0 states have call successors, (0), 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 09:21:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100692 states to 100692 states and 385200 transitions. [2021-06-05 09:21:12,541 INFO L78 Accepts]: Start accepts. Automaton has 100692 states and 385200 transitions. Word has length 59 [2021-06-05 09:21:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:21:12,541 INFO L482 AbstractCegarLoop]: Abstraction has 100692 states and 385200 transitions. [2021-06-05 09:21:12,541 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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 09:21:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 100692 states and 385200 transitions. [2021-06-05 09:21:12,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:21:12,584 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:21:12,584 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:21:12,784 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,57 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:21:12,785 INFO L430 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:21:12,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:21:12,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1361878991, now seen corresponding path program 4 times [2021-06-05 09:21:12,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:21:12,785 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333780530] [2021-06-05 09:21:12,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:21:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:21:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:21:12,851 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:21:12,851 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333780530] [2021-06-05 09:21:12,851 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333780530] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:21:12,851 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308777555] [2021-06-05 09:21:12,851 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 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 09:21:12,921 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:21:12,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:21:12,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 09:21:12,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:21:13,035 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 11 treesize of output 7 [2021-06-05 09:21:13,036 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:21:13,042 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:21:13,043 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 09:21:13,043 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:21:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:21:13,063 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308777555] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:21:13,063 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:21:13,063 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2021-06-05 09:21:13,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189475323] [2021-06-05 09:21:13,063 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 09:21:13,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:21:13,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 09:21:13,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:21:13,064 INFO L87 Difference]: Start difference. First operand 100692 states and 385200 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 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 09:21:14,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:21:14,579 INFO L93 Difference]: Finished difference Result 121018 states and 462387 transitions. [2021-06-05 09:21:14,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 09:21:14,580 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 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 09:21:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:21:14,952 INFO L225 Difference]: With dead ends: 121018 [2021-06-05 09:21:14,952 INFO L226 Difference]: Without dead ends: 116911 [2021-06-05 09:21:14,952 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 115.4ms TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:21:16,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116911 states. [2021-06-05 09:21:18,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116911 to 103664. [2021-06-05 09:21:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103664 states, 103641 states have (on average 3.828484866027923) internal successors, (396788), 103663 states have internal predecessors, (396788), 0 states have call successors, (0), 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 09:21:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103664 states to 103664 states and 396788 transitions. [2021-06-05 09:21:19,130 INFO L78 Accepts]: Start accepts. Automaton has 103664 states and 396788 transitions. Word has length 59 [2021-06-05 09:21:19,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:21:19,131 INFO L482 AbstractCegarLoop]: Abstraction has 103664 states and 396788 transitions. [2021-06-05 09:21:19,131 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 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 09:21:19,131 INFO L276 IsEmpty]: Start isEmpty. Operand 103664 states and 396788 transitions. [2021-06-05 09:21:19,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:21:19,185 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:21:19,185 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:21:19,400 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111,58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:21:19,401 INFO L430 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:21:19,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:21:19,401 INFO L82 PathProgramCache]: Analyzing trace with hash 269938437, now seen corresponding path program 5 times [2021-06-05 09:21:19,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:21:19,401 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768575293] [2021-06-05 09:21:19,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:21:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:21:19,471 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:21:19,471 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:21:19,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768575293] [2021-06-05 09:21:19,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768575293] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:21:19,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278850994] [2021-06-05 09:21:19,472 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 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 09:21:19,542 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 09:21:19,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:21:19,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 09:21:19,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:21:19,682 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 11 treesize of output 7 [2021-06-05 09:21:19,682 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:21:19,689 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:21:19,705 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 09:21:19,705 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:21:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:21:19,724 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278850994] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:21:19,724 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:21:19,724 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2021-06-05 09:21:19,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118506999] [2021-06-05 09:21:19,724 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 09:21:19,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:21:19,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 09:21:19,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:21:19,725 INFO L87 Difference]: Start difference. First operand 103664 states and 396788 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 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 09:21:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:21:20,793 INFO L93 Difference]: Finished difference Result 107866 states and 412592 transitions. [2021-06-05 09:21:20,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 09:21:20,794 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 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 59 [2021-06-05 09:21:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:21:21,665 INFO L225 Difference]: With dead ends: 107866 [2021-06-05 09:21:21,666 INFO L226 Difference]: Without dead ends: 107466 [2021-06-05 09:21:21,666 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 190.4ms TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:21:22,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107466 states. [2021-06-05 09:21:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107466 to 101467. [2021-06-05 09:21:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101467 states, 101444 states have (on average 3.8257955127952368) internal successors, (388104), 101466 states have internal predecessors, (388104), 0 states have call successors, (0), 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 09:21:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101467 states to 101467 states and 388104 transitions. [2021-06-05 09:21:25,049 INFO L78 Accepts]: Start accepts. Automaton has 101467 states and 388104 transitions. Word has length 59 [2021-06-05 09:21:25,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:21:25,049 INFO L482 AbstractCegarLoop]: Abstraction has 101467 states and 388104 transitions. [2021-06-05 09:21:25,049 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 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 09:21:25,049 INFO L276 IsEmpty]: Start isEmpty. Operand 101467 states and 388104 transitions. [2021-06-05 09:21:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:21:25,085 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:21:25,086 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:21:25,286 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2021-06-05 09:21:25,286 INFO L430 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:21:25,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:21:25,286 INFO L82 PathProgramCache]: Analyzing trace with hash -734138609, now seen corresponding path program 6 times [2021-06-05 09:21:25,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:21:25,287 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257385756] [2021-06-05 09:21:25,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:21:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:21:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:21:25,357 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:21:25,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257385756] [2021-06-05 09:21:25,357 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257385756] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:21:25,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079983003] [2021-06-05 09:21:25,357 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 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 09:21:25,419 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 09:21:25,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:21:25,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:21:25,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:21:25,485 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 09:21:25,486 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:21:25,490 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:21:25,491 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:21:25,491 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 09:21:25,509 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:21:25,509 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 09:21:25,511 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:21:25,515 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:21:25,516 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:21:25,516 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 09:21:25,531 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 13 treesize of output 9 [2021-06-05 09:21:25,532 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:21:25,538 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:21:25,538 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:21:25,539 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-06-05 09:21:25,556 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 17 treesize of output 17 [2021-06-05 09:21:25,557 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:21:25,566 INFO L628 ElimStorePlain]: treesize reduction 4, result has 83.3 percent of original size [2021-06-05 09:21:25,570 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:21:25,570 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-06-05 09:21:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:21:25,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079983003] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:21:25,644 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:21:25,644 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-06-05 09:21:25,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083690354] [2021-06-05 09:21:25,644 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:21:25,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:21:25,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:21:25,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:21:25,645 INFO L87 Difference]: Start difference. First operand 101467 states and 388104 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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 09:21:27,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:21:27,432 INFO L93 Difference]: Finished difference Result 184056 states and 704813 transitions. [2021-06-05 09:21:27,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:21:27,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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 59 [2021-06-05 09:21:27,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:21:28,045 INFO L225 Difference]: With dead ends: 184056 [2021-06-05 09:21:28,045 INFO L226 Difference]: Without dead ends: 183903 [2021-06-05 09:21:28,045 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 172.7ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:21:29,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183903 states. [2021-06-05 09:21:32,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183903 to 101864. [2021-06-05 09:21:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101864 states, 101841 states have (on average 3.8298327785469506) internal successors, (390034), 101863 states have internal predecessors, (390034), 0 states have call successors, (0), 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 09:21:33,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101864 states to 101864 states and 390034 transitions. [2021-06-05 09:21:33,402 INFO L78 Accepts]: Start accepts. Automaton has 101864 states and 390034 transitions. Word has length 59 [2021-06-05 09:21:33,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:21:33,402 INFO L482 AbstractCegarLoop]: Abstraction has 101864 states and 390034 transitions. [2021-06-05 09:21:33,402 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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 09:21:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 101864 states and 390034 transitions. [2021-06-05 09:21:33,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:21:33,457 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:21:33,457 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:21:33,672 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2021-06-05 09:21:33,673 INFO L430 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:21:33,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:21:33,673 INFO L82 PathProgramCache]: Analyzing trace with hash 467846663, now seen corresponding path program 7 times [2021-06-05 09:21:33,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:21:33,673 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557552164] [2021-06-05 09:21:33,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:21:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:21:33,743 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:21:33,743 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:21:33,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557552164] [2021-06-05 09:21:33,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557552164] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:21:33,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16417010] [2021-06-05 09:21:33,743 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 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 09:21:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:21:33,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 09:21:33,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:21:34,502 WARN L205 SmtUtils]: Spent 588.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2021-06-05 09:21:34,518 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 11 treesize of output 7 [2021-06-05 09:21:34,519 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:21:34,526 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:21:34,527 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 09:21:34,527 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:21:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:21:34,622 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16417010] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:21:34,622 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:21:34,622 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2021-06-05 09:21:34,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619218263] [2021-06-05 09:21:34,622 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 09:21:34,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:21:34,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 09:21:34,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:21:34,623 INFO L87 Difference]: Start difference. First operand 101864 states and 390034 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 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 09:21:35,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:21:35,851 INFO L93 Difference]: Finished difference Result 103981 states and 398381 transitions. [2021-06-05 09:21:35,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 09:21:35,852 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 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 09:21:35,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:21:36,164 INFO L225 Difference]: With dead ends: 103981 [2021-06-05 09:21:36,164 INFO L226 Difference]: Without dead ends: 103771 [2021-06-05 09:21:36,164 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 196.5ms TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:21:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103771 states. [2021-06-05 09:21:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103771 to 101099. [2021-06-05 09:21:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101099 states, 101076 states have (on average 3.8276544382444895) internal successors, (386884), 101098 states have internal predecessors, (386884), 0 states have call successors, (0), 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 09:21:40,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101099 states to 101099 states and 386884 transitions. [2021-06-05 09:21:40,274 INFO L78 Accepts]: Start accepts. Automaton has 101099 states and 386884 transitions. Word has length 59 [2021-06-05 09:21:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:21:40,274 INFO L482 AbstractCegarLoop]: Abstraction has 101099 states and 386884 transitions. [2021-06-05 09:21:40,274 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 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 09:21:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 101099 states and 386884 transitions. [2021-06-05 09:21:40,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:21:40,321 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:21:40,321 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:21:40,522 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2021-06-05 09:21:40,522 INFO L430 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:21:40,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:21:40,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1590500643, now seen corresponding path program 8 times [2021-06-05 09:21:40,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:21:40,523 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070892126] [2021-06-05 09:21:40,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:21:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:21:40,585 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:21:40,586 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:21:40,586 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070892126] [2021-06-05 09:21:40,586 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070892126] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:21:40,586 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613134570] [2021-06-05 09:21:40,586 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 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 09:21:40,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:21:40,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:21:40,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 09:21:40,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:21:40,719 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 13 treesize of output 9 [2021-06-05 09:21:40,720 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:21:40,724 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:21:40,725 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:21:40,725 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2021-06-05 09:21:40,771 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-06-05 09:21:40,771 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 29 treesize of output 28 [2021-06-05 09:21:40,772 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:21:40,780 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:21:40,782 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 09:21:40,782 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 09:21:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:21:40,808 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613134570] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:21:40,808 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:21:40,808 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-06-05 09:21:40,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404486671] [2021-06-05 09:21:40,809 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:21:40,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:21:40,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:21:40,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:21:40,809 INFO L87 Difference]: Start difference. First operand 101099 states and 386884 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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 09:21:42,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:21:42,282 INFO L93 Difference]: Finished difference Result 146935 states and 568667 transitions. [2021-06-05 09:21:42,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 09:21:42,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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 59 [2021-06-05 09:21:42,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:21:42,779 INFO L225 Difference]: With dead ends: 146935 [2021-06-05 09:21:42,779 INFO L226 Difference]: Without dead ends: 146715 [2021-06-05 09:21:42,779 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 120.5ms TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:21:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146715 states. [2021-06-05 09:21:46,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146715 to 101329. [2021-06-05 09:21:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101329 states, 101306 states have (on average 3.827315262669536) internal successors, (387730), 101328 states have internal predecessors, (387730), 0 states have call successors, (0), 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 09:21:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101329 states to 101329 states and 387730 transitions. [2021-06-05 09:21:46,568 INFO L78 Accepts]: Start accepts. Automaton has 101329 states and 387730 transitions. Word has length 59 [2021-06-05 09:21:46,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:21:46,569 INFO L482 AbstractCegarLoop]: Abstraction has 101329 states and 387730 transitions. [2021-06-05 09:21:46,569 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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 09:21:46,569 INFO L276 IsEmpty]: Start isEmpty. Operand 101329 states and 387730 transitions. [2021-06-05 09:21:46,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:21:46,607 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:21:46,607 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:21:46,807 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115,62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:21:46,808 INFO L430 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:21:46,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:21:46,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1318267846, now seen corresponding path program 1 times [2021-06-05 09:21:46,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:21:46,808 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515845668] [2021-06-05 09:21:46,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:21:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:21:46,870 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:21:46,870 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:21:46,870 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515845668] [2021-06-05 09:21:46,870 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515845668] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:21:46,870 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228613177] [2021-06-05 09:21:46,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:21:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:21:46,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 09:21:46,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:21:47,663 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 11 treesize of output 7 [2021-06-05 09:21:47,669 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:21:47,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:21:47,689 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 09:21:47,689 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:21:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:21:47,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228613177] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:21:47,711 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:21:47,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 12 [2021-06-05 09:21:47,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427091514] [2021-06-05 09:21:47,711 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 09:21:47,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:21:47,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 09:21:47,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:21:47,712 INFO L87 Difference]: Start difference. First operand 101329 states and 387730 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 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 09:21:48,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:21:48,781 INFO L93 Difference]: Finished difference Result 108737 states and 416348 transitions. [2021-06-05 09:21:48,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:21:48,782 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 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 09:21:48,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:21:49,089 INFO L225 Difference]: With dead ends: 108737 [2021-06-05 09:21:49,089 INFO L226 Difference]: Without dead ends: 107873 [2021-06-05 09:21:49,089 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 178.6ms TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:21:50,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107873 states. [2021-06-05 09:21:52,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107873 to 100327. [2021-06-05 09:21:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100327 states, 100304 states have (on average 3.828441537725315) internal successors, (384008), 100326 states have internal predecessors, (384008), 0 states have call successors, (0), 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 09:21:53,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100327 states to 100327 states and 384008 transitions. [2021-06-05 09:21:53,150 INFO L78 Accepts]: Start accepts. Automaton has 100327 states and 384008 transitions. Word has length 59 [2021-06-05 09:21:53,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:21:53,150 INFO L482 AbstractCegarLoop]: Abstraction has 100327 states and 384008 transitions. [2021-06-05 09:21:53,150 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 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 09:21:53,150 INFO L276 IsEmpty]: Start isEmpty. Operand 100327 states and 384008 transitions. [2021-06-05 09:21:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:21:53,197 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:21:53,197 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:21:53,400 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable116 [2021-06-05 09:21:53,401 INFO L430 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:21:53,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:21:53,401 INFO L82 PathProgramCache]: Analyzing trace with hash -326167187, now seen corresponding path program 9 times [2021-06-05 09:21:53,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:21:53,401 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102171422] [2021-06-05 09:21:53,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:21:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:21:53,477 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:21:53,477 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:21:53,477 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102171422] [2021-06-05 09:21:53,477 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102171422] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:21:53,477 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672749831] [2021-06-05 09:21:53,477 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 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 09:21:53,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:21:53,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:21:53,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:21:53,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:21:53,634 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 09:21:53,635 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:21:53,638 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:21:53,639 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:21:53,639 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 09:21:53,655 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 13 treesize of output 9 [2021-06-05 09:21:53,656 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:21:53,662 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:21:53,663 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:21:53,663 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-06-05 09:21:53,687 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:21:53,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 09:21:53,689 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:21:53,696 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:21:53,696 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:21:53,697 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2021-06-05 09:21:53,718 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 17 treesize of output 17 [2021-06-05 09:21:53,719 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:21:53,730 INFO L628 ElimStorePlain]: treesize reduction 4, result has 83.3 percent of original size [2021-06-05 09:21:53,731 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:21:53,731 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-06-05 09:21:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:21:53,799 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672749831] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:21:53,799 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:21:53,799 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-06-05 09:21:53,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101601021] [2021-06-05 09:21:53,799 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:21:53,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:21:53,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:21:53,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:21:53,800 INFO L87 Difference]: Start difference. First operand 100327 states and 384008 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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 09:21:56,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:21:56,494 INFO L93 Difference]: Finished difference Result 147210 states and 562412 transitions. [2021-06-05 09:21:56,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:21:56,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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 59 [2021-06-05 09:21:56,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:21:56,989 INFO L225 Difference]: With dead ends: 147210 [2021-06-05 09:21:56,989 INFO L226 Difference]: Without dead ends: 147057 [2021-06-05 09:21:56,989 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 182.1ms TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:21:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147057 states. [2021-06-05 09:22:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147057 to 100701. [2021-06-05 09:22:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100701 states, 100678 states have (on average 3.8300820437434195) internal successors, (385605), 100700 states have internal predecessors, (385605), 0 states have call successors, (0), 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 09:22:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100701 states to 100701 states and 385605 transitions. [2021-06-05 09:22:00,773 INFO L78 Accepts]: Start accepts. Automaton has 100701 states and 385605 transitions. Word has length 59 [2021-06-05 09:22:00,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:22:00,773 INFO L482 AbstractCegarLoop]: Abstraction has 100701 states and 385605 transitions. [2021-06-05 09:22:00,773 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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 09:22:00,773 INFO L276 IsEmpty]: Start isEmpty. Operand 100701 states and 385605 transitions. [2021-06-05 09:22:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:22:00,811 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:22:00,811 INFO L521 BasicCegarLoop]: trace histogram [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] [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forcibly destroying the process [2021-06-05 09:22:01,350 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:22:01,351 INFO L430 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:22:01,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:22:01,351 INFO L82 PathProgramCache]: Analyzing trace with hash 875818085, now seen corresponding path program 10 times [2021-06-05 09:22:01,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:22:01,351 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578643145] [2021-06-05 09:22:01,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] The stream was forcibly closed: stdIn [2021-06-05 09:22:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:22:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:22:01,472 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:22:01,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578643145] [2021-06-05 09:22:01,473 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578643145] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:22:01,473 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861752609] [2021-06-05 09:22:01,473 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 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 09:22:01,618 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:22:01,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:22:01,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 09:22:01,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:22:01,764 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 11 treesize of output 7 [2021-06-05 09:22:01,765 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:22:01,771 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:22:01,772 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 09:22:01,772 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:22:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:22:01,805 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861752609] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:22:01,805 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:22:01,805 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 12 [2021-06-05 09:22:01,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501818049] [2021-06-05 09:22:01,806 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 09:22:01,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:22:01,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 09:22:01,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:22:01,806 INFO L87 Difference]: Start difference. First operand 100701 states and 385605 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 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 09:22:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:22:02,775 INFO L93 Difference]: Finished difference Result 104231 states and 399543 transitions. [2021-06-05 09:22:02,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 09:22:02,776 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 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 09:22:02,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:22:03,088 INFO L225 Difference]: With dead ends: 104231 [2021-06-05 09:22:03,088 INFO L226 Difference]: Without dead ends: 103534 [2021-06-05 09:22:03,088 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 187.0ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:22:04,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103534 states. [2021-06-05 09:22:06,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103534 to 99439. [2021-06-05 09:22:06,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99439 states, 99416 states have (on average 3.828156433572061) internal successors, (380580), 99438 states have internal predecessors, (380580), 0 states have call successors, (0), 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 09:22:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99439 states to 99439 states and 380580 transitions. [2021-06-05 09:22:07,113 INFO L78 Accepts]: Start accepts. Automaton has 99439 states and 380580 transitions. Word has length 59 [2021-06-05 09:22:07,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:22:07,113 INFO L482 AbstractCegarLoop]: Abstraction has 99439 states and 380580 transitions. [2021-06-05 09:22:07,113 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 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 09:22:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 99439 states and 380580 transitions. [2021-06-05 09:22:07,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:22:07,162 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:22:07,162 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:22:07,362 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2021-06-05 09:22:07,363 INFO L430 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:22:07,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:22:07,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1516449909, now seen corresponding path program 1 times [2021-06-05 09:22:07,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:22:07,363 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595606406] [2021-06-05 09:22:07,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:22:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:22:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:22:07,422 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:22:07,422 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595606406] [2021-06-05 09:22:07,422 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595606406] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:22:07,422 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:22:07,422 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 09:22:07,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308455645] [2021-06-05 09:22:07,422 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:22:07,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:22:07,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:22:07,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 09:22:07,423 INFO L87 Difference]: Start difference. First operand 99439 states and 380580 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 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 09:22:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:22:08,121 INFO L93 Difference]: Finished difference Result 107982 states and 412439 transitions. [2021-06-05 09:22:08,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:22:08,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 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 59 [2021-06-05 09:22:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:22:09,042 INFO L225 Difference]: With dead ends: 107982 [2021-06-05 09:22:09,042 INFO L226 Difference]: Without dead ends: 103632 [2021-06-05 09:22:09,043 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 56.7ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:22:09,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103632 states. [2021-06-05 09:22:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103632 to 100710. [2021-06-05 09:22:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100710 states, 100687 states have (on average 3.833007240259418) internal successors, (385934), 100709 states have internal predecessors, (385934), 0 states have call successors, (0), 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 09:22:12,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100710 states to 100710 states and 385934 transitions. [2021-06-05 09:22:12,454 INFO L78 Accepts]: Start accepts. Automaton has 100710 states and 385934 transitions. Word has length 59 [2021-06-05 09:22:12,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:22:12,454 INFO L482 AbstractCegarLoop]: Abstraction has 100710 states and 385934 transitions. [2021-06-05 09:22:12,454 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 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 09:22:12,454 INFO L276 IsEmpty]: Start isEmpty. Operand 100710 states and 385934 transitions. [2021-06-05 09:22:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:22:12,496 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:22:12,496 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:22:12,497 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-06-05 09:22:12,497 INFO L430 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:22:12,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:22:12,497 INFO L82 PathProgramCache]: Analyzing trace with hash 964608447, now seen corresponding path program 2 times [2021-06-05 09:22:12,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:22:12,497 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711445050] [2021-06-05 09:22:12,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:22:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:22:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:22:12,564 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:22:12,565 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711445050] [2021-06-05 09:22:12,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711445050] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:22:12,565 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:22:12,565 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 09:22:12,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31224345] [2021-06-05 09:22:12,565 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:22:12,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:22:12,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:22:12,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 09:22:12,565 INFO L87 Difference]: Start difference. First operand 100710 states and 385934 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 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 09:22:13,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:22:13,302 INFO L93 Difference]: Finished difference Result 103642 states and 397067 transitions. [2021-06-05 09:22:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:22:13,303 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 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 59 [2021-06-05 09:22:13,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:22:14,251 INFO L225 Difference]: With dead ends: 103642 [2021-06-05 09:22:14,251 INFO L226 Difference]: Without dead ends: 103066 [2021-06-05 09:22:14,251 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 82.9ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:22:15,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103066 states. [2021-06-05 09:22:17,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103066 to 99858. [2021-06-05 09:22:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99858 states, 99835 states have (on average 3.8344468372815146) internal successors, (382812), 99857 states have internal predecessors, (382812), 0 states have call successors, (0), 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 09:22:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99858 states to 99858 states and 382812 transitions. [2021-06-05 09:22:17,612 INFO L78 Accepts]: Start accepts. Automaton has 99858 states and 382812 transitions. Word has length 59 [2021-06-05 09:22:17,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:22:17,613 INFO L482 AbstractCegarLoop]: Abstraction has 99858 states and 382812 transitions. [2021-06-05 09:22:17,613 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 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 09:22:17,613 INFO L276 IsEmpty]: Start isEmpty. Operand 99858 states and 382812 transitions. [2021-06-05 09:22:17,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:22:17,653 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:22:17,653 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:22:17,653 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-06-05 09:22:17,653 INFO L430 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:22:17,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:22:17,653 INFO L82 PathProgramCache]: Analyzing trace with hash -262092030, now seen corresponding path program 1 times [2021-06-05 09:22:17,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:22:17,653 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663601837] [2021-06-05 09:22:17,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:22:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:22:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:22:17,730 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:22:17,731 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663601837] [2021-06-05 09:22:17,731 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663601837] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:22:17,731 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:22:17,731 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 09:22:17,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498785135] [2021-06-05 09:22:17,731 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:22:17,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:22:17,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:22:17,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 09:22:17,732 INFO L87 Difference]: Start difference. First operand 99858 states and 382812 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 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 09:22:19,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:22:19,023 INFO L93 Difference]: Finished difference Result 95851 states and 367755 transitions. [2021-06-05 09:22:19,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:22:19,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 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 59 [2021-06-05 09:22:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:22:19,385 INFO L225 Difference]: With dead ends: 95851 [2021-06-05 09:22:19,385 INFO L226 Difference]: Without dead ends: 95200 [2021-06-05 09:22:19,386 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 89.1ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:22:20,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95200 states. [2021-06-05 09:22:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95200 to 93655. [2021-06-05 09:22:22,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93655 states, 93635 states have (on average 3.837528701874299) internal successors, (359327), 93654 states have internal predecessors, (359327), 0 states have call successors, (0), 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 09:22:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93655 states to 93655 states and 359327 transitions. [2021-06-05 09:22:23,311 INFO L78 Accepts]: Start accepts. Automaton has 93655 states and 359327 transitions. Word has length 59 [2021-06-05 09:22:23,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:22:23,311 INFO L482 AbstractCegarLoop]: Abstraction has 93655 states and 359327 transitions. [2021-06-05 09:22:23,311 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 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 09:22:23,311 INFO L276 IsEmpty]: Start isEmpty. Operand 93655 states and 359327 transitions. [2021-06-05 09:22:23,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 09:22:23,367 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:22:23,367 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:22:23,368 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-06-05 09:22:23,368 INFO L430 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:22:23,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:22:23,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1492840170, now seen corresponding path program 1 times [2021-06-05 09:22:23,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:22:23,369 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402417850] [2021-06-05 09:22:23,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:22:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:22:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:22:23,449 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:22:23,449 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402417850] [2021-06-05 09:22:23,449 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402417850] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:22:23,449 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872416366] [2021-06-05 09:22:23,449 INFO L95 rtionOrderModulation]: Keeping assertion order 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 09:22:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:22:23,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 09:22:23,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:22:23,676 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 11 treesize of output 7 [2021-06-05 09:22:23,677 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:22:23,684 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:22:23,685 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 09:22:23,685 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:22:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:22:23,708 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872416366] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:22:23,708 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:22:23,708 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2021-06-05 09:22:23,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894831334] [2021-06-05 09:22:23,709 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 09:22:23,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:22:23,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 09:22:23,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:22:23,709 INFO L87 Difference]: Start difference. First operand 93655 states and 359327 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 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 09:22:25,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:22:25,319 INFO L93 Difference]: Finished difference Result 104644 states and 401213 transitions. [2021-06-05 09:22:25,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 09:22:25,319 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 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 09:22:25,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:22:25,689 INFO L225 Difference]: With dead ends: 104644 [2021-06-05 09:22:25,689 INFO L226 Difference]: Without dead ends: 99724 [2021-06-05 09:22:25,689 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 141.2ms TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:22:26,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99724 states. [2021-06-05 09:22:28,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99724 to 93105. [2021-06-05 09:22:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93105 states, 93085 states have (on average 3.8442821077509803) internal successors, (357845), 93104 states have internal predecessors, (357845), 0 states have call successors, (0), 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 09:22:29,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93105 states to 93105 states and 357845 transitions. [2021-06-05 09:22:29,048 INFO L78 Accepts]: Start accepts. Automaton has 93105 states and 357845 transitions. Word has length 60 [2021-06-05 09:22:29,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:22:29,048 INFO L482 AbstractCegarLoop]: Abstraction has 93105 states and 357845 transitions. [2021-06-05 09:22:29,048 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 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 09:22:29,049 INFO L276 IsEmpty]: Start isEmpty. Operand 93105 states and 357845 transitions. [2021-06-05 09:22:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 09:22:29,091 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:22:29,092 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:22:29,292 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2021-06-05 09:22:29,292 INFO L430 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:22:29,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:22:29,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1331831322, now seen corresponding path program 2 times [2021-06-05 09:22:29,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:22:29,293 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225005614] [2021-06-05 09:22:29,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:22:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:22:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:22:29,360 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:22:29,360 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225005614] [2021-06-05 09:22:29,360 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225005614] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:22:29,360 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416843956] [2021-06-05 09:22:29,360 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 09:22:29,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:22:29,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:22:29,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 09:22:29,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:22:29,499 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 13 treesize of output 9 [2021-06-05 09:22:29,500 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:22:29,504 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:22:29,505 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:22:29,505 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2021-06-05 09:22:29,571 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-06-05 09:22:29,571 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 29 treesize of output 28 [2021-06-05 09:22:29,572 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:22:29,580 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:22:29,582 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 09:22:29,582 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 09:22:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-06-05 09:22:29,605 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416843956] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:22:29,605 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:22:29,605 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-06-05 09:22:29,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149704218] [2021-06-05 09:22:29,605 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:22:29,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:22:29,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:22:29,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:22:29,606 INFO L87 Difference]: Start difference. First operand 93105 states and 357845 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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 09:22:31,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:22:31,154 INFO L93 Difference]: Finished difference Result 159462 states and 619650 transitions. [2021-06-05 09:22:31,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 09:22:31,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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 09:22:31,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:22:31,695 INFO L225 Difference]: With dead ends: 159462 [2021-06-05 09:22:31,695 INFO L226 Difference]: Without dead ends: 159072 [2021-06-05 09:22:31,695 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 137.4ms TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:22:33,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159072 states. [2021-06-05 09:22:35,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159072 to 94437. [2021-06-05 09:22:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94437 states, 94417 states have (on average 3.846711926877575) internal successors, (363195), 94436 states have internal predecessors, (363195), 0 states have call successors, (0), 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 09:22:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94437 states to 94437 states and 363195 transitions. [2021-06-05 09:22:36,167 INFO L78 Accepts]: Start accepts. Automaton has 94437 states and 363195 transitions. Word has length 60 [2021-06-05 09:22:36,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:22:36,167 INFO L482 AbstractCegarLoop]: Abstraction has 94437 states and 363195 transitions. [2021-06-05 09:22:36,167 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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 09:22:36,167 INFO L276 IsEmpty]: Start isEmpty. Operand 94437 states and 363195 transitions. [2021-06-05 09:22:36,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 09:22:36,235 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:22:36,235 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:22:36,435 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2021-06-05 09:22:36,435 INFO L430 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:22:36,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:22:36,436 INFO L82 PathProgramCache]: Analyzing trace with hash 284502192, now seen corresponding path program 1 times [2021-06-05 09:22:36,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:22:36,436 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123465045] [2021-06-05 09:22:36,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:22:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:22:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:22:36,497 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:22:36,497 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123465045] [2021-06-05 09:22:36,497 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123465045] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:22:36,497 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109884938] [2021-06-05 09:22:36,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:22:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:22:36,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 09:22:36,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:22:36,694 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 11 treesize of output 7 [2021-06-05 09:22:36,695 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:22:36,701 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:22:36,702 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 09:22:36,702 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:22:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:22:36,722 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109884938] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:22:36,722 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:22:36,722 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2021-06-05 09:22:36,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671787856] [2021-06-05 09:22:36,723 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 09:22:36,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:22:36,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 09:22:36,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:22:36,723 INFO L87 Difference]: Start difference. First operand 94437 states and 363195 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:22:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:22:37,970 INFO L93 Difference]: Finished difference Result 104697 states and 403179 transitions. [2021-06-05 09:22:37,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 09:22:37,970 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:22:37,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:22:38,887 INFO L225 Difference]: With dead ends: 104697 [2021-06-05 09:22:38,887 INFO L226 Difference]: Without dead ends: 104197 [2021-06-05 09:22:38,887 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 191.7ms TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:22:39,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104197 states. [2021-06-05 09:22:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104197 to 92595. [2021-06-05 09:22:41,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92595 states, 92575 states have (on average 3.8459195247096947) internal successors, (356036), 92594 states have internal predecessors, (356036), 0 states have call successors, (0), 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 09:22:42,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92595 states to 92595 states and 356036 transitions. [2021-06-05 09:22:42,160 INFO L78 Accepts]: Start accepts. Automaton has 92595 states and 356036 transitions. Word has length 60 [2021-06-05 09:22:42,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:22:42,161 INFO L482 AbstractCegarLoop]: Abstraction has 92595 states and 356036 transitions. [2021-06-05 09:22:42,161 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 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 09:22:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 92595 states and 356036 transitions. [2021-06-05 09:22:42,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 09:22:42,208 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:22:42,208 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:22:42,409 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2021-06-05 09:22:42,409 INFO L430 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:22:42,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:22:42,409 INFO L82 PathProgramCache]: Analyzing trace with hash -261230714, now seen corresponding path program 2 times [2021-06-05 09:22:42,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:22:42,409 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760351655] [2021-06-05 09:22:42,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:22:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:22:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:22:42,479 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:22:42,479 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760351655] [2021-06-05 09:22:42,480 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760351655] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:22:42,480 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101770341] [2021-06-05 09:22:42,480 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:22:42,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:22:42,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:22:42,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:22:42,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:22:42,632 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 09:22:42,632 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:22:42,636 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:22:42,637 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:22:42,637 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 09:22:42,655 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:22:42,656 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 09:22:42,657 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:22:42,662 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:22:42,663 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:22:42,663 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 09:22:42,680 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 13 treesize of output 9 [2021-06-05 09:22:42,681 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:22:42,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:22:42,688 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:22:42,689 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-06-05 09:22:42,711 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 17 treesize of output 17 [2021-06-05 09:22:42,712 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:22:42,723 INFO L628 ElimStorePlain]: treesize reduction 4, result has 83.3 percent of original size [2021-06-05 09:22:42,723 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:22:42,723 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-06-05 09:22:42,793 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-06-05 09:22:42,793 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101770341] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:22:42,793 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:22:42,793 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-06-05 09:22:42,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588071495] [2021-06-05 09:22:42,793 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:22:42,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:22:42,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:22:42,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:22:42,794 INFO L87 Difference]: Start difference. First operand 92595 states and 356036 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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 09:22:44,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:22:44,867 INFO L93 Difference]: Finished difference Result 227451 states and 877266 transitions. [2021-06-05 09:22:44,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:22:44,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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 09:22:44,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:22:45,667 INFO L225 Difference]: With dead ends: 227451 [2021-06-05 09:22:45,668 INFO L226 Difference]: Without dead ends: 227103 [2021-06-05 09:22:45,668 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 180.6ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:22:47,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227103 states. [2021-06-05 09:22:50,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227103 to 94394. [2021-06-05 09:22:50,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94394 states, 94374 states have (on average 3.8528090363871406) internal successors, (363605), 94393 states have internal predecessors, (363605), 0 states have call successors, (0), 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 09:22:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94394 states to 94394 states and 363605 transitions. [2021-06-05 09:22:50,588 INFO L78 Accepts]: Start accepts. Automaton has 94394 states and 363605 transitions. Word has length 60 [2021-06-05 09:22:50,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:22:50,588 INFO L482 AbstractCegarLoop]: Abstraction has 94394 states and 363605 transitions. [2021-06-05 09:22:50,588 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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 09:22:50,588 INFO L276 IsEmpty]: Start isEmpty. Operand 94394 states and 363605 transitions. [2021-06-05 09:22:50,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 09:22:50,636 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:22:50,637 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:22:50,837 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2021-06-05 09:22:50,837 INFO L430 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:22:50,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:22:50,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1327480164, now seen corresponding path program 3 times [2021-06-05 09:22:50,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:22:50,838 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139955475] [2021-06-05 09:22:50,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:22:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:22:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:22:50,906 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:22:50,906 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139955475] [2021-06-05 09:22:50,906 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139955475] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:22:50,906 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620452619] [2021-06-05 09:22:50,906 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:22:50,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:22:50,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:22:50,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:22:50,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:22:51,041 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 09:22:51,042 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:22:51,045 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:22:51,045 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:22:51,045 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 09:22:51,061 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:22:51,062 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 09:22:51,078 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:22:51,082 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:22:51,083 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:22:51,083 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 09:22:51,098 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 13 treesize of output 9 [2021-06-05 09:22:51,098 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:22:51,104 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:22:51,105 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:22:51,105 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-06-05 09:22: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 17 treesize of output 17 [2021-06-05 09:22:51,123 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:22:51,133 INFO L628 ElimStorePlain]: treesize reduction 4, result has 83.3 percent of original size [2021-06-05 09:22:51,133 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:22:51,134 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-06-05 09:22:51,179 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-06-05 09:22:51,179 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620452619] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:22:51,179 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:22:51,179 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-06-05 09:22:51,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562537866] [2021-06-05 09:22:51,179 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:22:51,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:22:51,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:22:51,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:22:51,180 INFO L87 Difference]: Start difference. First operand 94394 states and 363605 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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 09:22:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:22:54,963 INFO L93 Difference]: Finished difference Result 210883 states and 814521 transitions. [2021-06-05 09:22:54,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:22:54,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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 09:22:54,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:22:55,806 INFO L225 Difference]: With dead ends: 210883 [2021-06-05 09:22:55,806 INFO L226 Difference]: Without dead ends: 210263 [2021-06-05 09:22:55,806 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 244.7ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:22:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210263 states. [2021-06-05 09:22:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210263 to 94736. [2021-06-05 09:22:59,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94736 states, 94716 states have (on average 3.851598462772921) internal successors, (364808), 94735 states have internal predecessors, (364808), 0 states have call successors, (0), 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 09:23:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94736 states to 94736 states and 364808 transitions. [2021-06-05 09:23:00,728 INFO L78 Accepts]: Start accepts. Automaton has 94736 states and 364808 transitions. Word has length 60 [2021-06-05 09:23:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:23:00,728 INFO L482 AbstractCegarLoop]: Abstraction has 94736 states and 364808 transitions. [2021-06-05 09:23:00,728 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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 09:23:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 94736 states and 364808 transitions. [2021-06-05 09:23:00,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 09:23:00,785 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:23:00,785 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 09:23:00,986 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126,70 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:23:00,986 INFO L430 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:23:00,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:23:00,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1245839780, now seen corresponding path program 4 times [2021-06-05 09:23:00,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:23:00,987 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67793513] [2021-06-05 09:23:00,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:23:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:23:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:23:01,054 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:23:01,055 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67793513] [2021-06-05 09:23:01,055 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67793513] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:23:01,055 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457909693] [2021-06-05 09:23:01,055 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:23:01,125 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:23:01,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:23:01,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 09:23:01,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:23:01,222 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 11 treesize of output 7 [2021-06-05 09:23:01,222 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:01,229 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:01,230 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 09:23:01,230 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:23:01,263 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:23:01,263 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457909693] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:23:01,263 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:23:01,263 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 12 [2021-06-05 09:23:01,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879333774] [2021-06-05 09:23:01,263 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 09:23:01,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:23:01,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 09:23:01,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:23:01,264 INFO L87 Difference]: Start difference. First operand 94736 states and 364808 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:23:02,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:23:02,126 INFO L93 Difference]: Finished difference Result 85242 states and 328074 transitions. [2021-06-05 09:23:02,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 09:23:02,126 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:23:02,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:23:03,032 INFO L225 Difference]: With dead ends: 85242 [2021-06-05 09:23:03,032 INFO L226 Difference]: Without dead ends: 84718 [2021-06-05 09:23:03,033 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 131.3ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:23:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84718 states. [2021-06-05 09:23:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84718 to 81403. [2021-06-05 09:23:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81403 states, 81383 states have (on average 3.842706707789096) internal successors, (312731), 81402 states have internal predecessors, (312731), 0 states have call successors, (0), 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 09:23:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81403 states to 81403 states and 312731 transitions. [2021-06-05 09:23:05,306 INFO L78 Accepts]: Start accepts. Automaton has 81403 states and 312731 transitions. Word has length 60 [2021-06-05 09:23:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:23:05,306 INFO L482 AbstractCegarLoop]: Abstraction has 81403 states and 312731 transitions. [2021-06-05 09:23:05,306 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 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 09:23:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 81403 states and 312731 transitions. [2021-06-05 09:23:05,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 09:23:05,350 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:23:05,350 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:23:05,552 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable127 [2021-06-05 09:23:05,553 INFO L430 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:23:05,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:23:05,553 INFO L82 PathProgramCache]: Analyzing trace with hash -289319817, now seen corresponding path program 2 times [2021-06-05 09:23:05,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:23:05,553 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614813699] [2021-06-05 09:23:05,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:23:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:23:05,697 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 09:23:05,697 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:23:05,697 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614813699] [2021-06-05 09:23:05,697 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614813699] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:23:05,697 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156788831] [2021-06-05 09:23:05,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:23:05,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:23:05,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:23:05,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 40 conjunts are in the unsatisfiable core [2021-06-05 09:23:05,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:23:05,807 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 09:23:05,807 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:05,812 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:05,813 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:23:05,813 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:23:05,851 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:23:05,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2021-06-05 09:23:05,853 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:05,860 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:05,861 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:23:05,861 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2021-06-05 09:23:05,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 11 treesize of output 7 [2021-06-05 09:23:05,905 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:05,912 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:05,914 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:23:05,914 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2021-06-05 09:23:06,419 WARN L205 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2021-06-05 09:23:06,561 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 09:23:06,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:23:06,563 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:06,571 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:06,573 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:23:06,573 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2021-06-05 09:23:06,610 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 11 treesize of output 7 [2021-06-05 09:23:06,611 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:06,617 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:06,617 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:23:06,617 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-06-05 09:23:06,685 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 19 treesize of output 18 [2021-06-05 09:23:06,687 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:06,695 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:06,696 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 09:23:06,696 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:23:06,719 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 09:23:06,720 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156788831] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:23:06,720 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:23:06,720 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 17 [2021-06-05 09:23:06,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753874115] [2021-06-05 09:23:06,720 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 09:23:06,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:23:06,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 09:23:06,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:23:06,721 INFO L87 Difference]: Start difference. First operand 81403 states and 312731 transitions. Second operand has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 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 09:23:07,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:23:07,823 INFO L93 Difference]: Finished difference Result 82877 states and 318697 transitions. [2021-06-05 09:23:07,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 09:23:07,824 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 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 09:23:07,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:23:08,040 INFO L225 Difference]: With dead ends: 82877 [2021-06-05 09:23:08,040 INFO L226 Difference]: Without dead ends: 82877 [2021-06-05 09:23:08,040 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 344.2ms TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:23:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82877 states. [2021-06-05 09:23:10,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82877 to 81775. [2021-06-05 09:23:10,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81775 states, 81755 states have (on average 3.843349030640328) internal successors, (314213), 81774 states have internal predecessors, (314213), 0 states have call successors, (0), 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 09:23:10,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81775 states to 81775 states and 314213 transitions. [2021-06-05 09:23:10,794 INFO L78 Accepts]: Start accepts. Automaton has 81775 states and 314213 transitions. Word has length 60 [2021-06-05 09:23:10,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:23:10,794 INFO L482 AbstractCegarLoop]: Abstraction has 81775 states and 314213 transitions. [2021-06-05 09:23:10,794 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 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 09:23:10,795 INFO L276 IsEmpty]: Start isEmpty. Operand 81775 states and 314213 transitions. [2021-06-05 09:23:10,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 09:23:10,835 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:23:10,835 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:23:11,035 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2021-06-05 09:23:11,036 INFO L430 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:23:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:23:11,036 INFO L82 PathProgramCache]: Analyzing trace with hash -860889481, now seen corresponding path program 3 times [2021-06-05 09:23:11,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:23:11,036 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063806010] [2021-06-05 09:23:11,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:23:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:23:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-06-05 09:23:11,153 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:23:11,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063806010] [2021-06-05 09:23:11,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063806010] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:23:11,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681321458] [2021-06-05 09:23:11,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:23:11,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 09:23:11,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:23:11,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 38 conjunts are in the unsatisfiable core [2021-06-05 09:23:11,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:23:11,268 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 09:23:11,269 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:11,273 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:11,274 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:23:11,274 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:23:11,336 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:23:11,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2021-06-05 09:23:11,337 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:11,343 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:11,345 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:23:11,345 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2021-06-05 09:23:11,466 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 09:23:11,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:23:11,469 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:11,476 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:11,477 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:23:11,477 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2021-06-05 09:23:11,532 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 11 treesize of output 7 [2021-06-05 09:23:11,533 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:11,538 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:11,539 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:23:11,539 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-06-05 09:23:11,565 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 19 treesize of output 18 [2021-06-05 09:23:11,566 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:11,572 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:11,573 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 09:23:11,573 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:23:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 09:23:11,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681321458] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:23:11,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:23:11,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 09:23:11,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807726576] [2021-06-05 09:23:11,592 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 09:23:11,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:23:11,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 09:23:11,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:23:11,593 INFO L87 Difference]: Start difference. First operand 81775 states and 314213 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 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 09:23:12,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:23:12,826 INFO L93 Difference]: Finished difference Result 81564 states and 313907 transitions. [2021-06-05 09:23:12,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:23:12,826 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 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 09:23:12,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:23:13,047 INFO L225 Difference]: With dead ends: 81564 [2021-06-05 09:23:13,047 INFO L226 Difference]: Without dead ends: 81564 [2021-06-05 09:23:13,047 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 186.2ms TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:23:13,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81564 states. [2021-06-05 09:23:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81564 to 80839. [2021-06-05 09:23:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80839 states, 80819 states have (on average 3.8476967049827393) internal successors, (310967), 80838 states have internal predecessors, (310967), 0 states have call successors, (0), 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 09:23:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80839 states to 80839 states and 310967 transitions. [2021-06-05 09:23:15,865 INFO L78 Accepts]: Start accepts. Automaton has 80839 states and 310967 transitions. Word has length 60 [2021-06-05 09:23:15,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:23:15,865 INFO L482 AbstractCegarLoop]: Abstraction has 80839 states and 310967 transitions. [2021-06-05 09:23:15,865 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 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 09:23:15,866 INFO L276 IsEmpty]: Start isEmpty. Operand 80839 states and 310967 transitions. [2021-06-05 09:23:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:23:15,921 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:23:15,921 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:23:16,122 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable129 [2021-06-05 09:23:16,122 INFO L430 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:23:16,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:23:16,122 INFO L82 PathProgramCache]: Analyzing trace with hash -430256872, now seen corresponding path program 7 times [2021-06-05 09:23:16,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:23:16,123 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099109501] [2021-06-05 09:23:16,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:23:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:23:16,265 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 09:23:16,266 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:23:16,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099109501] [2021-06-05 09:23:16,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099109501] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:23:16,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870570330] [2021-06-05 09:23:16,266 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:23:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:23:16,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 09:23:16,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:23:16,353 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 09:23:16,354 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:16,358 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:16,358 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:23:16,358 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:23:16,390 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:23:16,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2021-06-05 09:23:16,391 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:16,397 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:16,398 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:23:16,398 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2021-06-05 09:23:16,575 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 09:23:16,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 33 [2021-06-05 09:23:16,577 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:16,589 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:16,590 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:23:16,590 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:37 [2021-06-05 09:23:16,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:23:16,639 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:16,650 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:16,651 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 09:23:16,652 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:41 [2021-06-05 09:23:16,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 09:23:16,704 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:16,717 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:16,720 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:23:16,720 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:41 [2021-06-05 09:23:16,778 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 09:23:16,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 25 [2021-06-05 09:23:16,780 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:16,791 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:16,793 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:23:16,793 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:18 [2021-06-05 09:23:16,823 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 09:23:16,824 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:23:16,836 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:23:16,840 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 09:23:16,840 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:50 [2021-06-05 09:23:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 09:23:16,892 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870570330] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:23:16,892 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:23:16,892 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2021-06-05 09:23:16,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087406253] [2021-06-05 09:23:16,892 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 09:23:16,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:23:16,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 09:23:16,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:23:16,893 INFO L87 Difference]: Start difference. First operand 80839 states and 310967 transitions. Second operand has 20 states, 20 states have (on average 4.05) internal successors, (81), 20 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2021-06-05 09:23:37,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 09:23:37,817 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,74 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:23:37,817 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 09:23:37,818 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT (1/2) [2021-06-05 09:23:37,819 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 09:23:37,819 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 09:23:37,819 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 09:23:37,819 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 09:23:37,819 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 09:23:37,819 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 09:23:37,819 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 09:23:37,819 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 09:23:37,819 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 09:23:37,821 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 105 transitions, 231 flow [2021-06-05 09:23:37,821 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 09:23:37,821 INFO L315 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2021-06-05 09:23:37,821 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2021-06-05 09:23:37,823 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 09:23:37,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 09:23:37 BasicIcfg [2021-06-05 09:23:37,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 09:23:37,824 INFO L168 Benchmark]: Toolchain (without parser) took 639960.43 ms. Allocated memory was 354.4 MB in the beginning and 16.0 GB in the end (delta: 15.6 GB). Free memory was 316.3 MB in the beginning and 8.1 GB in the end (delta: -7.8 GB). Peak memory consumption was 7.8 GB. Max. memory is 16.0 GB. [2021-06-05 09:23:37,824 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 354.4 MB. Free memory was 334.5 MB in the beginning and 334.5 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 09:23:37,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 475.62 ms. Allocated memory is still 354.4 MB. Free memory was 316.1 MB in the beginning and 317.1 MB in the end (delta: -1.0 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.0 GB. [2021-06-05 09:23:37,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.23 ms. Allocated memory is still 354.4 MB. Free memory was 317.1 MB in the beginning and 314.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 09:23:37,825 INFO L168 Benchmark]: Boogie Preprocessor took 21.38 ms. Allocated memory is still 354.4 MB. Free memory was 314.4 MB in the beginning and 312.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 09:23:37,825 INFO L168 Benchmark]: RCFGBuilder took 777.49 ms. Allocated memory is still 354.4 MB. Free memory was 312.9 MB in the beginning and 267.8 MB in the end (delta: 45.1 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.0 GB. [2021-06-05 09:23:37,825 INFO L168 Benchmark]: TraceAbstraction took 638645.00 ms. Allocated memory was 354.4 MB in the beginning and 16.0 GB in the end (delta: 15.6 GB). Free memory was 267.8 MB in the beginning and 8.1 GB in the end (delta: -7.9 GB). Peak memory consumption was 7.8 GB. Max. memory is 16.0 GB. [2021-06-05 09:23:37,825 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.13 ms. Allocated memory is still 354.4 MB. Free memory was 334.5 MB in the beginning and 334.5 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 475.62 ms. Allocated memory is still 354.4 MB. Free memory was 316.1 MB in the beginning and 317.1 MB in the end (delta: -1.0 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 35.23 ms. Allocated memory is still 354.4 MB. Free memory was 317.1 MB in the beginning and 314.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 21.38 ms. Allocated memory is still 354.4 MB. Free memory was 314.4 MB in the beginning and 312.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 777.49 ms. Allocated memory is still 354.4 MB. Free memory was 312.9 MB in the beginning and 267.8 MB in the end (delta: 45.1 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 638645.00 ms. Allocated memory was 354.4 MB in the beginning and 16.0 GB in the end (delta: 15.6 GB). Free memory was 267.8 MB in the beginning and 8.1 GB in the end (delta: -7.9 GB). Peak memory consumption was 7.8 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (80839states) and FLOYD_HOARE automaton (currently 14 states, 20 states before enhancement),while ReachableStatesComputation was computing reachable states (6682 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (80839states) and FLOYD_HOARE automaton (currently 14 states, 20 states before enhancement),while ReachableStatesComputation was computing reachable states (6682 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 725]: 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 103 places, 105 transitions, 231 flow. Already constructed 2 states. Currently 1 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 81 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1080.2ms, OverallIterations: 4, TraceHistogramMax: 2, EmptinessCheckTime: 13.5ms, AutomataDifference: 243.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 53.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 274 SDtfs, 168 SDslu, 236 SDs, 0 SdLazy, 84 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 101.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 120.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=622occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 79.6ms AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 18.4ms SsaConstructionTime, 142.0ms SatisfiabilityAnalysisTime, 392.3ms InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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, 97 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 37278.0ms, OverallIterations: 42, TraceHistogramMax: 3, EmptinessCheckTime: 236.5ms, AutomataDifference: 12335.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 396.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5730 SDtfs, 8295 SDslu, 25467 SDs, 0 SdLazy, 14025 SolverSat, 726 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7752.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2035 GetRequests, 1542 SyntacticMatches, 29 SemanticMatches, 464 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 5889.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9822occurred in iteration=0, InterpolantAutomatonStates: 425, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2931.0ms AutomataMinimizationTime, 42 MinimizatonAttempts, 5197 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 463.0ms SsaConstructionTime, 1225.4ms SatisfiabilityAnalysisTime, 11576.8ms InterpolantComputationTime, 3848 NumberOfCodeBlocks, 3758 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 3776 ConstructedInterpolants, 72 QuantifiedInterpolants, 31452 SizeOfPredicates, 338 NumberOfNonLiveVariables, 5233 ConjunctsInSsa, 912 ConjunctsInUnsatCore, 72 InterpolantComputations, 15 PerfectInterpolantSequences, 375/929 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 3 thread instances CFG has 5 procedures, 113 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 599781.7ms, OverallIterations: 83, TraceHistogramMax: 4, EmptinessCheckTime: 3711.0ms, AutomataDifference: 191409.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 40035.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 17425 SDtfs, 27858 SDslu, 76310 SDs, 0 SdLazy, 43354 SolverSat, 2243 SolverUnsat, 22 SolverUnknown, 0 SolverNotchecked, 69728.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3312 GetRequests, 2344 SyntacticMatches, 31 SemanticMatches, 937 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2252 ImplicationChecksByTransitivity, 13821.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=157022occurred in iteration=0, InterpolantAutomatonStates: 850, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 328293.9ms AutomataMinimizationTime, 82 MinimizatonAttempts, 819164 StatesRemovedByMinimization, 78 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 588.1ms SsaConstructionTime, 1331.9ms SatisfiabilityAnalysisTime, 22760.6ms InterpolantComputationTime, 6940 NumberOfCodeBlocks, 6579 NumberOfCodeBlocksAsserted, 145 NumberOfCheckSat, 6814 ConstructedInterpolants, 176 QuantifiedInterpolants, 54220 SizeOfPredicates, 553 NumberOfNonLiveVariables, 7134 ConjunctsInSsa, 1386 ConjunctsInUnsatCore, 126 InterpolantComputations, 51 PerfectInterpolantSequences, 1284/2264 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, 81 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 64.9ms, OverallIterations: 1, TraceHistogramMax: 2, EmptinessCheckTime: 6.2ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=622occurred 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: 3.0ms SsaConstructionTime, 5.0ms SatisfiabilityAnalysisTime, 0.0ms InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 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, 97 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 261.1ms, OverallIterations: 1, TraceHistogramMax: 3, EmptinessCheckTime: 16.9ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 228.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9822occurred 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: 0.6ms SsaConstructionTime, 2.8ms SatisfiabilityAnalysisTime, 0.0ms InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 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 3 thread instances CFG has 5 procedures, 113 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 2.2ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.7ms, 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