/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/10_fmaxsym_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 08:19:01,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 08:19:01,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 08:19:01,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 08:19:01,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 08:19:01,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 08:19:01,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 08:19:01,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 08:19:01,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 08:19:01,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 08:19:01,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 08:19:01,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 08:19:01,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 08:19:01,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 08:19:01,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 08:19:01,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 08:19:01,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 08:19:01,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 08:19:01,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 08:19:01,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 08:19:01,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 08:19:01,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 08:19:01,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 08:19:01,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 08:19:01,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 08:19:01,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 08:19:01,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 08:19:01,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 08:19:01,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 08:19:01,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 08:19:01,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 08:19:01,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 08:19:01,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 08:19:01,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 08:19:01,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 08:19:01,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 08:19:01,998 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 08:19:01,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 08:19:01,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 08:19:01,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 08:19:01,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 08:19:02,002 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 08:19:02,025 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 08:19:02,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 08:19:02,025 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 08:19:02,025 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 08:19:02,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 08:19:02,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 08:19:02,027 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 08:19:02,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 08:19:02,028 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 08:19:02,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 08:19:02,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 08:19:02,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 08:19:02,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 08:19:02,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 08:19:02,028 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 08:19:02,029 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 08:19:02,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 08:19:02,029 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 08:19:02,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 08:19:02,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 08:19:02,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 08:19:02,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 08:19:02,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 08:19:02,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 08:19:02,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 08:19:02,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 08:19:02,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 08:19:02,030 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 08:19:02,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 08:19:02,030 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 08:19:02,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 08:19:02,030 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 08:19:02,030 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 08:19:02,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 08:19:02,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 08:19:02,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 08:19:02,287 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 08:19:02,288 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 08:19:02,288 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/10_fmaxsym_cas.i [2021-06-05 08:19:02,332 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86d84d167/9c1a8163cc4c4dedbcbe0eafc5a7aba2/FLAGe7a688f8e [2021-06-05 08:19:02,746 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 08:19:02,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/10_fmaxsym_cas.i [2021-06-05 08:19:02,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86d84d167/9c1a8163cc4c4dedbcbe0eafc5a7aba2/FLAGe7a688f8e [2021-06-05 08:19:03,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86d84d167/9c1a8163cc4c4dedbcbe0eafc5a7aba2 [2021-06-05 08:19:03,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 08:19:03,108 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 08:19:03,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 08:19:03,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 08:19:03,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 08:19:03,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 08:19:03" (1/1) ... [2021-06-05 08:19:03,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@741e04f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:19:03, skipping insertion in model container [2021-06-05 08:19:03,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 08:19:03" (1/1) ... [2021-06-05 08:19:03,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 08:19:03,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 08:19:03,344 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/10_fmaxsym_cas.i[30467,30480] [2021-06-05 08:19:03,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 08:19:03,356 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 08:19:03,378 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/10_fmaxsym_cas.i[30467,30480] [2021-06-05 08:19:03,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 08:19:03,420 INFO L208 MainTranslator]: Completed translation [2021-06-05 08:19:03,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:19:03 WrapperNode [2021-06-05 08:19:03,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 08:19:03,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 08:19:03,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 08:19:03,422 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 08:19:03,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:19:03" (1/1) ... [2021-06-05 08:19:03,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:19:03" (1/1) ... [2021-06-05 08:19:03,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 08:19:03,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 08:19:03,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 08:19:03,447 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 08:19:03,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:19:03" (1/1) ... [2021-06-05 08:19:03,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:19:03" (1/1) ... [2021-06-05 08:19:03,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:19:03" (1/1) ... [2021-06-05 08:19:03,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:19:03" (1/1) ... [2021-06-05 08:19:03,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:19:03" (1/1) ... [2021-06-05 08:19:03,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:19:03" (1/1) ... [2021-06-05 08:19:03,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:19:03" (1/1) ... [2021-06-05 08:19:03,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 08:19:03,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 08:19:03,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 08:19:03,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 08:19:03,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:19:03" (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 08:19:03,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 08:19:03,540 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2021-06-05 08:19:03,541 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2021-06-05 08:19:03,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 08:19:03,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 08:19:03,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 08:19:03,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 08:19:03,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 08:19:03,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 08:19:03,544 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 08:19:03,871 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 08:19:03,871 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-06-05 08:19:03,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 08:19:03 BoogieIcfgContainer [2021-06-05 08:19:03,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 08:19:03,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 08:19:03,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 08:19:03,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 08:19:03,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 08:19:03" (1/3) ... [2021-06-05 08:19:03,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e816158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 08:19:03, skipping insertion in model container [2021-06-05 08:19:03,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:19:03" (2/3) ... [2021-06-05 08:19:03,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e816158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 08:19:03, skipping insertion in model container [2021-06-05 08:19:03,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 08:19:03" (3/3) ... [2021-06-05 08:19:03,877 INFO L111 eAbstractionObserver]: Analyzing ICFG 10_fmaxsym_cas.i [2021-06-05 08:19:03,881 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 08:19:03,881 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 08:19:03,881 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 08:19:03,881 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 08:19:03,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,901 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 08:19:03,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,901 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 08:19:03,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,902 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 08:19:03,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,902 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 08:19:03,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,903 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,904 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,904 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,905 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,905 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,906 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,906 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,907 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,907 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,907 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,908 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,908 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,909 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,909 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,910 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,910 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,911 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,913 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,913 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~u| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,915 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~e| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,915 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,915 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,915 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,915 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~u| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~e| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,917 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,920 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,920 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~e| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,920 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,920 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,920 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,920 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~u| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,921 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,921 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 08:19:03,921 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,922 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,922 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,923 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,923 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:03,924 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 08:19:03,939 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 08:19:03,951 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:19:03,951 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:19:03,951 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:19:03,951 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:19:03,951 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:19:03,951 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:19:03,951 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:19:03,951 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 08:19:03,957 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 86 transitions, 177 flow [2021-06-05 08:19:03,980 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 627 states, 622 states have (on average 2.117363344051447) internal successors, (1317), 626 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:03,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 627 states, 622 states have (on average 2.117363344051447) internal successors, (1317), 626 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:03,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-06-05 08:19:03,994 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:03,995 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:03,995 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:03,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:03,999 INFO L82 PathProgramCache]: Analyzing trace with hash -997779530, now seen corresponding path program 1 times [2021-06-05 08:19:04,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:04,004 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007205336] [2021-06-05 08:19:04,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:04,195 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 08:19:04,195 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:04,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007205336] [2021-06-05 08:19:04,196 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007205336] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:19:04,196 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:19:04,196 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 08:19:04,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960739411] [2021-06-05 08:19:04,200 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 08:19:04,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:04,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 08:19:04,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 08:19:04,213 INFO L87 Difference]: Start difference. First operand has 627 states, 622 states have (on average 2.117363344051447) internal successors, (1317), 626 states have internal predecessors, (1317), 0 states have call successors, (0), 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 24.5) internal successors, (49), 2 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 08:19:04,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:04,240 INFO L93 Difference]: Finished difference Result 384 states and 715 transitions. [2021-06-05 08:19:04,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 08:19:04,241 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 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 49 [2021-06-05 08:19:04,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:04,250 INFO L225 Difference]: With dead ends: 384 [2021-06-05 08:19:04,250 INFO L226 Difference]: Without dead ends: 336 [2021-06-05 08:19:04,251 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 08:19:04,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-06-05 08:19:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2021-06-05 08:19:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 1.8656716417910448) internal successors, (625), 335 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 625 transitions. [2021-06-05 08:19:04,304 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 625 transitions. Word has length 49 [2021-06-05 08:19:04,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:04,304 INFO L482 AbstractCegarLoop]: Abstraction has 336 states and 625 transitions. [2021-06-05 08:19:04,304 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 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 08:19:04,304 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 625 transitions. [2021-06-05 08:19:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 08:19:04,310 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:04,310 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:04,310 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 08:19:04,311 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:04,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:04,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1971612544, now seen corresponding path program 1 times [2021-06-05 08:19:04,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:04,315 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886453022] [2021-06-05 08:19:04,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:04,395 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 08:19:04,396 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:04,396 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886453022] [2021-06-05 08:19:04,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886453022] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:19:04,396 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:19:04,396 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:19:04,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372336102] [2021-06-05 08:19:04,397 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:19:04,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:04,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:19:04,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:19:04,398 INFO L87 Difference]: Start difference. First operand 336 states and 625 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:04,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:04,505 INFO L93 Difference]: Finished difference Result 450 states and 837 transitions. [2021-06-05 08:19:04,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 08:19:04,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-06-05 08:19:04,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:04,508 INFO L225 Difference]: With dead ends: 450 [2021-06-05 08:19:04,508 INFO L226 Difference]: Without dead ends: 450 [2021-06-05 08:19:04,508 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.4ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 08:19:04,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-06-05 08:19:04,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 358. [2021-06-05 08:19:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 1.865546218487395) internal successors, (666), 357 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 666 transitions. [2021-06-05 08:19:04,518 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 666 transitions. Word has length 53 [2021-06-05 08:19:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:04,518 INFO L482 AbstractCegarLoop]: Abstraction has 358 states and 666 transitions. [2021-06-05 08:19:04,518 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:04,518 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 666 transitions. [2021-06-05 08:19:04,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 08:19:04,519 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:04,519 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:04,519 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 08:19:04,519 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:04,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:04,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1322713437, now seen corresponding path program 1 times [2021-06-05 08:19:04,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:04,520 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852848622] [2021-06-05 08:19:04,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:04,689 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 08:19:04,690 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:04,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852848622] [2021-06-05 08:19:04,690 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852848622] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:19:04,690 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:19:04,690 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 08:19:04,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135868942] [2021-06-05 08:19:04,691 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 08:19:04,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:04,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 08:19:04,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 08:19:04,691 INFO L87 Difference]: Start difference. First operand 358 states and 666 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 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 08:19:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:05,061 INFO L93 Difference]: Finished difference Result 632 states and 1158 transitions. [2021-06-05 08:19:05,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 08:19:05,061 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 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 57 [2021-06-05 08:19:05,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:05,063 INFO L225 Difference]: With dead ends: 632 [2021-06-05 08:19:05,063 INFO L226 Difference]: Without dead ends: 442 [2021-06-05 08:19:05,064 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 271.0ms TimeCoverageRelationStatistics Valid=241, Invalid=571, Unknown=0, NotChecked=0, Total=812 [2021-06-05 08:19:05,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2021-06-05 08:19:05,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 292. [2021-06-05 08:19:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.8144329896907216) internal successors, (528), 291 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:05,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 528 transitions. [2021-06-05 08:19:05,071 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 528 transitions. Word has length 57 [2021-06-05 08:19:05,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:05,072 INFO L482 AbstractCegarLoop]: Abstraction has 292 states and 528 transitions. [2021-06-05 08:19:05,073 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 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 08:19:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 528 transitions. [2021-06-05 08:19:05,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 08:19:05,073 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:05,075 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:05,075 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 08:19:05,075 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:05,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:05,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1474822981, now seen corresponding path program 1 times [2021-06-05 08:19:05,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:05,081 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591353709] [2021-06-05 08:19:05,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:05,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:19:05,294 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:05,294 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591353709] [2021-06-05 08:19:05,294 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591353709] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:19:05,295 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430178740] [2021-06-05 08:19:05,295 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 08:19:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:05,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 08:19:05,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:19:05,580 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 08:19:05,582 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:05,587 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:05,589 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 08:19:05,589 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2021-06-05 08:19:05,767 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-06-05 08:19:05,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2021-06-05 08:19:05,793 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:05,818 INFO L628 ElimStorePlain]: treesize reduction 10, result has 76.7 percent of original size [2021-06-05 08:19:05,822 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 08:19:05,822 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:21 [2021-06-05 08:19:05,881 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 15 treesize of output 7 [2021-06-05 08:19:05,883 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:05,884 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:05,885 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 08:19:05,885 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:19:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:19:05,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430178740] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:19:05,887 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:19:05,888 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2021-06-05 08:19:05,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148388319] [2021-06-05 08:19:05,888 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 08:19:05,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:05,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 08:19:05,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-06-05 08:19:05,889 INFO L87 Difference]: Start difference. First operand 292 states and 528 transitions. Second operand has 22 states, 22 states have (on average 4.409090909090909) internal successors, (97), 22 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:07,175 INFO L93 Difference]: Finished difference Result 526 states and 965 transitions. [2021-06-05 08:19:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-06-05 08:19:07,176 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.409090909090909) internal successors, (97), 22 states have internal predecessors, (97), 0 states have call successors, (0), 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 08:19:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:07,177 INFO L225 Difference]: With dead ends: 526 [2021-06-05 08:19:07,177 INFO L226 Difference]: Without dead ends: 514 [2021-06-05 08:19:07,179 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 1094.2ms TimeCoverageRelationStatistics Valid=890, Invalid=3666, Unknown=0, NotChecked=0, Total=4556 [2021-06-05 08:19:07,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-06-05 08:19:07,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 382. [2021-06-05 08:19:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.8346456692913387) internal successors, (699), 381 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:07,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 699 transitions. [2021-06-05 08:19:07,186 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 699 transitions. Word has length 59 [2021-06-05 08:19:07,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:07,186 INFO L482 AbstractCegarLoop]: Abstraction has 382 states and 699 transitions. [2021-06-05 08:19:07,186 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 4.409090909090909) internal successors, (97), 22 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 699 transitions. [2021-06-05 08:19:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 08:19:07,187 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:07,187 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:07,402 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:19:07,403 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:07,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:07,403 INFO L82 PathProgramCache]: Analyzing trace with hash 2084135318, now seen corresponding path program 1 times [2021-06-05 08:19:07,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:07,403 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714967602] [2021-06-05 08:19:07,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:19:07,642 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:07,642 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714967602] [2021-06-05 08:19:07,642 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714967602] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:19:07,642 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613154050] [2021-06-05 08:19:07,642 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 08:19:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:07,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 43 conjunts are in the unsatisfiable core [2021-06-05 08:19:07,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:19:07,720 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 08:19:07,721 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:07,723 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:07,723 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:19:07,723 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:19:07,752 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:19:07,753 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 08:19:07,754 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:07,758 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:07,761 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 08:19:07,762 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:19:07,880 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:19:07,880 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 08:19:07,882 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:07,889 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:07,892 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 08:19:07,892 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:31 [2021-06-05 08:19:08,342 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:19:08,343 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 08:19:08,345 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:08,353 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:08,354 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 08:19:08,354 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:19 [2021-06-05 08:19:08,407 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 08:19:08,408 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:08,427 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:08,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 08:19:08,433 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:08,463 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:08,464 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:19:08,464 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:60 [2021-06-05 08:19:08,520 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 08:19:08,522 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:08,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-06-05 08:19:08,532 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:08,551 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:08,553 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:19:08,553 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:44 [2021-06-05 08:19:08,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:19:08,673 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:08,677 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:08,678 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 08:19:08,678 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2021-06-05 08:19:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:19:08,695 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613154050] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:19:08,695 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:19:08,695 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2021-06-05 08:19:08,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388554892] [2021-06-05 08:19:08,695 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 08:19:08,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:08,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 08:19:08,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:19:08,696 INFO L87 Difference]: Start difference. First operand 382 states and 699 transitions. Second operand has 25 states, 25 states have (on average 4.56) internal successors, (114), 25 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:09,541 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2021-06-05 08:19:09,716 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2021-06-05 08:19:09,960 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2021-06-05 08:19:10,109 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2021-06-05 08:19:10,386 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2021-06-05 08:19:10,533 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2021-06-05 08:19:10,676 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2021-06-05 08:19:10,870 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2021-06-05 08:19:10,997 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2021-06-05 08:19:11,140 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2021-06-05 08:19:11,277 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2021-06-05 08:19:11,546 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2021-06-05 08:19:11,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:11,581 INFO L93 Difference]: Finished difference Result 580 states and 1051 transitions. [2021-06-05 08:19:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 08:19:11,581 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.56) internal successors, (114), 25 states have internal predecessors, (114), 0 states have call successors, (0), 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 63 [2021-06-05 08:19:11,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:11,583 INFO L225 Difference]: With dead ends: 580 [2021-06-05 08:19:11,583 INFO L226 Difference]: Without dead ends: 552 [2021-06-05 08:19:11,584 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 2984.6ms TimeCoverageRelationStatistics Valid=625, Invalid=1631, Unknown=0, NotChecked=0, Total=2256 [2021-06-05 08:19:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2021-06-05 08:19:11,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 382. [2021-06-05 08:19:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.8241469816272966) internal successors, (695), 381 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 695 transitions. [2021-06-05 08:19:11,590 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 695 transitions. Word has length 63 [2021-06-05 08:19:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:11,591 INFO L482 AbstractCegarLoop]: Abstraction has 382 states and 695 transitions. [2021-06-05 08:19:11,591 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 4.56) internal successors, (114), 25 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 695 transitions. [2021-06-05 08:19:11,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-05 08:19:11,591 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:11,592 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:11,802 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:19:11,802 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:11,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:11,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1983120084, now seen corresponding path program 1 times [2021-06-05 08:19:11,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:11,803 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494016727] [2021-06-05 08:19:11,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:19:11,995 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:11,996 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494016727] [2021-06-05 08:19:11,996 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494016727] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:19:11,996 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998628537] [2021-06-05 08:19:11,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:19:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:12,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 08:19:12,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:19:12,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:19:12,088 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:12,089 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:12,089 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:19:12,089 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 08:19:12,103 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:19:12,103 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 08:19:12,105 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:12,108 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:12,109 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 08:19:12,109 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2021-06-05 08:19:12,168 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:19:12,168 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 08:19:12,170 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:12,172 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:12,173 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 08:19:12,173 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2021-06-05 08:19:12,235 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:19:12,236 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 1 case distinctions, treesize of input 27 treesize of output 23 [2021-06-05 08:19:12,237 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:12,250 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:12,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, 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 08:19:12,254 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:12,266 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:12,268 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:19:12,268 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:31 [2021-06-05 08:19:12,446 INFO L354 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2021-06-05 08:19:12,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 08:19:12,448 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:12,455 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:12,457 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:19:12,457 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:30, output treesize:7 [2021-06-05 08:19:12,465 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 15 treesize of output 7 [2021-06-05 08:19:12,466 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:12,467 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:12,467 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 08:19:12,468 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2021-06-05 08:19:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:19:12,470 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998628537] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:19:12,470 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:19:12,470 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 22 [2021-06-05 08:19:12,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840673575] [2021-06-05 08:19:12,470 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 08:19:12,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:12,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 08:19:12,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2021-06-05 08:19:12,471 INFO L87 Difference]: Start difference. First operand 382 states and 695 transitions. Second operand has 22 states, 22 states have (on average 6.045454545454546) internal successors, (133), 22 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:13,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:13,296 INFO L93 Difference]: Finished difference Result 504 states and 921 transitions. [2021-06-05 08:19:13,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 08:19:13,296 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.045454545454546) internal successors, (133), 22 states have internal predecessors, (133), 0 states have call successors, (0), 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 78 [2021-06-05 08:19:13,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:13,296 INFO L225 Difference]: With dead ends: 504 [2021-06-05 08:19:13,296 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 08:19:13,297 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 791.1ms TimeCoverageRelationStatistics Valid=393, Invalid=1167, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 08:19:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 08:19:13,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 08:19:13,297 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 08:19:13,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 08:19:13,298 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2021-06-05 08:19:13,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:13,298 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 08:19:13,298 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 6.045454545454546) internal successors, (133), 22 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 08:19:13,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 08:19:13,508 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 08:19:13,509 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 08:19:13,510 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 08:19:13,511 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:19:13,511 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:19:13,511 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:19:13,511 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:19:13,511 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:19:13,511 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:19:13,511 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:19:13,511 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 08:19:13,512 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 86 transitions, 177 flow [2021-06-05 08:19:13,523 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 627 states, 622 states have (on average 2.117363344051447) internal successors, (1317), 626 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:13,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 627 states, 622 states have (on average 2.117363344051447) internal successors, (1317), 626 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:13,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-05 08:19:13,524 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:13,525 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:13,525 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 08:19:13,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:13,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1090126716, now seen corresponding path program 1 times [2021-06-05 08:19:13,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:13,525 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361786806] [2021-06-05 08:19:13,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 08:19:13,536 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 08:19:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 08:19:13,542 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 08:19:13,560 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 08:19:13,560 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 08:19:13,560 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 08:19:13,560 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 08:19:13,561 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 08:19:13,561 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 08:19:13,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,573 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,573 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,574 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,574 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 08:19:13,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,574 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 08:19:13,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,574 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 08:19:13,574 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 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 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,575 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,576 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,577 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,577 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,578 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,578 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,579 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,579 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,580 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,580 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,581 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,582 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,583 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~u| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~e| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~u| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~e| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,585 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,586 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,586 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,587 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,587 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 08:19:13,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,587 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 08:19:13,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,587 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 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 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 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 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,588 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,589 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,590 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,593 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,593 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,594 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,595 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,596 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~u| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~e| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,597 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~u| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~e| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,598 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,599 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,601 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~e| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~u| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,602 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 08:19:13,602 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,602 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,603 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,603 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,604 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~u| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~e| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,605 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,605 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,605 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 08:19:13,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,606 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,606 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:19:13,607 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 08:19:13,608 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 08:19:13,608 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:19:13,608 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:19:13,608 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:19:13,608 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:19:13,608 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:19:13,608 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:19:13,608 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:19:13,608 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 08:19:13,613 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 128 places, 140 transitions, 292 flow [2021-06-05 08:19:15,284 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 28089 states, 28078 states have (on average 3.282285063038678) internal successors, (92160), 28088 states have internal predecessors, (92160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:15,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 28089 states, 28078 states have (on average 3.282285063038678) internal successors, (92160), 28088 states have internal predecessors, (92160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-06-05 08:19:15,329 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:15,329 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:15,330 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:15,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:15,330 INFO L82 PathProgramCache]: Analyzing trace with hash -850945438, now seen corresponding path program 1 times [2021-06-05 08:19:15,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:15,330 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993539244] [2021-06-05 08:19:15,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:15,356 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 08:19:15,356 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:15,356 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993539244] [2021-06-05 08:19:15,357 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993539244] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:19:15,357 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:19:15,357 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 08:19:15,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692253849] [2021-06-05 08:19:15,357 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 08:19:15,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:15,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 08:19:15,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 08:19:15,392 INFO L87 Difference]: Start difference. First operand has 28089 states, 28078 states have (on average 3.282285063038678) internal successors, (92160), 28088 states have internal predecessors, (92160), 0 states have call successors, (0), 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 24.5) internal successors, (49), 2 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 08:19:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:15,553 INFO L93 Difference]: Finished difference Result 16539 states and 48683 transitions. [2021-06-05 08:19:15,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 08:19:15,554 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 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 49 [2021-06-05 08:19:15,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:15,622 INFO L225 Difference]: With dead ends: 16539 [2021-06-05 08:19:15,622 INFO L226 Difference]: Without dead ends: 16251 [2021-06-05 08:19:15,622 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 08:19:15,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16251 states. [2021-06-05 08:19:16,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16251 to 16251. [2021-06-05 08:19:16,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16251 states, 16246 states have (on average 2.9456481595469652) internal successors, (47855), 16250 states have internal predecessors, (47855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:16,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16251 states to 16251 states and 47855 transitions. [2021-06-05 08:19:16,191 INFO L78 Accepts]: Start accepts. Automaton has 16251 states and 47855 transitions. Word has length 49 [2021-06-05 08:19:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:16,191 INFO L482 AbstractCegarLoop]: Abstraction has 16251 states and 47855 transitions. [2021-06-05 08:19:16,191 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 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 08:19:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 16251 states and 47855 transitions. [2021-06-05 08:19:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 08:19:16,195 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:16,195 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:16,195 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 08:19:16,196 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:16,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:16,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1342595180, now seen corresponding path program 1 times [2021-06-05 08:19:16,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:16,196 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129334501] [2021-06-05 08:19:16,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:16,236 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 08:19:16,237 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:16,237 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129334501] [2021-06-05 08:19:16,237 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129334501] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:19:16,237 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:19:16,237 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:19:16,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855891916] [2021-06-05 08:19:16,237 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:19:16,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:16,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:19:16,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:19:16,238 INFO L87 Difference]: Start difference. First operand 16251 states and 47855 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:16,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:16,514 INFO L93 Difference]: Finished difference Result 24422 states and 71961 transitions. [2021-06-05 08:19:16,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 08:19:16,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-06-05 08:19:16,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:16,563 INFO L225 Difference]: With dead ends: 24422 [2021-06-05 08:19:16,564 INFO L226 Difference]: Without dead ends: 24422 [2021-06-05 08:19:16,564 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 21.6ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 08:19:16,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24422 states. [2021-06-05 08:19:16,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24422 to 18068. [2021-06-05 08:19:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18068 states, 18063 states have (on average 2.9621325361235673) internal successors, (53505), 18067 states have internal predecessors, (53505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18068 states to 18068 states and 53505 transitions. [2021-06-05 08:19:17,049 INFO L78 Accepts]: Start accepts. Automaton has 18068 states and 53505 transitions. Word has length 53 [2021-06-05 08:19:17,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:17,049 INFO L482 AbstractCegarLoop]: Abstraction has 18068 states and 53505 transitions. [2021-06-05 08:19:17,049 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 18068 states and 53505 transitions. [2021-06-05 08:19:17,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 08:19:17,055 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:17,055 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:17,056 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 08:19:17,056 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:17,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:17,056 INFO L82 PathProgramCache]: Analyzing trace with hash -555137585, now seen corresponding path program 1 times [2021-06-05 08:19:17,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:17,056 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084003744] [2021-06-05 08:19:17,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:17,170 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 08:19:17,170 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:17,170 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084003744] [2021-06-05 08:19:17,170 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084003744] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:19:17,170 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:19:17,170 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 08:19:17,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667340240] [2021-06-05 08:19:17,170 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 08:19:17,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:17,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 08:19:17,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 08:19:17,171 INFO L87 Difference]: Start difference. First operand 18068 states and 53505 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 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 08:19:18,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:18,187 INFO L93 Difference]: Finished difference Result 44961 states and 133626 transitions. [2021-06-05 08:19:18,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-06-05 08:19:18,187 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 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 57 [2021-06-05 08:19:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:18,266 INFO L225 Difference]: With dead ends: 44961 [2021-06-05 08:19:18,266 INFO L226 Difference]: Without dead ends: 43971 [2021-06-05 08:19:18,267 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 459.2ms TimeCoverageRelationStatistics Valid=485, Invalid=1585, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 08:19:18,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43971 states. [2021-06-05 08:19:18,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43971 to 22770. [2021-06-05 08:19:19,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22770 states, 22765 states have (on average 2.977421480342631) internal successors, (67781), 22769 states have internal predecessors, (67781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22770 states to 22770 states and 67781 transitions. [2021-06-05 08:19:19,070 INFO L78 Accepts]: Start accepts. Automaton has 22770 states and 67781 transitions. Word has length 57 [2021-06-05 08:19:19,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:19,070 INFO L482 AbstractCegarLoop]: Abstraction has 22770 states and 67781 transitions. [2021-06-05 08:19:19,070 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 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 08:19:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 22770 states and 67781 transitions. [2021-06-05 08:19:19,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 08:19:19,080 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:19,081 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:19,081 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 08:19:19,081 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:19,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:19,081 INFO L82 PathProgramCache]: Analyzing trace with hash -913647539, now seen corresponding path program 1 times [2021-06-05 08:19:19,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:19,081 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939194056] [2021-06-05 08:19:19,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:19:19,194 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:19,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939194056] [2021-06-05 08:19:19,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939194056] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:19:19,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356383258] [2021-06-05 08:19:19,194 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 08:19:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:19,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 08:19:19,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:19:19,355 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 08:19:19,356 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:19,360 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:19,361 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 08:19:19,361 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2021-06-05 08:19:19,470 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-06-05 08:19:19,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2021-06-05 08:19:19,477 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:19,498 INFO L628 ElimStorePlain]: treesize reduction 10, result has 76.7 percent of original size [2021-06-05 08:19:19,499 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 08:19:19,499 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:21 [2021-06-05 08:19:19,556 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 15 treesize of output 7 [2021-06-05 08:19:19,556 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:19,558 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:19,558 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 08:19:19,558 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:19:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:19:19,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356383258] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:19:19,561 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:19:19,561 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2021-06-05 08:19:19,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041414839] [2021-06-05 08:19:19,561 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 08:19:19,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:19,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 08:19:19,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-06-05 08:19:19,562 INFO L87 Difference]: Start difference. First operand 22770 states and 67781 transitions. Second operand has 22 states, 22 states have (on average 4.409090909090909) internal successors, (97), 22 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:21,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:21,592 INFO L93 Difference]: Finished difference Result 51883 states and 152669 transitions. [2021-06-05 08:19:21,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-06-05 08:19:21,593 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.409090909090909) internal successors, (97), 22 states have internal predecessors, (97), 0 states have call successors, (0), 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 08:19:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:21,678 INFO L225 Difference]: With dead ends: 51883 [2021-06-05 08:19:21,678 INFO L226 Difference]: Without dead ends: 51791 [2021-06-05 08:19:21,679 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 1045.0ms TimeCoverageRelationStatistics Valid=958, Invalid=4154, Unknown=0, NotChecked=0, Total=5112 [2021-06-05 08:19:21,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51791 states. [2021-06-05 08:19:22,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51791 to 31603. [2021-06-05 08:19:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31603 states, 31598 states have (on average 3.0214570542439394) internal successors, (95472), 31602 states have internal predecessors, (95472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31603 states to 31603 states and 95472 transitions. [2021-06-05 08:19:22,693 INFO L78 Accepts]: Start accepts. Automaton has 31603 states and 95472 transitions. Word has length 59 [2021-06-05 08:19:22,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:22,694 INFO L482 AbstractCegarLoop]: Abstraction has 31603 states and 95472 transitions. [2021-06-05 08:19:22,694 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 4.409090909090909) internal successors, (97), 22 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:22,694 INFO L276 IsEmpty]: Start isEmpty. Operand 31603 states and 95472 transitions. [2021-06-05 08:19:22,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 08:19:22,703 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:22,703 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:22,919 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:19:22,919 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:22,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:22,920 INFO L82 PathProgramCache]: Analyzing trace with hash 887549233, now seen corresponding path program 1 times [2021-06-05 08:19:22,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:22,920 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963718074] [2021-06-05 08:19:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:19:22,955 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:22,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963718074] [2021-06-05 08:19:22,956 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963718074] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:19:22,956 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:19:22,956 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:19:22,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173874051] [2021-06-05 08:19:22,957 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:19:22,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:22,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:19:22,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:19:22,958 INFO L87 Difference]: Start difference. First operand 31603 states and 95472 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:23,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:23,211 INFO L93 Difference]: Finished difference Result 44959 states and 135286 transitions. [2021-06-05 08:19:23,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 08:19:23,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-06-05 08:19:23,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:23,278 INFO L225 Difference]: With dead ends: 44959 [2021-06-05 08:19:23,278 INFO L226 Difference]: Without dead ends: 44959 [2021-06-05 08:19:23,278 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 24.1ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 08:19:23,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44959 states. [2021-06-05 08:19:24,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44959 to 32817. [2021-06-05 08:19:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32817 states, 32812 states have (on average 3.0222174814092404) internal successors, (99165), 32816 states have internal predecessors, (99165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32817 states to 32817 states and 99165 transitions. [2021-06-05 08:19:24,104 INFO L78 Accepts]: Start accepts. Automaton has 32817 states and 99165 transitions. Word has length 60 [2021-06-05 08:19:24,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:24,105 INFO L482 AbstractCegarLoop]: Abstraction has 32817 states and 99165 transitions. [2021-06-05 08:19:24,105 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:24,105 INFO L276 IsEmpty]: Start isEmpty. Operand 32817 states and 99165 transitions. [2021-06-05 08:19:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 08:19:24,114 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:24,114 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:24,114 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 08:19:24,114 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:24,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:24,115 INFO L82 PathProgramCache]: Analyzing trace with hash 492703070, now seen corresponding path program 1 times [2021-06-05 08:19:24,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:24,115 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662046742] [2021-06-05 08:19:24,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:19:24,266 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:24,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662046742] [2021-06-05 08:19:24,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662046742] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:19:24,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038103419] [2021-06-05 08:19:24,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 08:19:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:24,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 43 conjunts are in the unsatisfiable core [2021-06-05 08:19:24,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:19:24,364 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 08:19:24,364 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:24,367 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:24,367 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:19:24,367 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:19:24,391 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:19:24,392 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 08:19:24,393 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:24,397 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:24,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 08:19:24,398 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:19:24,467 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:19:24,467 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 08:19:24,469 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:24,475 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:24,476 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 08:19:24,476 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:31 [2021-06-05 08:19:24,763 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:19:24,764 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 08:19:24,766 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:24,774 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:24,775 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 08:19:24,775 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:19 [2021-06-05 08:19:24,821 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 08:19:24,821 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:24,842 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:24,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 08:19:24,847 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:24,867 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:24,868 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:19:24,868 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:60 [2021-06-05 08:19:25,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-06-05 08:19:25,048 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:25,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 08:19:25,053 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:25,080 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:25,082 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:19:25,082 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:44 [2021-06-05 08:19:25,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:19:25,228 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:25,231 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:25,232 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 08:19:25,232 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2021-06-05 08:19:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:19:25,250 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038103419] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:19:25,251 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:19:25,251 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2021-06-05 08:19:25,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817926055] [2021-06-05 08:19:25,251 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 08:19:25,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:25,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 08:19:25,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:19:25,252 INFO L87 Difference]: Start difference. First operand 32817 states and 99165 transitions. Second operand has 25 states, 25 states have (on average 4.44) internal successors, (111), 25 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:26,276 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-05 08:19:26,445 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2021-06-05 08:19:26,797 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2021-06-05 08:19:26,926 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2021-06-05 08:19:27,097 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2021-06-05 08:19:27,228 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-06-05 08:19:27,416 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2021-06-05 08:19:27,550 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2021-06-05 08:19:27,776 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-06-05 08:19:27,943 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2021-06-05 08:19:28,122 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2021-06-05 08:19:28,365 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2021-06-05 08:19:28,607 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2021-06-05 08:19:28,840 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2021-06-05 08:19:29,370 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2021-06-05 08:19:29,815 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2021-06-05 08:19:31,071 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2021-06-05 08:19:31,501 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2021-06-05 08:19:32,262 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2021-06-05 08:19:32,539 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-06-05 08:19:32,706 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2021-06-05 08:19:32,907 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2021-06-05 08:19:33,146 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-06-05 08:19:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:34,067 INFO L93 Difference]: Finished difference Result 76416 states and 227603 transitions. [2021-06-05 08:19:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-06-05 08:19:34,067 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.44) internal successors, (111), 25 states have internal predecessors, (111), 0 states have call successors, (0), 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 63 [2021-06-05 08:19:34,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:34,186 INFO L225 Difference]: With dead ends: 76416 [2021-06-05 08:19:34,186 INFO L226 Difference]: Without dead ends: 76208 [2021-06-05 08:19:34,189 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 7366.2ms TimeCoverageRelationStatistics Valid=2267, Invalid=8653, Unknown=0, NotChecked=0, Total=10920 [2021-06-05 08:19:34,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76208 states. [2021-06-05 08:19:35,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76208 to 32868. [2021-06-05 08:19:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32868 states, 32863 states have (on average 3.012689042388096) internal successors, (99006), 32867 states have internal predecessors, (99006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:35,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32868 states to 32868 states and 99006 transitions. [2021-06-05 08:19:35,167 INFO L78 Accepts]: Start accepts. Automaton has 32868 states and 99006 transitions. Word has length 63 [2021-06-05 08:19:35,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:35,167 INFO L482 AbstractCegarLoop]: Abstraction has 32868 states and 99006 transitions. [2021-06-05 08:19:35,167 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 4.44) internal successors, (111), 25 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:35,167 INFO L276 IsEmpty]: Start isEmpty. Operand 32868 states and 99006 transitions. [2021-06-05 08:19:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-06-05 08:19:35,177 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:35,177 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:35,391 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-06-05 08:19:35,392 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:35,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:35,392 INFO L82 PathProgramCache]: Analyzing trace with hash 325255892, now seen corresponding path program 1 times [2021-06-05 08:19:35,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:35,392 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516335673] [2021-06-05 08:19:35,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:19:35,490 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:35,490 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516335673] [2021-06-05 08:19:35,490 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516335673] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:19:35,490 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474568071] [2021-06-05 08:19:35,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:19:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:35,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 08:19:35,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:19:35,589 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 08:19:35,590 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:35,592 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:35,593 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:19:35,593 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:19:35,615 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:19:35,615 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 08:19:35,616 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:35,620 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:35,622 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 08:19:35,622 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:19:35,689 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:19:35,690 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 08:19:35,691 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:35,699 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:35,702 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 08:19:35,702 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:19:35,956 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:19:35,956 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 08:19:35,958 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:35,966 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:35,967 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 08:19:35,967 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:11 [2021-06-05 08:19:36,006 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 08:19:36,007 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:36,021 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:36,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 27 treesize of output 15 [2021-06-05 08:19:36,026 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:36,040 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:36,041 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:19:36,041 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:44 [2021-06-05 08:19:36,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:19:36,162 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:36,165 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:36,166 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 08:19:36,166 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2021-06-05 08:19:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:19:36,182 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474568071] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:19:36,183 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:19:36,183 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2021-06-05 08:19:36,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121067930] [2021-06-05 08:19:36,183 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 08:19:36,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:36,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 08:19:36,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2021-06-05 08:19:36,184 INFO L87 Difference]: Start difference. First operand 32868 states and 99006 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 08:19:37,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:37,481 INFO L93 Difference]: Finished difference Result 46946 states and 140619 transitions. [2021-06-05 08:19:37,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 08:19:37,482 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 64 [2021-06-05 08:19:37,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:37,552 INFO L225 Difference]: With dead ends: 46946 [2021-06-05 08:19:37,552 INFO L226 Difference]: Without dead ends: 46352 [2021-06-05 08:19:37,553 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 926.8ms TimeCoverageRelationStatistics Valid=274, Invalid=1286, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 08:19:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46352 states. [2021-06-05 08:19:38,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46352 to 33178. [2021-06-05 08:19:38,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33178 states, 33173 states have (on average 3.0079582793235464) internal successors, (99783), 33177 states have internal predecessors, (99783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33178 states to 33178 states and 99783 transitions. [2021-06-05 08:19:38,263 INFO L78 Accepts]: Start accepts. Automaton has 33178 states and 99783 transitions. Word has length 64 [2021-06-05 08:19:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:38,263 INFO L482 AbstractCegarLoop]: Abstraction has 33178 states and 99783 transitions. [2021-06-05 08:19:38,263 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 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 08:19:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 33178 states and 99783 transitions. [2021-06-05 08:19:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 08:19:38,274 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:38,274 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:38,474 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:19:38,474 INFO L430 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:38,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:38,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1464750444, now seen corresponding path program 2 times [2021-06-05 08:19:38,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:38,475 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031154827] [2021-06-05 08:19:38,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:38,585 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 08:19:38,585 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:38,585 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031154827] [2021-06-05 08:19:38,585 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031154827] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:19:38,585 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725778267] [2021-06-05 08:19:38,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 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 08:19:38,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:19:38,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:19:38,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 08:19:38,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:19:38,663 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 08:19:38,664 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:38,665 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:38,665 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:19:38,665 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 08:19:38,687 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:19:38,687 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 08:19:38,689 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:38,692 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:38,693 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 08:19:38,693 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2021-06-05 08:19:38,751 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:19:38,752 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 08:19:38,753 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:38,756 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:38,757 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 08:19:38,757 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2021-06-05 08:19:38,828 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 08:19:38,829 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:38,833 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:38,834 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 08:19:38,834 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:7 [2021-06-05 08:19:38,861 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 15 treesize of output 7 [2021-06-05 08:19:38,862 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:38,863 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:38,863 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 08:19:38,863 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2021-06-05 08:19:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:19:38,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725778267] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:19:38,866 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:19:38,866 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 18 [2021-06-05 08:19:38,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514353189] [2021-06-05 08:19:38,866 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 08:19:38,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:38,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 08:19:38,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-06-05 08:19:38,867 INFO L87 Difference]: Start difference. First operand 33178 states and 99783 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:39,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:39,394 INFO L93 Difference]: Finished difference Result 47334 states and 141413 transitions. [2021-06-05 08:19:39,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 08:19:39,396 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-05 08:19:39,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:39,639 INFO L225 Difference]: With dead ends: 47334 [2021-06-05 08:19:39,639 INFO L226 Difference]: Without dead ends: 47252 [2021-06-05 08:19:39,639 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 262.1ms TimeCoverageRelationStatistics Valid=231, Invalid=639, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:19:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47252 states. [2021-06-05 08:19:40,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47252 to 33316. [2021-06-05 08:19:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33316 states, 33311 states have (on average 3.00846567200024) internal successors, (100215), 33315 states have internal predecessors, (100215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33316 states to 33316 states and 100215 transitions. [2021-06-05 08:19:40,368 INFO L78 Accepts]: Start accepts. Automaton has 33316 states and 100215 transitions. Word has length 66 [2021-06-05 08:19:40,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:40,368 INFO L482 AbstractCegarLoop]: Abstraction has 33316 states and 100215 transitions. [2021-06-05 08:19:40,368 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 33316 states and 100215 transitions. [2021-06-05 08:19:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 08:19:40,382 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:40,382 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:40,584 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-06-05 08:19:40,585 INFO L430 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:40,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:40,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1506801859, now seen corresponding path program 2 times [2021-06-05 08:19:40,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:40,586 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159886252] [2021-06-05 08:19:40,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:40,712 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:19:40,712 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:40,712 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159886252] [2021-06-05 08:19:40,712 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159886252] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:19:40,712 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246212805] [2021-06-05 08:19:40,712 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 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 08:19:40,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:19:40,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:19:40,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 38 conjunts are in the unsatisfiable core [2021-06-05 08:19:40,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:19:40,806 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 08:19:40,807 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:40,810 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:40,810 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:19:40,810 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:19:40,839 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:19:40,839 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 08:19:40,840 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:40,845 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:40,846 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 08:19:40,846 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:19:40,922 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:19:40,922 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 08:19:40,923 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:40,931 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:40,933 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 08:19:40,933 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:31 [2021-06-05 08:19:41,161 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:19:41,161 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 08:19:41,163 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:41,172 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:41,173 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 08:19:41,173 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:19 [2021-06-05 08:19:41,235 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 08:19:41,236 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:41,260 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:41,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 08:19:41,266 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:41,289 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:41,290 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:19:41,291 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:60 [2021-06-05 08:19:41,350 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 08:19:41,351 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:41,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-06-05 08:19:41,358 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:41,381 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:41,383 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:19:41,383 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:44 [2021-06-05 08:19:41,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:19:41,494 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:41,497 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:41,498 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 08:19:41,498 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2021-06-05 08:19:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:19:41,515 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246212805] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:19:41,515 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:19:41,515 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 08:19:41,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553961612] [2021-06-05 08:19:41,515 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 08:19:41,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:41,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 08:19:41,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2021-06-05 08:19:41,516 INFO L87 Difference]: Start difference. First operand 33316 states and 100215 transitions. Second operand has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 21 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:41,934 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2021-06-05 08:19:47,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:47,097 INFO L93 Difference]: Finished difference Result 67934 states and 202141 transitions. [2021-06-05 08:19:47,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-06-05 08:19:47,097 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 21 states have internal predecessors, (113), 0 states have call successors, (0), 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 70 [2021-06-05 08:19:47,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:47,189 INFO L225 Difference]: With dead ends: 67934 [2021-06-05 08:19:47,190 INFO L226 Difference]: Without dead ends: 64833 [2021-06-05 08:19:47,191 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2770 ImplicationChecksByTransitivity, 4465.0ms TimeCoverageRelationStatistics Valid=1711, Invalid=6845, Unknown=0, NotChecked=0, Total=8556 [2021-06-05 08:19:47,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64833 states. [2021-06-05 08:19:47,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64833 to 35177. [2021-06-05 08:19:47,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35177 states, 35173 states have (on average 3.0074773263582864) internal successors, (105782), 35176 states have internal predecessors, (105782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:47,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35177 states to 35177 states and 105782 transitions. [2021-06-05 08:19:47,933 INFO L78 Accepts]: Start accepts. Automaton has 35177 states and 105782 transitions. Word has length 70 [2021-06-05 08:19:47,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:47,933 INFO L482 AbstractCegarLoop]: Abstraction has 35177 states and 105782 transitions. [2021-06-05 08:19:47,934 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 21 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 35177 states and 105782 transitions. [2021-06-05 08:19:48,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-05 08:19:48,107 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:48,107 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:48,320 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-06-05 08:19:48,321 INFO L430 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:48,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:48,321 INFO L82 PathProgramCache]: Analyzing trace with hash -564833137, now seen corresponding path program 1 times [2021-06-05 08:19:48,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:48,321 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148588208] [2021-06-05 08:19:48,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:19:48,487 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:48,487 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148588208] [2021-06-05 08:19:48,487 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148588208] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:19:48,487 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339929499] [2021-06-05 08:19:48,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:19:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:48,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 08:19:48,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:19:48,573 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 08:19:48,574 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:48,575 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:48,575 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:19:48,575 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 08:19:48,591 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:19:48,591 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 08:19:48,593 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:48,595 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:48,596 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 08:19:48,596 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2021-06-05 08:19:48,657 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:19:48,657 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 08:19:48,658 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:48,661 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:48,662 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 08:19:48,662 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2021-06-05 08:19:48,726 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:19:48,727 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 1 case distinctions, treesize of input 27 treesize of output 23 [2021-06-05 08:19:48,727 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:48,741 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:48,744 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 08:19:48,745 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:48,758 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:48,760 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:19:48,760 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:31 [2021-06-05 08:19:48,924 INFO L354 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2021-06-05 08:19:48,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 08:19:48,926 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:48,934 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:48,937 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:19:48,937 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:30, output treesize:7 [2021-06-05 08:19:48,946 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 15 treesize of output 7 [2021-06-05 08:19:48,947 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:48,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:48,948 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 08:19:48,948 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2021-06-05 08:19:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:19:48,951 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339929499] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:19:48,951 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:19:48,951 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 22 [2021-06-05 08:19:48,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931763163] [2021-06-05 08:19:48,951 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 08:19:48,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:48,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 08:19:48,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2021-06-05 08:19:48,952 INFO L87 Difference]: Start difference. First operand 35177 states and 105782 transitions. Second operand has 22 states, 22 states have (on average 6.045454545454546) internal successors, (133), 22 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:52,129 INFO L93 Difference]: Finished difference Result 68685 states and 202467 transitions. [2021-06-05 08:19:52,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-06-05 08:19:52,129 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.045454545454546) internal successors, (133), 22 states have internal predecessors, (133), 0 states have call successors, (0), 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 78 [2021-06-05 08:19:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:52,219 INFO L225 Difference]: With dead ends: 68685 [2021-06-05 08:19:52,220 INFO L226 Difference]: Without dead ends: 63551 [2021-06-05 08:19:52,221 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 2068.2ms TimeCoverageRelationStatistics Valid=1283, Invalid=5359, Unknown=0, NotChecked=0, Total=6642 [2021-06-05 08:19:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63551 states. [2021-06-05 08:19:52,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63551 to 23692. [2021-06-05 08:19:52,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23692 states, 23689 states have (on average 2.9795685761323822) internal successors, (70583), 23691 states have internal predecessors, (70583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23692 states to 23692 states and 70583 transitions. [2021-06-05 08:19:52,903 INFO L78 Accepts]: Start accepts. Automaton has 23692 states and 70583 transitions. Word has length 78 [2021-06-05 08:19:52,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:52,903 INFO L482 AbstractCegarLoop]: Abstraction has 23692 states and 70583 transitions. [2021-06-05 08:19:52,903 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 6.045454545454546) internal successors, (133), 22 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:52,903 INFO L276 IsEmpty]: Start isEmpty. Operand 23692 states and 70583 transitions. [2021-06-05 08:19:52,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 08:19:52,919 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:52,919 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:53,119 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:19:53,119 INFO L430 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:53,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:53,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1819126265, now seen corresponding path program 1 times [2021-06-05 08:19:53,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:53,120 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553767716] [2021-06-05 08:19:53,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:19:53,139 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:53,139 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553767716] [2021-06-05 08:19:53,139 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553767716] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:19:53,139 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:19:53,139 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 08:19:53,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873735075] [2021-06-05 08:19:53,139 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 08:19:53,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:53,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 08:19:53,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 08:19:53,140 INFO L87 Difference]: Start difference. First operand 23692 states and 70583 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:53,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:53,256 INFO L93 Difference]: Finished difference Result 38380 states and 115211 transitions. [2021-06-05 08:19:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 08:19:53,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 08:19:53,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:53,311 INFO L225 Difference]: With dead ends: 38380 [2021-06-05 08:19:53,311 INFO L226 Difference]: Without dead ends: 38380 [2021-06-05 08:19:53,312 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 08:19:53,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38380 states. [2021-06-05 08:19:53,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38380 to 23819. [2021-06-05 08:19:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23819 states, 23816 states have (on average 2.9787537789721195) internal successors, (70942), 23818 states have internal predecessors, (70942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23819 states to 23819 states and 70942 transitions. [2021-06-05 08:19:53,877 INFO L78 Accepts]: Start accepts. Automaton has 23819 states and 70942 transitions. Word has length 82 [2021-06-05 08:19:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:53,877 INFO L482 AbstractCegarLoop]: Abstraction has 23819 states and 70942 transitions. [2021-06-05 08:19:53,877 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 23819 states and 70942 transitions. [2021-06-05 08:19:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 08:19:53,892 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:53,892 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:53,892 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-05 08:19:53,892 INFO L430 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:53,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:53,892 INFO L82 PathProgramCache]: Analyzing trace with hash 479081896, now seen corresponding path program 1 times [2021-06-05 08:19:53,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:53,893 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693415695] [2021-06-05 08:19:53,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:19:53,906 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:53,906 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693415695] [2021-06-05 08:19:53,906 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693415695] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:19:53,906 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:19:53,906 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 08:19:53,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962714934] [2021-06-05 08:19:53,907 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 08:19:53,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:53,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 08:19:53,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 08:19:53,907 INFO L87 Difference]: Start difference. First operand 23819 states and 70942 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:54,023 INFO L93 Difference]: Finished difference Result 38549 states and 115840 transitions. [2021-06-05 08:19:54,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 08:19:54,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 08:19:54,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:54,080 INFO L225 Difference]: With dead ends: 38549 [2021-06-05 08:19:54,081 INFO L226 Difference]: Without dead ends: 38549 [2021-06-05 08:19:54,081 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 08:19:54,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38549 states. [2021-06-05 08:19:54,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38549 to 23939. [2021-06-05 08:19:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23939 states, 23936 states have (on average 2.978233622994652) internal successors, (71287), 23938 states have internal predecessors, (71287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:54,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23939 states to 23939 states and 71287 transitions. [2021-06-05 08:19:54,706 INFO L78 Accepts]: Start accepts. Automaton has 23939 states and 71287 transitions. Word has length 82 [2021-06-05 08:19:54,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:54,706 INFO L482 AbstractCegarLoop]: Abstraction has 23939 states and 71287 transitions. [2021-06-05 08:19:54,706 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:54,706 INFO L276 IsEmpty]: Start isEmpty. Operand 23939 states and 71287 transitions. [2021-06-05 08:19:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:19:54,722 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:54,722 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:54,722 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-05 08:19:54,723 INFO L430 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:54,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:54,723 INFO L82 PathProgramCache]: Analyzing trace with hash -947112807, now seen corresponding path program 1 times [2021-06-05 08:19:54,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:54,723 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174157604] [2021-06-05 08:19:54,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:54,913 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2021-06-05 08:19:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:19:54,996 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:54,996 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174157604] [2021-06-05 08:19:54,997 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174157604] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:19:54,997 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691482086] [2021-06-05 08:19:54,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:19:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:55,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 08:19:55,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:19:55,095 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 08:19:55,095 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:55,098 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:55,098 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:19:55,098 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:19:55,146 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:19:55,147 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 08:19:55,148 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:55,153 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:55,155 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 08:19:55,155 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2021-06-05 08:19:55,229 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:19:55,229 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 08:19:55,231 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:55,236 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:55,237 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 08:19:55,237 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 08:19:55,262 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 21 treesize of output 20 [2021-06-05 08:19:55,263 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:55,268 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:55,269 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 08:19:55,269 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:19:55,293 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 21 treesize of output 20 [2021-06-05 08:19:55,294 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:55,299 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:55,300 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 08:19:55,300 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:19:55,557 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:19:55,557 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 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:19:55,559 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:19:55,571 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:55,577 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 08:19:55,577 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:27 [2021-06-05 08:19:55,723 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:19:55,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:19:55,726 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:19:55,738 INFO L628 ElimStorePlain]: treesize reduction 4, result has 81.8 percent of original size [2021-06-05 08:19:55,740 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 08:19:55,740 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2021-06-05 08:19:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:19:55,765 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691482086] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:19:55,765 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:19:55,765 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2021-06-05 08:19:55,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402199569] [2021-06-05 08:19:55,766 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 08:19:55,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:55,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 08:19:55,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2021-06-05 08:19:55,766 INFO L87 Difference]: Start difference. First operand 23939 states and 71287 transitions. Second operand has 31 states, 31 states have (on average 5.064516129032258) internal successors, (157), 31 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:19:58,358 INFO L93 Difference]: Finished difference Result 51916 states and 153920 transitions. [2021-06-05 08:19:58,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-06-05 08:19:58,358 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.064516129032258) internal successors, (157), 31 states have internal predecessors, (157), 0 states have call successors, (0), 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 86 [2021-06-05 08:19:58,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:19:58,432 INFO L225 Difference]: With dead ends: 51916 [2021-06-05 08:19:58,432 INFO L226 Difference]: Without dead ends: 51676 [2021-06-05 08:19:58,433 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1871 ImplicationChecksByTransitivity, 1711.3ms TimeCoverageRelationStatistics Valid=781, Invalid=5225, Unknown=0, NotChecked=0, Total=6006 [2021-06-05 08:19:58,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51676 states. [2021-06-05 08:19:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51676 to 33009. [2021-06-05 08:19:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33009 states, 33006 states have (on average 3.000242380173302) internal successors, (99026), 33008 states have internal predecessors, (99026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33009 states to 33009 states and 99026 transitions. [2021-06-05 08:19:59,130 INFO L78 Accepts]: Start accepts. Automaton has 33009 states and 99026 transitions. Word has length 86 [2021-06-05 08:19:59,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:19:59,131 INFO L482 AbstractCegarLoop]: Abstraction has 33009 states and 99026 transitions. [2021-06-05 08:19:59,131 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 5.064516129032258) internal successors, (157), 31 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:19:59,131 INFO L276 IsEmpty]: Start isEmpty. Operand 33009 states and 99026 transitions. [2021-06-05 08:19:59,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:19:59,153 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:19:59,153 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:19:59,368 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:19:59,369 INFO L430 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:19:59,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:19:59,369 INFO L82 PathProgramCache]: Analyzing trace with hash 147836185, now seen corresponding path program 2 times [2021-06-05 08:19:59,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:19:59,369 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651316918] [2021-06-05 08:19:59,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:19:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:19:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:19:59,486 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:19:59,486 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651316918] [2021-06-05 08:19:59,486 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651316918] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:19:59,487 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:19:59,487 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 08:19:59,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430115647] [2021-06-05 08:19:59,487 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:19:59,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:19:59,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:19:59,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-06-05 08:19:59,488 INFO L87 Difference]: Start difference. First operand 33009 states and 99026 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:20:00,833 INFO L93 Difference]: Finished difference Result 58214 states and 173952 transitions. [2021-06-05 08:20:00,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 08:20:00,833 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:20:00,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:20:00,916 INFO L225 Difference]: With dead ends: 58214 [2021-06-05 08:20:00,917 INFO L226 Difference]: Without dead ends: 58102 [2021-06-05 08:20:00,917 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 426.9ms TimeCoverageRelationStatistics Valid=483, Invalid=1679, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 08:20:01,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58102 states. [2021-06-05 08:20:01,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58102 to 35861. [2021-06-05 08:20:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35861 states, 35858 states have (on average 3.014390094260695) internal successors, (108090), 35860 states have internal predecessors, (108090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35861 states to 35861 states and 108090 transitions. [2021-06-05 08:20:01,884 INFO L78 Accepts]: Start accepts. Automaton has 35861 states and 108090 transitions. Word has length 86 [2021-06-05 08:20:01,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:20:01,884 INFO L482 AbstractCegarLoop]: Abstraction has 35861 states and 108090 transitions. [2021-06-05 08:20:01,884 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 35861 states and 108090 transitions. [2021-06-05 08:20:01,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:20:01,908 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:20:01,908 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:20:01,909 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-06-05 08:20:01,909 INFO L430 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:20:01,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:20:01,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2039549423, now seen corresponding path program 3 times [2021-06-05 08:20:01,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:20:01,909 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728454501] [2021-06-05 08:20:01,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:20:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:20:02,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:20:02,073 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:20:02,073 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728454501] [2021-06-05 08:20:02,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728454501] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:20:02,073 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821992] [2021-06-05 08:20:02,073 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 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 08:20:02,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:20:02,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:20:02,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 40 conjunts are in the unsatisfiable core [2021-06-05 08:20:02,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:20:02,160 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 08:20:02,161 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:02,163 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:02,164 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:20:02,164 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:20:02,189 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:20:02,189 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 08:20:02,191 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:02,195 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:02,196 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 08:20:02,196 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:20:02,262 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:20:02,262 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 08:20:02,264 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:02,271 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:02,274 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 08:20:02,274 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:20:02,682 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:20:02,682 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 08:20:02,684 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:02,691 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:02,692 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 08:20:02,692 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:8 [2021-06-05 08:20:02,876 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 42 treesize of output 21 [2021-06-05 08:20:02,877 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:02,885 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:02,887 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:20:02,887 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:22 [2021-06-05 08:20:02,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:20:02,929 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:02,932 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:02,932 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 08:20:02,933 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-06-05 08:20:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:20:02,944 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821992] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:20:02,944 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:20:02,944 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2021-06-05 08:20:02,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667981945] [2021-06-05 08:20:02,945 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:20:02,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:20:02,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:20:02,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:20:02,945 INFO L87 Difference]: Start difference. First operand 35861 states and 108090 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:20:06,463 INFO L93 Difference]: Finished difference Result 52602 states and 157460 transitions. [2021-06-05 08:20:06,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-05 08:20:06,463 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:20:06,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:20:06,536 INFO L225 Difference]: With dead ends: 52602 [2021-06-05 08:20:06,537 INFO L226 Difference]: Without dead ends: 52518 [2021-06-05 08:20:06,537 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 3017.6ms TimeCoverageRelationStatistics Valid=694, Invalid=2965, Unknown=1, NotChecked=0, Total=3660 [2021-06-05 08:20:06,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52518 states. [2021-06-05 08:20:07,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52518 to 35881. [2021-06-05 08:20:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35881 states, 35878 states have (on average 3.0143542003456156) internal successors, (108149), 35880 states have internal predecessors, (108149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:07,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35881 states to 35881 states and 108149 transitions. [2021-06-05 08:20:07,291 INFO L78 Accepts]: Start accepts. Automaton has 35881 states and 108149 transitions. Word has length 86 [2021-06-05 08:20:07,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:20:07,292 INFO L482 AbstractCegarLoop]: Abstraction has 35881 states and 108149 transitions. [2021-06-05 08:20:07,292 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:07,292 INFO L276 IsEmpty]: Start isEmpty. Operand 35881 states and 108149 transitions. [2021-06-05 08:20:07,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:20:07,313 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:20:07,313 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:20:07,514 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2021-06-05 08:20:07,514 INFO L430 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:20:07,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:20:07,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1086597604, now seen corresponding path program 1 times [2021-06-05 08:20:07,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:20:07,514 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400662076] [2021-06-05 08:20:07,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:20:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:20:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:20:07,734 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:20:07,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400662076] [2021-06-05 08:20:07,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400662076] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:20:07,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251786687] [2021-06-05 08:20:07,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 08:20:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:20:07,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 08:20:07,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:20:07,825 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 08:20:07,826 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:07,828 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:07,829 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:20:07,829 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:20:07,861 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:20:07,861 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 08:20:07,862 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:07,867 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:07,868 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 08:20:07,868 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2021-06-05 08:20:07,934 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:20:07,934 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 08:20:07,935 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:07,941 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:07,941 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 08:20:07,942 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 08:20:07,964 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 21 treesize of output 20 [2021-06-05 08:20:07,965 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:07,970 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:07,971 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 08:20:07,971 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:20:07,998 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 21 treesize of output 20 [2021-06-05 08:20:07,999 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:08,004 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:08,004 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 08:20:08,005 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:20:08,399 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:20:08,399 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 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:20:08,400 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:08,408 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:08,414 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 08:20:08,414 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:27 [2021-06-05 08:20:08,456 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 15 treesize of output 7 [2021-06-05 08:20:08,457 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:08,463 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:20:08,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 08:20:08,464 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:08,473 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:08,474 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:20:08,474 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:19 [2021-06-05 08:20:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:20:08,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251786687] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:20:08,504 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:20:08,504 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2021-06-05 08:20:08,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461440841] [2021-06-05 08:20:08,504 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 08:20:08,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:20:08,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 08:20:08,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:20:08,505 INFO L87 Difference]: Start difference. First operand 35881 states and 108149 transitions. Second operand has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:15,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:20:15,923 INFO L93 Difference]: Finished difference Result 53093 states and 156686 transitions. [2021-06-05 08:20:15,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-05 08:20:15,924 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 08:20:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:20:16,000 INFO L225 Difference]: With dead ends: 53093 [2021-06-05 08:20:16,000 INFO L226 Difference]: Without dead ends: 52943 [2021-06-05 08:20:16,001 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4165 ImplicationChecksByTransitivity, 3222.4ms TimeCoverageRelationStatistics Valid=1700, Invalid=10290, Unknown=0, NotChecked=0, Total=11990 [2021-06-05 08:20:16,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52943 states. [2021-06-05 08:20:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52943 to 36245. [2021-06-05 08:20:16,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36245 states, 36242 states have (on average 3.0129131946360577) internal successors, (109194), 36244 states have internal predecessors, (109194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36245 states to 36245 states and 109194 transitions. [2021-06-05 08:20:16,720 INFO L78 Accepts]: Start accepts. Automaton has 36245 states and 109194 transitions. Word has length 86 [2021-06-05 08:20:16,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:20:16,720 INFO L482 AbstractCegarLoop]: Abstraction has 36245 states and 109194 transitions. [2021-06-05 08:20:16,720 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:16,720 INFO L276 IsEmpty]: Start isEmpty. Operand 36245 states and 109194 transitions. [2021-06-05 08:20:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:20:16,742 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:20:16,742 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:20:16,942 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:20:16,943 INFO L430 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:20:16,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:20:16,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1378985898, now seen corresponding path program 2 times [2021-06-05 08:20:16,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:20:16,943 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324089855] [2021-06-05 08:20:16,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:20:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:20:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:20:17,146 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:20:17,146 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324089855] [2021-06-05 08:20:17,146 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324089855] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:20:17,146 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974085103] [2021-06-05 08:20:17,146 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 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 08:20:17,221 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:20:17,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:20:17,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 08:20:17,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:20:17,234 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 08:20:17,235 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:17,237 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:17,237 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:20:17,238 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:20:17,253 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:20:17,253 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 08:20:17,254 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:17,258 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:17,259 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 08:20:17,259 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:20:17,329 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:20:17,330 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 08:20:17,331 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:17,338 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:17,341 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 08:20:17,341 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:20:17,791 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-06-05 08:20:17,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2021-06-05 08:20:17,794 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:17,806 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:17,810 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:20:17,811 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:48 [2021-06-05 08:20:18,101 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-06-05 08:20:18,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 08:20:18,104 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:18,120 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:18,121 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:20:18,121 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:15 [2021-06-05 08:20:18,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:20:18,301 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:18,305 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 42 treesize of output 21 [2021-06-05 08:20:18,306 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:18,319 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:18,321 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 08:20:18,322 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:45 [2021-06-05 08:20:18,725 WARN L205 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-05 08:20:18,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:20:18,743 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:18,752 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:18,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:20:18,755 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:18,761 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:18,762 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:20:18,762 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:53, output treesize:7 [2021-06-05 08:20:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:20:18,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974085103] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:20:18,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:20:18,777 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 26 [2021-06-05 08:20:18,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038363057] [2021-06-05 08:20:18,778 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:20:18,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:20:18,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:20:18,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:20:18,778 INFO L87 Difference]: Start difference. First operand 36245 states and 109194 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:20,525 WARN L205 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-06-05 08:20:21,371 WARN L205 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 08:20:22,339 WARN L205 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 08:20:23,223 WARN L205 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 08:20:24,084 WARN L205 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 08:20:24,980 WARN L205 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2021-06-05 08:20:25,845 WARN L205 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 08:20:26,733 WARN L205 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 08:20:27,601 WARN L205 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2021-06-05 08:20:28,437 WARN L205 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-06-05 08:20:29,218 WARN L205 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 08:20:30,038 WARN L205 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2021-06-05 08:20:30,926 WARN L205 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-06-05 08:20:31,928 WARN L205 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2021-06-05 08:20:32,828 WARN L205 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 08:20:33,715 WARN L205 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2021-06-05 08:20:33,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:20:33,784 INFO L93 Difference]: Finished difference Result 62657 states and 187494 transitions. [2021-06-05 08:20:33,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 08:20:33,784 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:20:33,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:20:33,875 INFO L225 Difference]: With dead ends: 62657 [2021-06-05 08:20:33,875 INFO L226 Difference]: Without dead ends: 62569 [2021-06-05 08:20:33,876 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 14738.0ms TimeCoverageRelationStatistics Valid=640, Invalid=2782, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 08:20:34,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62569 states. [2021-06-05 08:20:34,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62569 to 47888. [2021-06-05 08:20:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47888 states, 47885 states have (on average 3.0053879085308552) internal successors, (143913), 47887 states have internal predecessors, (143913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47888 states to 47888 states and 143913 transitions. [2021-06-05 08:20:34,803 INFO L78 Accepts]: Start accepts. Automaton has 47888 states and 143913 transitions. Word has length 86 [2021-06-05 08:20:34,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:20:34,803 INFO L482 AbstractCegarLoop]: Abstraction has 47888 states and 143913 transitions. [2021-06-05 08:20:34,803 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:34,803 INFO L276 IsEmpty]: Start isEmpty. Operand 47888 states and 143913 transitions. [2021-06-05 08:20:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:20:34,833 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:20:34,833 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:20:35,033 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2021-06-05 08:20:35,034 INFO L430 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:20:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:20:35,035 INFO L82 PathProgramCache]: Analyzing trace with hash -620691323, now seen corresponding path program 4 times [2021-06-05 08:20:35,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:20:35,035 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854861554] [2021-06-05 08:20:35,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:20:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:20:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:20:35,220 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:20:35,220 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854861554] [2021-06-05 08:20:35,220 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854861554] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:20:35,220 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373086300] [2021-06-05 08:20:35,220 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 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 08:20:35,290 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:20:35,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:20:35,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 45 conjunts are in the unsatisfiable core [2021-06-05 08:20:35,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:20:35,340 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 08:20:35,342 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:35,347 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:35,347 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:20:35,347 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2021-06-05 08:20:35,379 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:20:35,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2021-06-05 08:20:35,381 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:35,389 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:35,390 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 08:20:35,390 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2021-06-05 08:20:35,452 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 08:20:35,452 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:35,463 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-06-05 08:20:35,463 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 21 treesize of output 20 [2021-06-05 08:20:35,464 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:35,474 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:35,475 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 2 xjuncts. [2021-06-05 08:20:35,475 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:28 [2021-06-05 08:20:35,576 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:20:35,576 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 08:20:35,578 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:35,583 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:20:35,583 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 08:20:35,585 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:35,594 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:35,596 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:20:35,596 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:28 [2021-06-05 08:20:35,939 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 42 treesize of output 21 [2021-06-05 08:20:35,940 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:35,950 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:20:35,950 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 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:20:35,951 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:35,967 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:35,972 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:20:35,972 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:104, output treesize:50 [2021-06-05 08:20:36,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:20:36,146 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:36,154 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:36,159 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:36,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:20:36,163 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 08:20:36,183 INFO L628 ElimStorePlain]: treesize reduction 4, result has 87.1 percent of original size [2021-06-05 08:20:36,184 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:20:36,184 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:54, output treesize:17 [2021-06-05 08:20:36,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:20:36,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373086300] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:20:36,195 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:20:36,195 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2021-06-05 08:20:36,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682761598] [2021-06-05 08:20:36,196 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 08:20:36,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:20:36,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 08:20:36,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:20:36,196 INFO L87 Difference]: Start difference. First operand 47888 states and 143913 transitions. Second operand has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 27 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:37,432 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2021-06-05 08:20:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:20:38,152 INFO L93 Difference]: Finished difference Result 64800 states and 193419 transitions. [2021-06-05 08:20:38,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 08:20:38,152 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 27 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 08:20:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:20:38,245 INFO L225 Difference]: With dead ends: 64800 [2021-06-05 08:20:38,245 INFO L226 Difference]: Without dead ends: 64680 [2021-06-05 08:20:38,245 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1293.9ms TimeCoverageRelationStatistics Valid=314, Invalid=1666, Unknown=0, NotChecked=0, Total=1980 [2021-06-05 08:20:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64680 states. [2021-06-05 08:20:39,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64680 to 57481. [2021-06-05 08:20:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57481 states, 57478 states have (on average 2.997981836528759) internal successors, (172318), 57480 states have internal predecessors, (172318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57481 states to 57481 states and 172318 transitions. [2021-06-05 08:20:39,321 INFO L78 Accepts]: Start accepts. Automaton has 57481 states and 172318 transitions. Word has length 86 [2021-06-05 08:20:39,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:20:39,321 INFO L482 AbstractCegarLoop]: Abstraction has 57481 states and 172318 transitions. [2021-06-05 08:20:39,321 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 27 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:39,321 INFO L276 IsEmpty]: Start isEmpty. Operand 57481 states and 172318 transitions. [2021-06-05 08:20:39,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:20:39,357 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:20:39,358 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:20:39,568 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:20:39,569 INFO L430 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:20:39,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:20:39,569 INFO L82 PathProgramCache]: Analyzing trace with hash 474257669, now seen corresponding path program 5 times [2021-06-05 08:20:39,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:20:39,569 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028549044] [2021-06-05 08:20:39,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:20:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:20:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:20:39,676 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:20:39,676 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028549044] [2021-06-05 08:20:39,676 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028549044] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:20:39,676 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:20:39,676 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 08:20:39,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574249449] [2021-06-05 08:20:39,677 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:20:39,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:20:39,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:20:39,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-06-05 08:20:39,677 INFO L87 Difference]: Start difference. First operand 57481 states and 172318 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:41,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:20:41,080 INFO L93 Difference]: Finished difference Result 84301 states and 252017 transitions. [2021-06-05 08:20:41,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 08:20:41,081 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:20:41,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:20:41,359 INFO L225 Difference]: With dead ends: 84301 [2021-06-05 08:20:41,359 INFO L226 Difference]: Without dead ends: 84147 [2021-06-05 08:20:41,359 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 418.7ms TimeCoverageRelationStatistics Valid=463, Invalid=1607, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 08:20:41,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84147 states. [2021-06-05 08:20:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84147 to 68461. [2021-06-05 08:20:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68461 states, 68458 states have (on average 3.000525869876421) internal successors, (205410), 68460 states have internal predecessors, (205410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:42,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68461 states to 68461 states and 205410 transitions. [2021-06-05 08:20:42,767 INFO L78 Accepts]: Start accepts. Automaton has 68461 states and 205410 transitions. Word has length 86 [2021-06-05 08:20:42,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:20:42,767 INFO L482 AbstractCegarLoop]: Abstraction has 68461 states and 205410 transitions. [2021-06-05 08:20:42,767 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 68461 states and 205410 transitions. [2021-06-05 08:20:42,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:20:42,803 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:20:42,803 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:20:42,803 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-06-05 08:20:42,803 INFO L430 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:20:42,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:20:42,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1928996389, now seen corresponding path program 6 times [2021-06-05 08:20:42,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:20:42,804 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231701725] [2021-06-05 08:20:42,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:20:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:20:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:20:42,983 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:20:42,983 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231701725] [2021-06-05 08:20:42,983 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231701725] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:20:42,983 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335740632] [2021-06-05 08:20:42,983 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 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 08:20:43,056 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 08:20:43,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:20:43,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 40 conjunts are in the unsatisfiable core [2021-06-05 08:20:43,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:20:43,068 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 08:20:43,069 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:43,071 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:43,072 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:20:43,072 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:20:43,097 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:20:43,097 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 08:20:43,098 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:43,102 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:43,103 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 08:20:43,103 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:20:43,173 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:20:43,173 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 08:20:43,174 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:43,181 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:43,184 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 08:20:43,184 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:20:43,480 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-06-05 08:20:43,664 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:20:43,664 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 08:20:43,666 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:43,673 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:43,674 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 08:20:43,674 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:8 [2021-06-05 08:20:43,850 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 42 treesize of output 21 [2021-06-05 08:20:43,851 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:43,858 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:43,860 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:20:43,860 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:22 [2021-06-05 08:20:43,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:20:43,898 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:43,900 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:43,901 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 08:20:43,901 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-06-05 08:20:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:20:43,910 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335740632] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:20:43,910 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:20:43,911 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2021-06-05 08:20:43,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052663847] [2021-06-05 08:20:43,911 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:20:43,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:20:43,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:20:43,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:20:43,911 INFO L87 Difference]: Start difference. First operand 68461 states and 205410 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:20:45,671 INFO L93 Difference]: Finished difference Result 75869 states and 226545 transitions. [2021-06-05 08:20:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-05 08:20:45,671 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:20:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:20:45,783 INFO L225 Difference]: With dead ends: 75869 [2021-06-05 08:20:45,783 INFO L226 Difference]: Without dead ends: 75785 [2021-06-05 08:20:45,783 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 1139.4ms TimeCoverageRelationStatistics Valid=679, Invalid=2981, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 08:20:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75785 states. [2021-06-05 08:20:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75785 to 68461. [2021-06-05 08:20:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68461 states, 68458 states have (on average 3.000525869876421) internal successors, (205410), 68460 states have internal predecessors, (205410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68461 states to 68461 states and 205410 transitions. [2021-06-05 08:20:47,300 INFO L78 Accepts]: Start accepts. Automaton has 68461 states and 205410 transitions. Word has length 86 [2021-06-05 08:20:47,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:20:47,300 INFO L482 AbstractCegarLoop]: Abstraction has 68461 states and 205410 transitions. [2021-06-05 08:20:47,300 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:47,300 INFO L276 IsEmpty]: Start isEmpty. Operand 68461 states and 205410 transitions. [2021-06-05 08:20:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:20:47,334 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:20:47,334 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:20:47,534 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2021-06-05 08:20:47,534 INFO L430 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:20:47,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:20:47,535 INFO L82 PathProgramCache]: Analyzing trace with hash 482572232, now seen corresponding path program 3 times [2021-06-05 08:20:47,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:20:47,535 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942205372] [2021-06-05 08:20:47,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:20:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:20:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:20:47,729 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:20:47,730 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942205372] [2021-06-05 08:20:47,730 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942205372] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:20:47,730 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751174691] [2021-06-05 08:20:47,730 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 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 08:20:47,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:20:47,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:20:47,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 08:20:47,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:20:47,814 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 08:20:47,815 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:47,818 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:47,818 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:20:47,818 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:20:47,833 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:20:47,833 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 08:20:47,834 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:47,839 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:47,839 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 08:20:47,839 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:20:47,911 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:20:47,911 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 08:20:47,912 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:47,920 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:47,922 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 08:20:47,922 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:20:48,370 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-06-05 08:20:48,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2021-06-05 08:20:48,372 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:48,384 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:48,388 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:20:48,388 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:48 [2021-06-05 08:20:48,654 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-06-05 08:20:48,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 08:20:48,657 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:48,670 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:48,671 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:20:48,671 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:15 [2021-06-05 08:20:48,847 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 42 treesize of output 21 [2021-06-05 08:20:48,856 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:48,859 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 08:20:48,860 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:48,873 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:48,875 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 08:20:48,875 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:45 [2021-06-05 08:20:48,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:20:48,940 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:48,949 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:48,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:20:48,952 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:48,957 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:48,958 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:20:48,959 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:53, output treesize:7 [2021-06-05 08:20:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:20:48,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751174691] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:20:48,961 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:20:48,962 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 26 [2021-06-05 08:20:48,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939268030] [2021-06-05 08:20:48,962 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:20:48,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:20:48,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:20:48,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:20:48,962 INFO L87 Difference]: Start difference. First operand 68461 states and 205410 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:20:51,821 INFO L93 Difference]: Finished difference Result 90860 states and 271509 transitions. [2021-06-05 08:20:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-06-05 08:20:51,821 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:20:51,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:20:51,945 INFO L225 Difference]: With dead ends: 90860 [2021-06-05 08:20:51,945 INFO L226 Difference]: Without dead ends: 90772 [2021-06-05 08:20:51,945 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 1974.3ms TimeCoverageRelationStatistics Valid=594, Invalid=2946, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 08:20:52,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90772 states. [2021-06-05 08:20:53,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90772 to 85249. [2021-06-05 08:20:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85249 states, 85246 states have (on average 2.9981113483330595) internal successors, (255577), 85248 states have internal predecessors, (255577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85249 states to 85249 states and 255577 transitions. [2021-06-05 08:20:53,643 INFO L78 Accepts]: Start accepts. Automaton has 85249 states and 255577 transitions. Word has length 86 [2021-06-05 08:20:53,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:20:53,644 INFO L482 AbstractCegarLoop]: Abstraction has 85249 states and 255577 transitions. [2021-06-05 08:20:53,644 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:53,644 INFO L276 IsEmpty]: Start isEmpty. Operand 85249 states and 255577 transitions. [2021-06-05 08:20:53,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:20:53,682 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:20:53,682 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:20:53,884 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:20:53,885 INFO L430 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:20:53,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:20:53,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1258219251, now seen corresponding path program 7 times [2021-06-05 08:20:53,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:20:53,885 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297151203] [2021-06-05 08:20:53,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:20:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:20:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:20:54,295 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:20:54,295 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297151203] [2021-06-05 08:20:54,296 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297151203] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:20:54,296 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:20:54,296 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 08:20:54,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504270344] [2021-06-05 08:20:54,296 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:20:54,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:20:54,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:20:54,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-06-05 08:20:54,297 INFO L87 Difference]: Start difference. First operand 85249 states and 255577 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:55,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:20:55,869 INFO L93 Difference]: Finished difference Result 121467 states and 363288 transitions. [2021-06-05 08:20:55,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-06-05 08:20:55,870 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:20:55,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:20:56,057 INFO L225 Difference]: With dead ends: 121467 [2021-06-05 08:20:56,057 INFO L226 Difference]: Without dead ends: 121313 [2021-06-05 08:20:56,057 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 470.1ms TimeCoverageRelationStatistics Valid=492, Invalid=1764, Unknown=0, NotChecked=0, Total=2256 [2021-06-05 08:20:56,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121313 states. [2021-06-05 08:20:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121313 to 88753. [2021-06-05 08:20:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88753 states, 88750 states have (on average 3.0068169014084507) internal successors, (266855), 88752 states have internal predecessors, (266855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88753 states to 88753 states and 266855 transitions. [2021-06-05 08:20:58,278 INFO L78 Accepts]: Start accepts. Automaton has 88753 states and 266855 transitions. Word has length 86 [2021-06-05 08:20:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:20:58,278 INFO L482 AbstractCegarLoop]: Abstraction has 88753 states and 266855 transitions. [2021-06-05 08:20:58,278 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:20:58,278 INFO L276 IsEmpty]: Start isEmpty. Operand 88753 states and 266855 transitions. [2021-06-05 08:20:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:20:58,317 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:20:58,318 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:20:58,318 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-06-05 08:20:58,318 INFO L430 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:20:58,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:20:58,318 INFO L82 PathProgramCache]: Analyzing trace with hash 633493987, now seen corresponding path program 8 times [2021-06-05 08:20:58,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:20:58,318 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447869757] [2021-06-05 08:20:58,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:20:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:20:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:20:58,485 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:20:58,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447869757] [2021-06-05 08:20:58,485 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447869757] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:20:58,488 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020132646] [2021-06-05 08:20:58,488 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 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 08:20:58,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:20:58,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:20:58,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 40 conjunts are in the unsatisfiable core [2021-06-05 08:20:58,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:20:58,572 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 08:20:58,572 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:58,575 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:58,575 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:20:58,575 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:20:58,601 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:20:58,601 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 08:20:58,602 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:58,606 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:58,607 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 08:20:58,607 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:20:58,675 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:20:58,675 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 08:20:58,677 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:58,684 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:58,686 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 08:20:58,687 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:20:59,159 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:20:59,159 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 08:20:59,161 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:59,168 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:59,169 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 08:20:59,169 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:8 [2021-06-05 08:20:59,356 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 42 treesize of output 21 [2021-06-05 08:20:59,357 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:59,363 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:59,365 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:20:59,365 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:22 [2021-06-05 08:20:59,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:20:59,403 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:20:59,406 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:20:59,406 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 08:20:59,407 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-06-05 08:20:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:20:59,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020132646] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:20:59,417 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:20:59,417 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2021-06-05 08:20:59,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934371758] [2021-06-05 08:20:59,417 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:20:59,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:20:59,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:20:59,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:20:59,418 INFO L87 Difference]: Start difference. First operand 88753 states and 266855 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:01,245 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-06-05 08:21:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:21:01,536 INFO L93 Difference]: Finished difference Result 112321 states and 335382 transitions. [2021-06-05 08:21:01,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-06-05 08:21:01,536 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:21:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:21:01,695 INFO L225 Difference]: With dead ends: 112321 [2021-06-05 08:21:01,695 INFO L226 Difference]: Without dead ends: 112237 [2021-06-05 08:21:01,696 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 1390.2ms TimeCoverageRelationStatistics Valid=740, Invalid=3292, Unknown=0, NotChecked=0, Total=4032 [2021-06-05 08:21:01,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112237 states. [2021-06-05 08:21:03,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112237 to 88677. [2021-06-05 08:21:03,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88677 states, 88674 states have (on average 3.0066648623046213) internal successors, (266613), 88676 states have internal predecessors, (266613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88677 states to 88677 states and 266613 transitions. [2021-06-05 08:21:03,529 INFO L78 Accepts]: Start accepts. Automaton has 88677 states and 266613 transitions. Word has length 86 [2021-06-05 08:21:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:21:03,530 INFO L482 AbstractCegarLoop]: Abstraction has 88677 states and 266613 transitions. [2021-06-05 08:21:03,530 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 88677 states and 266613 transitions. [2021-06-05 08:21:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:21:03,567 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:21:03,567 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:21:03,768 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2021-06-05 08:21:03,768 INFO L430 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:21:03,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:21:03,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1994607186, now seen corresponding path program 4 times [2021-06-05 08:21:03,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:21:03,769 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044024965] [2021-06-05 08:21:03,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:21:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:21:04,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:21:04,291 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:21:04,291 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044024965] [2021-06-05 08:21:04,291 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044024965] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:21:04,291 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688265637] [2021-06-05 08:21:04,291 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 08:21:04,383 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:21:04,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:21:04,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 08:21:04,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:21:04,432 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 08:21:04,432 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:04,436 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:04,437 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:21:04,437 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-06-05 08:21:04,472 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:21:04,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2021-06-05 08:21:04,475 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:04,485 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:04,486 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 08:21:04,486 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2021-06-05 08:21:04,545 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 08:21:04,546 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:04,556 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-06-05 08:21:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:21:04,557 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:04,567 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:04,569 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 2 xjuncts. [2021-06-05 08:21:04,569 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2021-06-05 08:21:04,698 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:21:04,699 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 08:21:04,700 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:04,713 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:21:04,713 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 08:21:04,714 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:04,727 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:04,730 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2021-06-05 08:21:04,730 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2021-06-05 08:21:05,030 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:21:05,030 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 08:21:05,032 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:05,045 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:21:05,045 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 08:21:05,047 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:05,065 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:05,067 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:21:05,067 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2021-06-05 08:21:05,318 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:21:05,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:21:05,319 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:05,325 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 42 treesize of output 21 [2021-06-05 08:21:05,325 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:05,343 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:05,349 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:21:05,349 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:104, output treesize:50 [2021-06-05 08:21:05,428 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:05,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:21:05,430 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:21:05,433 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 15 treesize of output 7 [2021-06-05 08:21:05,438 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:05,469 INFO L628 ElimStorePlain]: treesize reduction 9, result has 84.5 percent of original size [2021-06-05 08:21:05,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:21:05,473 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:05,485 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:05,486 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-06-05 08:21:05,486 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:74, output treesize:22 [2021-06-05 08:21:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:21:05,513 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688265637] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:21:05,513 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:21:05,513 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2021-06-05 08:21:05,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420497129] [2021-06-05 08:21:05,513 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 08:21:05,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:21:05,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 08:21:05,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:21:05,514 INFO L87 Difference]: Start difference. First operand 88677 states and 266613 transitions. Second operand has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:06,219 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 20 [2021-06-05 08:21:11,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:21:11,082 INFO L93 Difference]: Finished difference Result 135216 states and 402817 transitions. [2021-06-05 08:21:11,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-06-05 08:21:11,082 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 0 states have call successors, (0), 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 86 [2021-06-05 08:21:11,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:21:11,286 INFO L225 Difference]: With dead ends: 135216 [2021-06-05 08:21:11,286 INFO L226 Difference]: Without dead ends: 135126 [2021-06-05 08:21:11,287 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2746 ImplicationChecksByTransitivity, 4398.8ms TimeCoverageRelationStatistics Valid=1622, Invalid=7498, Unknown=0, NotChecked=0, Total=9120 [2021-06-05 08:21:11,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135126 states. [2021-06-05 08:21:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135126 to 101986. [2021-06-05 08:21:13,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101986 states, 101983 states have (on average 3.0059911946108664) internal successors, (306560), 101985 states have internal predecessors, (306560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101986 states to 101986 states and 306560 transitions. [2021-06-05 08:21:13,797 INFO L78 Accepts]: Start accepts. Automaton has 101986 states and 306560 transitions. Word has length 86 [2021-06-05 08:21:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:21:13,797 INFO L482 AbstractCegarLoop]: Abstraction has 101986 states and 306560 transitions. [2021-06-05 08:21:13,797 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 101986 states and 306560 transitions. [2021-06-05 08:21:13,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:21:13,832 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:21:13,833 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:21:14,036 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable119 [2021-06-05 08:21:14,037 INFO L430 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:21:14,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:21:14,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1708819661, now seen corresponding path program 9 times [2021-06-05 08:21:14,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:21:14,037 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559815372] [2021-06-05 08:21:14,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:21:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:21:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:21:14,204 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:21:14,204 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559815372] [2021-06-05 08:21:14,204 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559815372] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:21:14,204 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848768190] [2021-06-05 08:21:14,204 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 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 08:21:14,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:21:14,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:21:14,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 40 conjunts are in the unsatisfiable core [2021-06-05 08:21:14,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:21:14,292 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 08:21:14,293 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:14,295 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:14,296 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:21:14,296 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:21:14,322 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:21:14,323 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 08:21:14,324 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:14,328 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:14,329 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 08:21:14,329 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:21:14,398 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:21:14,398 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 08:21:14,399 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:14,406 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:14,409 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 08:21:14,409 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:21:14,688 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:21:14,689 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 08:21:14,690 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:14,698 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:14,698 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 08:21:14,699 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:8 [2021-06-05 08:21:14,864 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 42 treesize of output 21 [2021-06-05 08:21:14,865 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:14,871 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:14,872 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:21:14,872 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:22 [2021-06-05 08:21:14,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:21:14,907 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:14,909 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:14,910 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 08:21:14,910 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-06-05 08:21:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:21:15,130 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848768190] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:21:15,130 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:21:15,130 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2021-06-05 08:21:15,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298549807] [2021-06-05 08:21:15,130 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:21:15,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:21:15,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:21:15,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:21:15,131 INFO L87 Difference]: Start difference. First operand 101986 states and 306560 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:21:19,394 INFO L93 Difference]: Finished difference Result 124842 states and 372851 transitions. [2021-06-05 08:21:19,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-06-05 08:21:19,394 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:21:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:21:19,577 INFO L225 Difference]: With dead ends: 124842 [2021-06-05 08:21:19,577 INFO L226 Difference]: Without dead ends: 124758 [2021-06-05 08:21:19,577 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 3160.5ms TimeCoverageRelationStatistics Valid=748, Invalid=3283, Unknown=1, NotChecked=0, Total=4032 [2021-06-05 08:21:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124758 states. [2021-06-05 08:21:21,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124758 to 103050. [2021-06-05 08:21:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103050 states, 103047 states have (on average 3.005453822042369) internal successors, (309703), 103049 states have internal predecessors, (309703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103050 states to 103050 states and 309703 transitions. [2021-06-05 08:21:21,658 INFO L78 Accepts]: Start accepts. Automaton has 103050 states and 309703 transitions. Word has length 86 [2021-06-05 08:21:21,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:21:21,659 INFO L482 AbstractCegarLoop]: Abstraction has 103050 states and 309703 transitions. [2021-06-05 08:21:21,659 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 103050 states and 309703 transitions. [2021-06-05 08:21:21,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:21:21,699 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:21:21,699 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:21:21,899 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2021-06-05 08:21:21,899 INFO L430 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:21:21,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:21:21,900 INFO L82 PathProgramCache]: Analyzing trace with hash -582651430, now seen corresponding path program 5 times [2021-06-05 08:21:21,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:21:21,900 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992045311] [2021-06-05 08:21:21,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:21:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:21:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:21:22,083 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:21:22,083 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992045311] [2021-06-05 08:21:22,083 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992045311] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:21:22,083 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891919130] [2021-06-05 08:21:22,084 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 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 08:21:22,164 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 08:21:22,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:21:22,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 08:21:22,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:21:22,184 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 08:21:22,185 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:22,187 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:22,188 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:21:22,188 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:21:22,214 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:21:22,214 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 08:21:22,215 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:22,220 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:22,221 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 08:21:22,221 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2021-06-05 08:21:22,280 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:21:22,280 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 08:21:22,282 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:22,287 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:22,288 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 08:21:22,288 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 08:21:22,311 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 21 treesize of output 20 [2021-06-05 08:21:22,312 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:22,317 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:22,317 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 08:21:22,317 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:21:22,339 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 21 treesize of output 20 [2021-06-05 08:21:22,340 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:22,344 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:22,345 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 08:21:22,345 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:21:22,592 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:21:22,592 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 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:21:22,881 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:22,901 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:22,907 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 08:21:22,908 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:27 [2021-06-05 08:21:22,999 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:22,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:21:23,001 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:21:23,014 INFO L628 ElimStorePlain]: treesize reduction 4, result has 81.8 percent of original size [2021-06-05 08:21:23,015 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 08:21:23,015 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2021-06-05 08:21:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:21:23,039 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891919130] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:21:23,039 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:21:23,039 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2021-06-05 08:21:23,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89774548] [2021-06-05 08:21:23,040 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 08:21:23,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:21:23,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 08:21:23,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2021-06-05 08:21:23,040 INFO L87 Difference]: Start difference. First operand 103050 states and 309703 transitions. Second operand has 31 states, 31 states have (on average 5.032258064516129) internal successors, (156), 31 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:26,531 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2021-06-05 08:21:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:21:27,888 INFO L93 Difference]: Finished difference Result 129631 states and 386903 transitions. [2021-06-05 08:21:27,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 08:21:27,888 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.032258064516129) internal successors, (156), 31 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 08:21:27,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:21:28,098 INFO L225 Difference]: With dead ends: 129631 [2021-06-05 08:21:28,098 INFO L226 Difference]: Without dead ends: 129521 [2021-06-05 08:21:28,099 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 1834.3ms TimeCoverageRelationStatistics Valid=792, Invalid=3368, Unknown=0, NotChecked=0, Total=4160 [2021-06-05 08:21:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129521 states. [2021-06-05 08:21:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129521 to 103850. [2021-06-05 08:21:30,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103850 states, 103847 states have (on average 3.006817722225967) internal successors, (312249), 103849 states have internal predecessors, (312249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103850 states to 103850 states and 312249 transitions. [2021-06-05 08:21:30,321 INFO L78 Accepts]: Start accepts. Automaton has 103850 states and 312249 transitions. Word has length 86 [2021-06-05 08:21:30,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:21:30,322 INFO L482 AbstractCegarLoop]: Abstraction has 103850 states and 312249 transitions. [2021-06-05 08:21:30,322 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 5.032258064516129) internal successors, (156), 31 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 103850 states and 312249 transitions. [2021-06-05 08:21:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:21:30,361 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:21:30,361 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:21:30,561 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable139 [2021-06-05 08:21:30,561 INFO L430 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:21:30,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:21:30,562 INFO L82 PathProgramCache]: Analyzing trace with hash 802630070, now seen corresponding path program 6 times [2021-06-05 08:21:30,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:21:30,562 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610864635] [2021-06-05 08:21:30,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:21:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:21:31,035 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2021-06-05 08:21:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:21:31,049 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:21:31,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610864635] [2021-06-05 08:21:31,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610864635] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:21:31,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225348341] [2021-06-05 08:21:31,050 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 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 08:21:31,164 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 08:21:31,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:21:31,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 44 conjunts are in the unsatisfiable core [2021-06-05 08:21:31,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:21:31,177 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 08:21:31,177 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:31,180 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:31,180 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:21:31,181 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:21:31,195 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:21:31,196 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 08:21:31,197 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:31,201 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:31,213 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 08:21:31,213 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:21:31,284 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:21:31,284 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 08:21:31,285 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:31,293 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:31,295 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 08:21:31,295 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:21:31,594 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-06-05 08:21:31,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2021-06-05 08:21:31,596 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:31,608 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:31,612 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:21:31,612 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:48 [2021-06-05 08:21:31,870 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-06-05 08:21:31,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 08:21:31,872 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:31,885 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:31,886 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:21:31,887 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:15 [2021-06-05 08:21:32,027 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 42 treesize of output 21 [2021-06-05 08:21:32,029 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:32,035 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:32,037 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:21:32,037 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:22 [2021-06-05 08:21:32,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:21:32,073 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:32,076 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:32,077 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 08:21:32,077 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-06-05 08:21:32,097 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:21:32,097 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225348341] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:21:32,097 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:21:32,097 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 27 [2021-06-05 08:21:32,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726315738] [2021-06-05 08:21:32,098 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:21:32,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:21:32,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:21:32,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:21:32,098 INFO L87 Difference]: Start difference. First operand 103850 states and 312249 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:34,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:21:34,523 INFO L93 Difference]: Finished difference Result 136173 states and 407107 transitions. [2021-06-05 08:21:34,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-05 08:21:34,524 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:21:34,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:21:34,751 INFO L225 Difference]: With dead ends: 136173 [2021-06-05 08:21:34,751 INFO L226 Difference]: Without dead ends: 136085 [2021-06-05 08:21:34,752 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 1737.4ms TimeCoverageRelationStatistics Valid=598, Invalid=2824, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 08:21:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136085 states. [2021-06-05 08:21:36,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136085 to 111756. [2021-06-05 08:21:37,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111756 states, 111753 states have (on average 3.011829660053869) internal successors, (336581), 111755 states have internal predecessors, (336581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111756 states to 111756 states and 336581 transitions. [2021-06-05 08:21:37,347 INFO L78 Accepts]: Start accepts. Automaton has 111756 states and 336581 transitions. Word has length 86 [2021-06-05 08:21:37,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:21:37,347 INFO L482 AbstractCegarLoop]: Abstraction has 111756 states and 336581 transitions. [2021-06-05 08:21:37,347 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:37,348 INFO L276 IsEmpty]: Start isEmpty. Operand 111756 states and 336581 transitions. [2021-06-05 08:21:37,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:21:37,388 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:21:37,388 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:21:37,588 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable150 [2021-06-05 08:21:37,588 INFO L430 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:21:37,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:21:37,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1252332198, now seen corresponding path program 7 times [2021-06-05 08:21:37,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:21:37,589 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118285786] [2021-06-05 08:21:37,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:21:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:21:37,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:21:37,778 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:21:37,778 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118285786] [2021-06-05 08:21:37,778 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118285786] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:21:37,778 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949744167] [2021-06-05 08:21:37,778 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 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 08:21:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:21:37,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 08:21:37,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:21:37,866 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 08:21:37,866 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:37,869 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:37,869 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:21:37,869 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:21:37,898 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:21:37,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 08:21:37,900 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:37,905 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:37,906 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 08:21:37,906 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2021-06-05 08:21:37,968 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:21:37,969 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 08:21:37,970 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:37,975 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:37,976 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 08:21:37,976 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 08:21:37,999 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 21 treesize of output 20 [2021-06-05 08:21:38,000 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:38,004 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:38,005 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 08:21:38,005 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:21:38,025 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 21 treesize of output 20 [2021-06-05 08:21:38,026 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:38,031 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:38,031 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 08:21:38,032 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:21:38,321 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:21:38,322 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 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:21:38,323 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:38,330 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:38,335 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 08:21:38,335 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:27 [2021-06-05 08:21:38,375 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 15 treesize of output 7 [2021-06-05 08:21:38,375 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:38,380 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:21:38,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 08:21:38,381 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:38,389 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:38,389 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:21:38,389 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:19 [2021-06-05 08:21:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:21:38,415 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949744167] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:21:38,415 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:21:38,415 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2021-06-05 08:21:38,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216615705] [2021-06-05 08:21:38,416 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 08:21:38,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:21:38,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 08:21:38,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:21:38,416 INFO L87 Difference]: Start difference. First operand 111756 states and 336581 transitions. Second operand has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:44,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:21:44,308 INFO L93 Difference]: Finished difference Result 170965 states and 510373 transitions. [2021-06-05 08:21:44,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2021-06-05 08:21:44,308 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 08:21:44,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:21:44,569 INFO L225 Difference]: With dead ends: 170965 [2021-06-05 08:21:44,569 INFO L226 Difference]: Without dead ends: 170749 [2021-06-05 08:21:44,570 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3130 ImplicationChecksByTransitivity, 2693.6ms TimeCoverageRelationStatistics Valid=1341, Invalid=8165, Unknown=0, NotChecked=0, Total=9506 [2021-06-05 08:21:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170749 states. [2021-06-05 08:21:46,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170749 to 130668. [2021-06-05 08:21:47,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130668 states, 130665 states have (on average 3.016676233115218) internal successors, (394174), 130667 states have internal predecessors, (394174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:47,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130668 states to 130668 states and 394174 transitions. [2021-06-05 08:21:47,330 INFO L78 Accepts]: Start accepts. Automaton has 130668 states and 394174 transitions. Word has length 86 [2021-06-05 08:21:47,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:21:47,330 INFO L482 AbstractCegarLoop]: Abstraction has 130668 states and 394174 transitions. [2021-06-05 08:21:47,330 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:47,331 INFO L276 IsEmpty]: Start isEmpty. Operand 130668 states and 394174 transitions. [2021-06-05 08:21:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:21:47,375 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:21:47,375 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:21:47,575 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:21:47,576 INFO L430 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:21:47,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:21:47,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2102609966, now seen corresponding path program 8 times [2021-06-05 08:21:47,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:21:47,576 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006141264] [2021-06-05 08:21:47,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:21:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:21:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:21:48,123 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:21:48,123 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006141264] [2021-06-05 08:21:48,124 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006141264] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:21:48,124 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064767741] [2021-06-05 08:21:48,124 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 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 08:21:48,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:21:48,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:21:48,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 08:21:48,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:21:48,254 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 08:21:48,255 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:48,257 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:48,257 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:21:48,258 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:21:48,272 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:21:48,272 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 08:21:48,273 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:48,277 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:48,278 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 08:21:48,278 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:21:48,347 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:21:48,348 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 08:21:48,349 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:48,356 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:48,359 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 08:21:48,359 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:21:48,655 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-06-05 08:21:48,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2021-06-05 08:21:48,656 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:48,669 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:48,673 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:21:48,673 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:48 [2021-06-05 08:21:48,897 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-06-05 08:21:48,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 08:21:48,899 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:48,913 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:48,914 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:21:48,914 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:15 [2021-06-05 08:21:49,113 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 08:21:49,114 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:49,116 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 42 treesize of output 21 [2021-06-05 08:21:49,117 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:49,130 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:49,133 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 08:21:49,133 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:45 [2021-06-05 08:21:49,553 WARN L205 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-05 08:21:49,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:21:49,570 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:49,579 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:49,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:21:49,581 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:21:49,587 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:21:49,588 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:21:49,588 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:53, output treesize:7 [2021-06-05 08:21:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:21:49,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064767741] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:21:49,591 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:21:49,591 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 26 [2021-06-05 08:21:49,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670125788] [2021-06-05 08:21:49,591 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:21:49,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:21:49,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:21:49,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:21:49,592 INFO L87 Difference]: Start difference. First operand 130668 states and 394174 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:21:51,657 WARN L205 SmtUtils]: Spent 864.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-06-05 08:21:52,574 WARN L205 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 08:21:53,613 WARN L205 SmtUtils]: Spent 884.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 08:21:54,542 WARN L205 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 08:21:55,442 WARN L205 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 08:21:56,376 WARN L205 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2021-06-05 08:21:57,279 WARN L205 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 08:21:58,221 WARN L205 SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 08:21:59,201 WARN L205 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2021-06-05 08:22:00,090 WARN L205 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-06-05 08:22:01,031 WARN L205 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 08:22:01,875 WARN L205 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2021-06-05 08:22:02,818 WARN L205 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-06-05 08:22:03,737 WARN L205 SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2021-06-05 08:22:04,677 WARN L205 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 08:22:05,622 WARN L205 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2021-06-05 08:22:06,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:06,043 INFO L93 Difference]: Finished difference Result 184798 states and 554873 transitions. [2021-06-05 08:22:06,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-05 08:22:06,043 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:22:06,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:06,341 INFO L225 Difference]: With dead ends: 184798 [2021-06-05 08:22:06,341 INFO L226 Difference]: Without dead ends: 184710 [2021-06-05 08:22:06,342 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 15646.4ms TimeCoverageRelationStatistics Valid=546, Invalid=2876, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 08:22:06,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184710 states. [2021-06-05 08:22:09,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184710 to 148786. [2021-06-05 08:22:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148786 states, 148783 states have (on average 3.0145917208283204) internal successors, (448520), 148785 states have internal predecessors, (448520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148786 states to 148786 states and 448520 transitions. [2021-06-05 08:22:09,565 INFO L78 Accepts]: Start accepts. Automaton has 148786 states and 448520 transitions. Word has length 86 [2021-06-05 08:22:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:09,565 INFO L482 AbstractCegarLoop]: Abstraction has 148786 states and 448520 transitions. [2021-06-05 08:22:09,565 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 148786 states and 448520 transitions. [2021-06-05 08:22:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:22:09,609 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:09,609 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:09,812 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable161 [2021-06-05 08:22:09,813 INFO L430 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:09,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:09,813 INFO L82 PathProgramCache]: Analyzing trace with hash -374569452, now seen corresponding path program 9 times [2021-06-05 08:22:09,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:09,814 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915418178] [2021-06-05 08:22:09,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:22:09,998 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:09,998 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915418178] [2021-06-05 08:22:09,998 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915418178] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:09,998 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122216071] [2021-06-05 08:22:09,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:10,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:22:10,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:22:10,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 08:22:10,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:22:10,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 08:22:10,077 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:10,080 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:10,080 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:10,080 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:22:10,094 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:22:10,095 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 08:22:10,096 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:10,100 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:10,101 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 08:22:10,101 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:22:10,170 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:22:10,171 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 08:22:10,172 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:10,179 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:10,182 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 08:22:10,182 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:22:10,803 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-06-05 08:22:10,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2021-06-05 08:22:10,804 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:10,816 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:10,820 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:22:10,820 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:48 [2021-06-05 08:22:11,040 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-06-05 08:22:11,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 08:22:11,043 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:11,057 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:11,058 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:11,058 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:15 [2021-06-05 08:22:11,249 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 42 treesize of output 21 [2021-06-05 08:22:11,250 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:11,253 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 08:22:11,254 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:11,267 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:11,269 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 08:22:11,270 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:45 [2021-06-05 08:22:11,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:22:11,331 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:11,340 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:11,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:22:11,343 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:11,348 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:11,349 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:22:11,349 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:53, output treesize:7 [2021-06-05 08:22:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:22:11,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122216071] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:22:11,352 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:22:11,352 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 26 [2021-06-05 08:22:11,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598405446] [2021-06-05 08:22:11,353 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:22:11,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:11,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:22:11,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:22:11,353 INFO L87 Difference]: Start difference. First operand 148786 states and 448520 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:14,892 INFO L93 Difference]: Finished difference Result 262938 states and 786995 transitions. [2021-06-05 08:22:14,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-06-05 08:22:14,893 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:22:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:15,367 INFO L225 Difference]: With dead ends: 262938 [2021-06-05 08:22:15,367 INFO L226 Difference]: Without dead ends: 262850 [2021-06-05 08:22:15,367 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 1854.2ms TimeCoverageRelationStatistics Valid=630, Invalid=3276, Unknown=0, NotChecked=0, Total=3906 [2021-06-05 08:22:15,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262850 states. [2021-06-05 08:22:19,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262850 to 249886. [2021-06-05 08:22:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249886 states, 249883 states have (on average 2.9956779772933735) internal successors, (748569), 249885 states have internal predecessors, (748569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249886 states to 249886 states and 748569 transitions. [2021-06-05 08:22:20,801 INFO L78 Accepts]: Start accepts. Automaton has 249886 states and 748569 transitions. Word has length 86 [2021-06-05 08:22:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:20,801 INFO L482 AbstractCegarLoop]: Abstraction has 249886 states and 748569 transitions. [2021-06-05 08:22:20,801 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 249886 states and 748569 transitions. [2021-06-05 08:22:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:22:20,843 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:20,843 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:21,043 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:21,043 INFO L430 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:21,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:21,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1037386304, now seen corresponding path program 10 times [2021-06-05 08:22:21,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:21,044 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928241914] [2021-06-05 08:22:21,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:22:21,231 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:21,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928241914] [2021-06-05 08:22:21,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928241914] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:21,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074261675] [2021-06-05 08:22:21,231 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:21,313 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:22:21,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:22:21,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 08:22:21,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:22:21,358 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 08:22:21,359 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:21,363 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:21,363 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:21,363 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-06-05 08:22:21,396 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:22:21,397 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 21 treesize of output 28 [2021-06-05 08:22:21,399 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:21,407 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:21,408 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 08:22:21,408 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2021-06-05 08:22:21,456 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 08:22:21,457 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:21,465 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-06-05 08:22:21,466 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 21 treesize of output 20 [2021-06-05 08:22:21,466 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:21,476 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:21,477 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 2 xjuncts. [2021-06-05 08:22:21,477 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2021-06-05 08:22:21,596 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:22:21,596 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 08:22:21,597 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:21,609 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:22:21,609 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 08:22:21,610 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:21,622 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:21,625 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2021-06-05 08:22:21,625 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2021-06-05 08:22:21,837 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:22:21,837 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 08:22:21,838 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:21,849 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:22:21,850 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 08:22:21,851 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:21,869 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:21,870 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:22:21,870 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2021-06-05 08:22:22,439 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:22:22,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:22:22,441 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:22,447 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 42 treesize of output 21 [2021-06-05 08:22:22,448 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:22,463 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:22,475 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:22:22,475 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:104, output treesize:50 [2021-06-05 08:22:22,594 INFO L446 ElimStorePlain]: Different costs {0=[|#memory_int|], 1=[v_prenex_47]} [2021-06-05 08:22:22,596 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 15 treesize of output 7 [2021-06-05 08:22:22,597 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:22,605 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:22,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:22:22,608 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:22,614 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:22,614 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:22:22,614 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:13 [2021-06-05 08:22:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:22:22,627 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074261675] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:22,627 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:22:22,628 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2021-06-05 08:22:22,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453286529] [2021-06-05 08:22:22,628 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 08:22:22,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:22,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 08:22:22,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:22:22,628 INFO L87 Difference]: Start difference. First operand 249886 states and 748569 transitions. Second operand has 30 states, 30 states have (on average 5.3) internal successors, (159), 30 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:26,998 INFO L93 Difference]: Finished difference Result 328219 states and 979596 transitions. [2021-06-05 08:22:26,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-06-05 08:22:26,998 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.3) internal successors, (159), 30 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 08:22:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:27,545 INFO L225 Difference]: With dead ends: 328219 [2021-06-05 08:22:27,545 INFO L226 Difference]: Without dead ends: 328109 [2021-06-05 08:22:27,546 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 2825.9ms TimeCoverageRelationStatistics Valid=787, Invalid=3769, Unknown=0, NotChecked=0, Total=4556 [2021-06-05 08:22:28,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328109 states. [2021-06-05 08:22:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328109 to 263398. [2021-06-05 08:22:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263398 states, 263395 states have (on average 2.997843542967786) internal successors, (789617), 263397 states have internal predecessors, (789617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:33,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263398 states to 263398 states and 789617 transitions. [2021-06-05 08:22:33,410 INFO L78 Accepts]: Start accepts. Automaton has 263398 states and 789617 transitions. Word has length 86 [2021-06-05 08:22:33,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:33,410 INFO L482 AbstractCegarLoop]: Abstraction has 263398 states and 789617 transitions. [2021-06-05 08:22:33,411 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.3) internal successors, (159), 30 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 263398 states and 789617 transitions. [2021-06-05 08:22:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:22:33,458 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:33,458 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:33,658 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable183 [2021-06-05 08:22:33,658 INFO L430 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:33,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:33,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1872299492, now seen corresponding path program 11 times [2021-06-05 08:22:33,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:33,659 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700463062] [2021-06-05 08:22:33,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:22:34,467 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:34,467 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700463062] [2021-06-05 08:22:34,467 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700463062] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:34,467 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911857094] [2021-06-05 08:22:34,467 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 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 08:22:34,547 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 08:22:34,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:22:34,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 08:22:34,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:22:34,561 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 08:22:34,562 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:34,564 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:34,565 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:34,565 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:22:34,593 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:22:34,594 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 08:22:34,595 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:34,600 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:34,601 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 08:22:34,601 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2021-06-05 08:22:34,663 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:22:34,663 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 08:22:34,665 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:34,670 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:34,671 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 08:22:34,671 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 08:22:34,693 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 21 treesize of output 20 [2021-06-05 08:22:34,694 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:34,698 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:34,699 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 08:22:34,699 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:22:34,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 21 treesize of output 20 [2021-06-05 08:22:34,720 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:34,725 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:34,725 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 08:22:34,725 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:22:34,998 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:22:34,998 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 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:22:34,999 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:35,006 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:35,012 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 08:22:35,012 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:27 [2021-06-05 08:22:35,051 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 15 treesize of output 7 [2021-06-05 08:22:35,052 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:35,056 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:22:35,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 08:22:35,057 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:35,065 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:35,065 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:22:35,065 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:19 [2021-06-05 08:22:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:22:35,091 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911857094] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:35,091 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:22:35,091 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2021-06-05 08:22:35,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651175164] [2021-06-05 08:22:35,092 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 08:22:35,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:35,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 08:22:35,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:22:35,092 INFO L87 Difference]: Start difference. First operand 263398 states and 789617 transitions. Second operand has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:36,715 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2021-06-05 08:22:40,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:40,350 INFO L93 Difference]: Finished difference Result 282571 states and 845110 transitions. [2021-06-05 08:22:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 08:22:40,351 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 08:22:40,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:40,787 INFO L225 Difference]: With dead ends: 282571 [2021-06-05 08:22:40,787 INFO L226 Difference]: Without dead ends: 282481 [2021-06-05 08:22:40,788 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 1987.7ms TimeCoverageRelationStatistics Valid=793, Invalid=3239, Unknown=0, NotChecked=0, Total=4032 [2021-06-05 08:22:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282481 states. [2021-06-05 08:22:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282481 to 264880. [2021-06-05 08:22:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264880 states, 264877 states have (on average 2.998395481676401) internal successors, (794206), 264879 states have internal predecessors, (794206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264880 states to 264880 states and 794206 transitions. [2021-06-05 08:22:46,557 INFO L78 Accepts]: Start accepts. Automaton has 264880 states and 794206 transitions. Word has length 86 [2021-06-05 08:22:46,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:46,558 INFO L482 AbstractCegarLoop]: Abstraction has 264880 states and 794206 transitions. [2021-06-05 08:22:46,558 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 264880 states and 794206 transitions. [2021-06-05 08:22:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:22:46,604 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:46,604 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:46,804 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable202 [2021-06-05 08:22:46,805 INFO L430 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:46,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:46,805 INFO L82 PathProgramCache]: Analyzing trace with hash -450998157, now seen corresponding path program 10 times [2021-06-05 08:22:46,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:46,805 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238492025] [2021-06-05 08:22:46,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:22:46,959 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:46,959 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238492025] [2021-06-05 08:22:46,959 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238492025] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:46,959 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346016279] [2021-06-05 08:22:46,959 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 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 08:22:47,024 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:22:47,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:22:47,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 43 conjunts are in the unsatisfiable core [2021-06-05 08:22:47,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:22:47,062 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 08:22:47,063 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:47,067 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:47,067 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:47,067 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-06-05 08:22:47,103 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:22:47,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2021-06-05 08:22:47,106 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:47,114 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:47,115 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 08:22:47,115 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2021-06-05 08:22:47,165 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 08:22:47,165 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:47,175 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-06-05 08:22:47,175 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 21 treesize of output 20 [2021-06-05 08:22:47,176 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:47,185 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:47,187 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 2 xjuncts. [2021-06-05 08:22:47,187 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2021-06-05 08:22:47,290 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:22:47,291 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 08:22:47,292 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:47,297 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:22:47,297 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 08:22:47,298 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:47,308 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:47,309 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:22:47,309 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:28 [2021-06-05 08:22:47,905 WARN L205 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-06-05 08:22:48,130 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:22:48,130 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 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:22:48,132 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:48,137 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 42 treesize of output 21 [2021-06-05 08:22:48,137 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:48,153 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:48,162 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:22:48,162 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:104, output treesize:50 [2021-06-05 08:22:48,227 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:48,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:22:48,242 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:22:48,245 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 15 treesize of output 7 [2021-06-05 08:22:48,246 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:48,275 INFO L628 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2021-06-05 08:22:48,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:22:48,278 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:48,289 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:48,290 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:22:48,290 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:74, output treesize:17 [2021-06-05 08:22:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:22:48,303 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346016279] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:48,303 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:22:48,303 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2021-06-05 08:22:48,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124691373] [2021-06-05 08:22:48,304 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 08:22:48,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:48,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 08:22:48,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:22:48,304 INFO L87 Difference]: Start difference. First operand 264880 states and 794206 transitions. Second operand has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 27 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:50,895 INFO L93 Difference]: Finished difference Result 283131 states and 846929 transitions. [2021-06-05 08:22:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 08:22:50,895 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 27 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 08:22:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:51,366 INFO L225 Difference]: With dead ends: 283131 [2021-06-05 08:22:51,366 INFO L226 Difference]: Without dead ends: 283041 [2021-06-05 08:22:51,366 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1178.9ms TimeCoverageRelationStatistics Valid=349, Invalid=1631, Unknown=0, NotChecked=0, Total=1980 [2021-06-05 08:22:52,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283041 states. [2021-06-05 08:22:56,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283041 to 265160. [2021-06-05 08:22:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265160 states, 265157 states have (on average 2.99835569115656) internal successors, (795035), 265159 states have internal predecessors, (795035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:57,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265160 states to 265160 states and 795035 transitions. [2021-06-05 08:22:57,143 INFO L78 Accepts]: Start accepts. Automaton has 265160 states and 795035 transitions. Word has length 86 [2021-06-05 08:22:57,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:57,143 INFO L482 AbstractCegarLoop]: Abstraction has 265160 states and 795035 transitions. [2021-06-05 08:22:57,143 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 27 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:57,143 INFO L276 IsEmpty]: Start isEmpty. Operand 265160 states and 795035 transitions. [2021-06-05 08:22:57,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:22:57,188 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:57,188 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:57,389 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable212 [2021-06-05 08:22:57,389 INFO L430 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:57,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:57,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1299124115, now seen corresponding path program 11 times [2021-06-05 08:22:57,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:57,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956084298] [2021-06-05 08:22:57,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:22:57,549 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:57,549 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956084298] [2021-06-05 08:22:57,549 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956084298] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:57,549 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761555749] [2021-06-05 08:22:57,549 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 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 08:22:58,231 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 08:22:58,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:22:58,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 08:22:58,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:22:58,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:22:58,246 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:58,248 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:58,249 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:58,249 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:22:58,296 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:22:58,297 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 08:22:58,298 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:58,304 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:58,306 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 08:22:58,306 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2021-06-05 08:22:58,376 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:22:58,376 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 08:22:58,378 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:58,383 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:58,384 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 08:22:58,384 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 08:22:58,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:22:58,410 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:58,414 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:58,415 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 08:22:58,415 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:22:58,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:22:58,437 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:58,441 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:58,442 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 08:22:58,442 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:22:58,740 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:22:58,741 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 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:22:58,742 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:58,749 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:58,753 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 08:22:58,753 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:27 [2021-06-05 08:22:58,799 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:58,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:22:58,802 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:22:58,803 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 15 treesize of output 7 [2021-06-05 08:22:58,804 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:58,820 INFO L628 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2021-06-05 08:22:58,821 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 08:22:58,821 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:13 [2021-06-05 08:22:58,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:22:58,846 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761555749] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:58,846 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:22:58,846 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2021-06-05 08:22:58,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707378612] [2021-06-05 08:22:58,847 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 08:22:58,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:58,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 08:22:58,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2021-06-05 08:22:58,847 INFO L87 Difference]: Start difference. First operand 265160 states and 795035 transitions. Second operand has 31 states, 31 states have (on average 5.064516129032258) internal successors, (157), 31 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:23:02,644 INFO L93 Difference]: Finished difference Result 351385 states and 1050627 transitions. [2021-06-05 08:23:02,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-06-05 08:23:02,661 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.064516129032258) internal successors, (157), 31 states have internal predecessors, (157), 0 states have call successors, (0), 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 86 [2021-06-05 08:23:02,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:23:03,273 INFO L225 Difference]: With dead ends: 351385 [2021-06-05 08:23:03,273 INFO L226 Difference]: Without dead ends: 351205 [2021-06-05 08:23:03,273 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1522 ImplicationChecksByTransitivity, 1712.4ms TimeCoverageRelationStatistics Valid=868, Invalid=4534, Unknown=0, NotChecked=0, Total=5402 [2021-06-05 08:23:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351205 states. [2021-06-05 08:23:08,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351205 to 299096. [2021-06-05 08:23:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299096 states, 299093 states have (on average 3.0108394379005863) internal successors, (900521), 299095 states have internal predecessors, (900521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299096 states to 299096 states and 900521 transitions. [2021-06-05 08:23:10,335 INFO L78 Accepts]: Start accepts. Automaton has 299096 states and 900521 transitions. Word has length 86 [2021-06-05 08:23:10,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:23:10,335 INFO L482 AbstractCegarLoop]: Abstraction has 299096 states and 900521 transitions. [2021-06-05 08:23:10,335 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 5.064516129032258) internal successors, (157), 31 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 299096 states and 900521 transitions. [2021-06-05 08:23:10,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:23:10,377 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:23:10,377 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:23:10,579 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:23:10,579 INFO L430 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:23:10,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:23:10,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1482275083, now seen corresponding path program 12 times [2021-06-05 08:23:10,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:23:10,579 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123312237] [2021-06-05 08:23:10,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:23:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:23:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:23:10,741 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:23:10,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123312237] [2021-06-05 08:23:10,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123312237] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:23:10,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451143494] [2021-06-05 08:23:10,741 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 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 08:23:10,806 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 08:23:10,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:23:10,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 40 conjunts are in the unsatisfiable core [2021-06-05 08:23:10,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:23:10,818 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 08:23:10,818 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:10,821 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:10,821 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:10,821 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:23:10,848 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:23:10,849 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 08:23:10,850 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:10,854 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:10,855 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 08:23:10,855 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:23:10,928 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:23:10,929 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 08:23:10,930 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:10,939 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:10,942 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 08:23:10,942 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:23:11,236 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:23:11,237 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 08:23:11,238 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:11,246 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:11,246 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 08:23:11,247 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:8 [2021-06-05 08:23:11,424 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 42 treesize of output 21 [2021-06-05 08:23:11,425 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:11,432 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:11,434 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:23:11,434 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:22 [2021-06-05 08:23:11,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:23:11,473 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:11,475 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:11,476 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 08:23:11,476 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-06-05 08:23:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:23:11,486 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451143494] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:23:11,486 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:23:11,486 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2021-06-05 08:23:11,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907696019] [2021-06-05 08:23:11,487 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:23:11,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:23:11,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:23:11,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:23:11,487 INFO L87 Difference]: Start difference. First operand 299096 states and 900521 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:14,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:23:14,359 INFO L93 Difference]: Finished difference Result 379200 states and 1138096 transitions. [2021-06-05 08:23:14,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 08:23:14,359 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:23:14,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:23:15,519 INFO L225 Difference]: With dead ends: 379200 [2021-06-05 08:23:15,519 INFO L226 Difference]: Without dead ends: 379110 [2021-06-05 08:23:15,519 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 1065.6ms TimeCoverageRelationStatistics Valid=403, Invalid=1949, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 08:23:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379110 states. [2021-06-05 08:23:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379110 to 308396. [2021-06-05 08:23:21,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308396 states, 308393 states have (on average 3.0145593447322088) internal successors, (929669), 308395 states have internal predecessors, (929669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308396 states to 308396 states and 929669 transitions. [2021-06-05 08:23:22,969 INFO L78 Accepts]: Start accepts. Automaton has 308396 states and 929669 transitions. Word has length 86 [2021-06-05 08:23:22,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:23:22,970 INFO L482 AbstractCegarLoop]: Abstraction has 308396 states and 929669 transitions. [2021-06-05 08:23:22,970 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand 308396 states and 929669 transitions. [2021-06-05 08:23:23,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:23:23,012 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:23:23,012 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:23:23,213 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240,30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:23:23,213 INFO L430 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:23:23,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:23:23,214 INFO L82 PathProgramCache]: Analyzing trace with hash 69240197, now seen corresponding path program 13 times [2021-06-05 08:23:23,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:23:23,214 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130327381] [2021-06-05 08:23:23,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:23:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:23:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:23:23,315 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:23:23,315 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130327381] [2021-06-05 08:23:23,315 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130327381] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:23:23,315 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:23:23,315 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 08:23:23,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260750080] [2021-06-05 08:23:23,315 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:23:23,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:23:23,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:23:23,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-06-05 08:23:23,316 INFO L87 Difference]: Start difference. First operand 308396 states and 929669 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:23:25,688 INFO L93 Difference]: Finished difference Result 386442 states and 1160149 transitions. [2021-06-05 08:23:25,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 08:23:25,689 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:23:25,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:23:26,364 INFO L225 Difference]: With dead ends: 386442 [2021-06-05 08:23:26,365 INFO L226 Difference]: Without dead ends: 386332 [2021-06-05 08:23:26,365 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 303.8ms TimeCoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 08:23:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386332 states. [2021-06-05 08:23:32,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386332 to 308396. [2021-06-05 08:23:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308396 states, 308393 states have (on average 3.0145593447322088) internal successors, (929669), 308395 states have internal predecessors, (929669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308396 states to 308396 states and 929669 transitions. [2021-06-05 08:23:34,177 INFO L78 Accepts]: Start accepts. Automaton has 308396 states and 929669 transitions. Word has length 86 [2021-06-05 08:23:34,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:23:34,177 INFO L482 AbstractCegarLoop]: Abstraction has 308396 states and 929669 transitions. [2021-06-05 08:23:34,178 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:34,178 INFO L276 IsEmpty]: Start isEmpty. Operand 308396 states and 929669 transitions. [2021-06-05 08:23:34,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:23:34,232 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:23:34,232 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:23:34,232 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2021-06-05 08:23:34,232 INFO L430 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:23:34,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:23:34,233 INFO L82 PathProgramCache]: Analyzing trace with hash -670715614, now seen corresponding path program 12 times [2021-06-05 08:23:34,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:23:34,233 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459566851] [2021-06-05 08:23:34,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:23:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:23:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:23:34,492 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:23:34,492 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459566851] [2021-06-05 08:23:34,492 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459566851] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:23:34,492 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847293577] [2021-06-05 08:23:34,492 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 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 08:23:34,557 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 08:23:34,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:23:34,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 08:23:34,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:23:34,572 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 08:23:34,573 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:34,575 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:34,576 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:34,576 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:23:34,590 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:23:34,590 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 08:23:34,591 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:34,595 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:34,596 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 08:23:34,596 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:23:34,667 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:23:34,667 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 08:23:34,668 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:34,676 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:34,678 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 08:23:34,678 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:23:34,978 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-06-05 08:23:34,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2021-06-05 08:23:34,979 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:34,992 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:34,995 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:23:34,996 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:48 [2021-06-05 08:23:35,208 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-06-05 08:23:35,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 08:23:35,211 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:35,224 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:35,225 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:35,226 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:15 [2021-06-05 08:23:35,428 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 08:23:35,429 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:35,432 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 42 treesize of output 21 [2021-06-05 08:23:35,433 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:35,445 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:35,448 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 08:23:35,448 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:45 [2021-06-05 08:23:35,872 WARN L205 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-05 08:23:35,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:23:35,889 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:35,898 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:35,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:23:35,901 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:35,906 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:35,907 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:23:35,907 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:53, output treesize:7 [2021-06-05 08:23:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:23:35,910 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847293577] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:23:35,910 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:23:35,910 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 26 [2021-06-05 08:23:35,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843789585] [2021-06-05 08:23:35,911 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:23:35,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:23:35,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:23:35,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:23:35,911 INFO L87 Difference]: Start difference. First operand 308396 states and 929669 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:37,759 WARN L205 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2021-06-05 08:23:38,631 WARN L205 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-06-05 08:23:39,410 WARN L205 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-06-05 08:23:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:23:40,673 INFO L93 Difference]: Finished difference Result 354886 states and 1066916 transitions. [2021-06-05 08:23:40,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 08:23:40,673 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:23:40,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:23:41,262 INFO L225 Difference]: With dead ends: 354886 [2021-06-05 08:23:41,263 INFO L226 Difference]: Without dead ends: 354796 [2021-06-05 08:23:41,263 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 3115.6ms TimeCoverageRelationStatistics Valid=221, Invalid=1419, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 08:23:41,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354796 states. [2021-06-05 08:23:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354796 to 308404. [2021-06-05 08:23:46,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308404 states, 308401 states have (on average 3.014555724527482) internal successors, (929692), 308403 states have internal predecessors, (929692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308404 states to 308404 states and 929692 transitions. [2021-06-05 08:23:48,345 INFO L78 Accepts]: Start accepts. Automaton has 308404 states and 929692 transitions. Word has length 86 [2021-06-05 08:23:48,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:23:48,349 INFO L482 AbstractCegarLoop]: Abstraction has 308404 states and 929692 transitions. [2021-06-05 08:23:48,349 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 308404 states and 929692 transitions. [2021-06-05 08:23:48,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:23:48,418 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:23:48,418 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:23:48,634 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:23:48,634 INFO L430 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:23:48,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:23:48,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1190581478, now seen corresponding path program 13 times [2021-06-05 08:23:48,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:23:48,635 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245770635] [2021-06-05 08:23:48,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:23:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:23:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:23:48,798 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:23:48,798 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245770635] [2021-06-05 08:23:48,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245770635] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:23:48,798 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823668817] [2021-06-05 08:23:48,799 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 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 08:23:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:23:48,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 08:23:48,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:23:48,890 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 08:23:48,891 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:48,893 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:48,893 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:48,894 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:23:48,922 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:23:48,923 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 08:23:48,924 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:48,929 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:48,930 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 08:23:48,930 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2021-06-05 08:23:48,992 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:23:48,992 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 08:23:48,994 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:48,999 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:49,000 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 08:23:49,000 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 08:23:49,022 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 21 treesize of output 20 [2021-06-05 08:23:49,023 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:49,027 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:49,028 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 08:23:49,028 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:23:49,048 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 21 treesize of output 20 [2021-06-05 08:23:49,049 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:49,053 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:49,054 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 08:23:49,054 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:23:49,307 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:23:49,307 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 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:23:49,308 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:49,316 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:49,322 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 08:23:49,322 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:27 [2021-06-05 08:23:49,405 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:49,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:23:49,407 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:23:49,419 INFO L628 ElimStorePlain]: treesize reduction 4, result has 81.8 percent of original size [2021-06-05 08:23:49,420 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 08:23:49,420 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2021-06-05 08:23:49,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:23:49,445 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823668817] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:23:49,445 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:23:49,445 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2021-06-05 08:23:49,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315901683] [2021-06-05 08:23:49,445 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 08:23:49,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:23:49,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 08:23:49,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2021-06-05 08:23:49,446 INFO L87 Difference]: Start difference. First operand 308404 states and 929692 transitions. Second operand has 31 states, 31 states have (on average 5.032258064516129) internal successors, (156), 31 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:52,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:23:52,477 INFO L93 Difference]: Finished difference Result 366279 states and 1100193 transitions. [2021-06-05 08:23:52,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-06-05 08:23:52,477 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.032258064516129) internal successors, (156), 31 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 08:23:52,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:23:53,514 INFO L225 Difference]: With dead ends: 366279 [2021-06-05 08:23:53,514 INFO L226 Difference]: Without dead ends: 366169 [2021-06-05 08:23:53,514 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1265.2ms TimeCoverageRelationStatistics Valid=523, Invalid=2447, Unknown=0, NotChecked=0, Total=2970 [2021-06-05 08:23:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366169 states. [2021-06-05 08:23:59,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366169 to 308350. [2021-06-05 08:23:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308350 states, 308347 states have (on average 3.0145453012352967) internal successors, (929526), 308349 states have internal predecessors, (929526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308350 states to 308350 states and 929526 transitions. [2021-06-05 08:24:00,754 INFO L78 Accepts]: Start accepts. Automaton has 308350 states and 929526 transitions. Word has length 86 [2021-06-05 08:24:00,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:24:00,755 INFO L482 AbstractCegarLoop]: Abstraction has 308350 states and 929526 transitions. [2021-06-05 08:24:00,755 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 5.032258064516129) internal successors, (156), 31 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand 308350 states and 929526 transitions. [2021-06-05 08:24:00,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:24:00,797 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:24:00,797 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:24:00,997 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253,32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:24:00,997 INFO L430 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:24:00,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:24:00,998 INFO L82 PathProgramCache]: Analyzing trace with hash 194700022, now seen corresponding path program 14 times [2021-06-05 08:24:00,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:24:00,998 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243065375] [2021-06-05 08:24:00,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:24:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:24:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:24:01,190 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:24:01,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243065375] [2021-06-05 08:24:01,190 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243065375] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:24:01,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895473927] [2021-06-05 08:24:01,190 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 08:24:01,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:24:01,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:24:01,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 08:24:01,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:24:01,276 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 08:24:01,276 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:01,279 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:01,279 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:24:01,279 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:24:01,294 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:24:01,294 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 08:24:01,295 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:01,299 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:01,300 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 08:24:01,300 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:24:01,369 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:24:01,370 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 08:24:01,371 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:01,378 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:01,380 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 08:24:01,381 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:24:01,675 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-06-05 08:24:01,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2021-06-05 08:24:01,676 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:01,689 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:01,692 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:24:01,692 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:48 [2021-06-05 08:24:01,904 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-06-05 08:24:01,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 08:24:01,906 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:01,920 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:01,921 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:24:01,921 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:15 [2021-06-05 08:24:02,284 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-06-05 08:24:02,437 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 08:24:02,438 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:02,441 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 42 treesize of output 21 [2021-06-05 08:24:02,442 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:02,455 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:02,458 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 08:24:02,458 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:45 [2021-06-05 08:24:02,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:24:02,516 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:02,525 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:02,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:24:02,527 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:02,533 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:02,534 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:24:02,534 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:53, output treesize:7 [2021-06-05 08:24:02,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:24:02,537 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895473927] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:24:02,537 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:24:02,537 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 26 [2021-06-05 08:24:02,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230275047] [2021-06-05 08:24:02,537 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:24:02,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:24:02,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:24:02,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:24:02,538 INFO L87 Difference]: Start difference. First operand 308350 states and 929526 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:05,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:24:05,241 INFO L93 Difference]: Finished difference Result 351732 states and 1058112 transitions. [2021-06-05 08:24:05,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 08:24:05,242 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:24:05,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:24:05,911 INFO L225 Difference]: With dead ends: 351732 [2021-06-05 08:24:05,911 INFO L226 Difference]: Without dead ends: 351642 [2021-06-05 08:24:05,911 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 944.3ms TimeCoverageRelationStatistics Valid=305, Invalid=1857, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 08:24:07,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351642 states. [2021-06-05 08:24:12,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351642 to 338008. [2021-06-05 08:24:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338008 states, 338005 states have (on average 3.0119436103016226) internal successors, (1018052), 338007 states have internal predecessors, (1018052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338008 states to 338008 states and 1018052 transitions. [2021-06-05 08:24:14,436 INFO L78 Accepts]: Start accepts. Automaton has 338008 states and 1018052 transitions. Word has length 86 [2021-06-05 08:24:14,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:24:14,437 INFO L482 AbstractCegarLoop]: Abstraction has 338008 states and 1018052 transitions. [2021-06-05 08:24:14,437 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 338008 states and 1018052 transitions. [2021-06-05 08:24:14,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:24:14,500 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:24:14,500 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:24:14,721 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable264 [2021-06-05 08:24:14,721 INFO L430 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:24:14,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:24:14,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1605300390, now seen corresponding path program 15 times [2021-06-05 08:24:14,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:24:14,722 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347495369] [2021-06-05 08:24:14,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:24:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:24:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:24:14,982 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:24:14,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347495369] [2021-06-05 08:24:14,982 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347495369] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:24:14,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751425669] [2021-06-05 08:24:14,982 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 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 08:24:15,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:24:15,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:24:15,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 08:24:15,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:24:15,089 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 08:24:15,090 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:15,092 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:15,093 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:24:15,093 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:24:15,108 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:24:15,108 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 08:24:15,110 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:15,114 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:15,115 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 08:24:15,115 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:24:15,196 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:24:15,197 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 08:24:15,198 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:15,206 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:15,209 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 08:24:15,209 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:24:15,538 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-06-05 08:24:15,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2021-06-05 08:24:15,540 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:15,553 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:15,557 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:24:15,557 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:48 [2021-06-05 08:24:18,140 WARN L205 SmtUtils]: Spent 456.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-06-05 08:24:18,385 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-06-05 08:24:18,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 08:24:18,388 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:18,432 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:18,434 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:24:18,434 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:15 [2021-06-05 08:24:18,587 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 08:24:18,588 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:18,591 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 42 treesize of output 21 [2021-06-05 08:24:18,592 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:18,606 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:18,609 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 08:24:18,609 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:45 [2021-06-05 08:24:19,034 WARN L205 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-05 08:24:19,477 WARN L205 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-05 08:24:19,927 WARN L205 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-05 08:24:19,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:24:19,946 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:19,954 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:19,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:24:19,957 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:19,963 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:19,964 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:24:19,964 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:53, output treesize:7 [2021-06-05 08:24:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:24:19,985 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751425669] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:24:19,985 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:24:19,985 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 28 [2021-06-05 08:24:19,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002010320] [2021-06-05 08:24:19,985 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:24:19,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:24:19,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:24:19,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=677, Unknown=1, NotChecked=0, Total=756 [2021-06-05 08:24:19,986 INFO L87 Difference]: Start difference. First operand 338008 states and 1018052 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:25,585 WARN L205 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2021-06-05 08:24:26,503 WARN L205 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2021-06-05 08:24:27,351 WARN L205 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2021-06-05 08:24:28,249 WARN L205 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2021-06-05 08:24:29,542 WARN L205 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2021-06-05 08:24:30,419 WARN L205 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-06-05 08:24:31,316 WARN L205 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 08:24:32,223 WARN L205 SmtUtils]: Spent 885.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2021-06-05 08:24:33,110 WARN L205 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-06-05 08:24:34,037 WARN L205 SmtUtils]: Spent 904.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2021-06-05 08:24:34,975 WARN L205 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2021-06-05 08:24:35,940 WARN L205 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 08:24:36,890 WARN L205 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2021-06-05 08:24:37,911 WARN L205 SmtUtils]: Spent 998.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 08:24:38,810 WARN L205 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 08:24:39,689 WARN L205 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2021-06-05 08:24:40,561 WARN L205 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2021-06-05 08:24:41,451 WARN L205 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2021-06-05 08:24:42,329 WARN L205 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2021-06-05 08:24:45,239 WARN L205 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2021-06-05 08:24:46,073 WARN L205 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-06-05 08:24:46,975 WARN L205 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2021-06-05 08:24:49,952 WARN L205 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2021-06-05 08:24:50,859 WARN L205 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 08:24:51,846 WARN L205 SmtUtils]: Spent 894.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2021-06-05 08:24:52,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:24:52,762 INFO L93 Difference]: Finished difference Result 348594 states and 1049120 transitions. [2021-06-05 08:24:52,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-05 08:24:52,763 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:24:52,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:24:53,686 INFO L225 Difference]: With dead ends: 348594 [2021-06-05 08:24:53,686 INFO L226 Difference]: Without dead ends: 348410 [2021-06-05 08:24:53,687 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 27636.2ms TimeCoverageRelationStatistics Valid=502, Invalid=3036, Unknown=2, NotChecked=0, Total=3540 [2021-06-05 08:24:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348410 states. [2021-06-05 08:24:59,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348410 to 338478. [2021-06-05 08:24:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338478 states, 338475 states have (on average 3.0118768003545315) internal successors, (1019445), 338477 states have internal predecessors, (1019445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338478 states to 338478 states and 1019445 transitions. [2021-06-05 08:25:01,195 INFO L78 Accepts]: Start accepts. Automaton has 338478 states and 1019445 transitions. Word has length 86 [2021-06-05 08:25:01,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:25:01,195 INFO L482 AbstractCegarLoop]: Abstraction has 338478 states and 1019445 transitions. [2021-06-05 08:25:01,195 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand 338478 states and 1019445 transitions. [2021-06-05 08:25:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:25:01,239 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:25:01,239 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:25:01,439 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:25:01,439 INFO L430 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:25:01,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:25:01,440 INFO L82 PathProgramCache]: Analyzing trace with hash -47511104, now seen corresponding path program 16 times [2021-06-05 08:25:01,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:25:01,440 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440085124] [2021-06-05 08:25:01,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:25:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:25:01,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:25:01,617 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:25:01,617 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440085124] [2021-06-05 08:25:01,617 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440085124] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:25:01,617 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638537960] [2021-06-05 08:25:01,617 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 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 08:25:01,684 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:25:01,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:25:01,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 08:25:01,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:25:01,731 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 08:25:01,731 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:01,735 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:01,735 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:25:01,735 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-06-05 08:25:01,769 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:25:01,770 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 21 treesize of output 28 [2021-06-05 08:25:01,772 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:01,780 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:01,780 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 08:25:01,780 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2021-06-05 08:25:01,829 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 08:25:01,830 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:01,839 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-06-05 08:25:01,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:25:01,840 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:01,849 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:01,850 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 2 xjuncts. [2021-06-05 08:25:01,851 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2021-06-05 08:25:01,958 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:25:01,958 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 08:25:01,959 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:01,970 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:25:01,970 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 08:25:01,971 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:01,983 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:01,988 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2021-06-05 08:25:01,988 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2021-06-05 08:25:02,240 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:25:02,241 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 08:25:02,242 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:02,270 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:25:02,270 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 08:25:02,272 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:02,290 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:02,291 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:25:02,292 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2021-06-05 08:25:02,556 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:25:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:25:02,557 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:02,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2021-06-05 08:25:02,563 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:02,586 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:02,604 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:25:02,605 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:104, output treesize:50 [2021-06-05 08:25:03,158 WARN L205 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2021-06-05 08:25:03,165 INFO L446 ElimStorePlain]: Different costs {0=[|#memory_int|], 1=[v_prenex_66]} [2021-06-05 08:25:03,167 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 15 treesize of output 7 [2021-06-05 08:25:03,168 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:03,176 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:03,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:25:03,178 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:03,184 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:03,184 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:25:03,185 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:13 [2021-06-05 08:25:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:25:03,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638537960] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:25:03,197 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:25:03,197 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2021-06-05 08:25:03,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915186283] [2021-06-05 08:25:03,197 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 08:25:03,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:25:03,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 08:25:03,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:25:03,198 INFO L87 Difference]: Start difference. First operand 338478 states and 1019445 transitions. Second operand has 30 states, 30 states have (on average 5.3) internal successors, (159), 30 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:25:07,185 INFO L93 Difference]: Finished difference Result 363781 states and 1093606 transitions. [2021-06-05 08:25:07,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 08:25:07,185 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.3) internal successors, (159), 30 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 08:25:07,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:25:07,878 INFO L225 Difference]: With dead ends: 363781 [2021-06-05 08:25:07,878 INFO L226 Difference]: Without dead ends: 363671 [2021-06-05 08:25:07,878 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 2522.1ms TimeCoverageRelationStatistics Valid=587, Invalid=2953, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 08:25:09,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363671 states. [2021-06-05 08:25:14,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363671 to 338474. [2021-06-05 08:25:14,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338474 states, 338471 states have (on average 3.0118828496385213) internal successors, (1019435), 338473 states have internal predecessors, (1019435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338474 states to 338474 states and 1019435 transitions. [2021-06-05 08:25:15,973 INFO L78 Accepts]: Start accepts. Automaton has 338474 states and 1019435 transitions. Word has length 86 [2021-06-05 08:25:15,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:25:15,973 INFO L482 AbstractCegarLoop]: Abstraction has 338474 states and 1019435 transitions. [2021-06-05 08:25:15,973 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.3) internal successors, (159), 30 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:15,973 INFO L276 IsEmpty]: Start isEmpty. Operand 338474 states and 1019435 transitions. [2021-06-05 08:25:16,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:25:16,016 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:25:16,016 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:25:16,216 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable288 [2021-06-05 08:25:16,217 INFO L430 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:25:16,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:25:16,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1337770396, now seen corresponding path program 17 times [2021-06-05 08:25:16,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:25:16,217 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666480481] [2021-06-05 08:25:16,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:25:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:25:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:25:16,417 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:25:16,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666480481] [2021-06-05 08:25:16,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666480481] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:25:16,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301948690] [2021-06-05 08:25:16,417 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 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 08:25:16,487 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 08:25:16,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:25:16,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 08:25:16,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:25:16,499 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 08:25:16,500 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:16,503 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:16,503 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:25:16,503 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:25:16,533 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:25:16,533 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 08:25:16,534 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:16,543 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:16,544 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 08:25:16,544 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2021-06-05 08:25:16,608 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:25:16,608 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 08:25:16,609 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:16,615 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:16,615 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 08:25:16,615 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 08:25:16,638 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 21 treesize of output 20 [2021-06-05 08:25:16,639 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:16,643 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:16,644 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 08:25:16,644 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:25:16,664 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 21 treesize of output 20 [2021-06-05 08:25:16,665 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:16,670 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:16,670 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 08:25:16,670 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:25:16,950 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:25:16,950 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 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:25:16,951 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:16,959 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:16,964 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 08:25:16,964 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:27 [2021-06-05 08:25:17,005 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 15 treesize of output 7 [2021-06-05 08:25:17,005 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:17,010 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:25:17,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 08:25:17,011 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:17,019 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:17,020 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:25:17,020 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:19 [2021-06-05 08:25:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:25:17,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301948690] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:25:17,047 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:25:17,047 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2021-06-05 08:25:17,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251774861] [2021-06-05 08:25:17,047 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 08:25:17,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:25:17,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 08:25:17,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:25:17,048 INFO L87 Difference]: Start difference. First operand 338474 states and 1019435 transitions. Second operand has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:17,879 WARN L205 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2021-06-05 08:25:20,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:25:20,620 INFO L93 Difference]: Finished difference Result 351737 states and 1057272 transitions. [2021-06-05 08:25:20,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 08:25:20,621 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 08:25:20,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:25:21,228 INFO L225 Difference]: With dead ends: 351737 [2021-06-05 08:25:21,228 INFO L226 Difference]: Without dead ends: 351647 [2021-06-05 08:25:21,229 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 1700.3ms TimeCoverageRelationStatistics Valid=513, Invalid=2457, Unknown=0, NotChecked=0, Total=2970 [2021-06-05 08:25:22,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351647 states. [2021-06-05 08:25:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351647 to 338476. [2021-06-05 08:25:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338476 states, 338473 states have (on average 3.0118798249786543) internal successors, (1019440), 338475 states have internal predecessors, (1019440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338476 states to 338476 states and 1019440 transitions. [2021-06-05 08:25:28,634 INFO L78 Accepts]: Start accepts. Automaton has 338476 states and 1019440 transitions. Word has length 86 [2021-06-05 08:25:28,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:25:28,634 INFO L482 AbstractCegarLoop]: Abstraction has 338476 states and 1019440 transitions. [2021-06-05 08:25:28,635 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 338476 states and 1019440 transitions. [2021-06-05 08:25:28,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:25:28,682 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:25:28,682 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:25:28,882 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable307,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:25:28,882 INFO L430 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:25:28,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:25:28,883 INFO L82 PathProgramCache]: Analyzing trace with hash -376905275, now seen corresponding path program 14 times [2021-06-05 08:25:28,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:25:28,883 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617727191] [2021-06-05 08:25:28,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:25:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:25:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:25:29,729 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:25:29,729 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617727191] [2021-06-05 08:25:29,729 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617727191] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:25:29,729 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267634318] [2021-06-05 08:25:29,729 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 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 08:25:29,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:25:29,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:25:29,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 40 conjunts are in the unsatisfiable core [2021-06-05 08:25:29,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:25:29,869 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 08:25:29,870 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:29,873 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:29,873 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:25:29,873 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:25:29,899 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:25:29,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 08:25:29,900 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:29,904 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:29,905 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 08:25:29,905 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:25:29,978 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:25:29,979 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 08:25:29,980 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:29,988 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:29,991 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 08:25:29,991 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:25:30,276 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:25:30,277 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 08:25:30,278 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:30,285 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:30,286 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 08:25:30,286 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:8 [2021-06-05 08:25:30,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 42 treesize of output 21 [2021-06-05 08:25:30,412 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:30,418 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:30,420 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:25:30,420 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:22 [2021-06-05 08:25:30,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:25:30,515 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:30,517 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:30,518 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 08:25:30,518 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-06-05 08:25:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:25:30,528 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267634318] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:25:30,528 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:25:30,528 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2021-06-05 08:25:30,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987514015] [2021-06-05 08:25:30,528 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:25:30,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:25:30,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:25:30,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:25:30,529 INFO L87 Difference]: Start difference. First operand 338476 states and 1019440 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:25:38,772 INFO L93 Difference]: Finished difference Result 379202 states and 1139489 transitions. [2021-06-05 08:25:38,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-06-05 08:25:38,773 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:25:38,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:25:39,866 INFO L225 Difference]: With dead ends: 379202 [2021-06-05 08:25:39,866 INFO L226 Difference]: Without dead ends: 379060 [2021-06-05 08:25:39,866 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 3893.2ms TimeCoverageRelationStatistics Valid=838, Invalid=3853, Unknown=1, NotChecked=0, Total=4692 [2021-06-05 08:25:40,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379060 states. [2021-06-05 08:25:46,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379060 to 352954. [2021-06-05 08:25:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352954 states, 352951 states have (on average 3.009375239055846) internal successors, (1062162), 352953 states have internal predecessors, (1062162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352954 states to 352954 states and 1062162 transitions. [2021-06-05 08:25:48,486 INFO L78 Accepts]: Start accepts. Automaton has 352954 states and 1062162 transitions. Word has length 86 [2021-06-05 08:25:48,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:25:48,486 INFO L482 AbstractCegarLoop]: Abstraction has 352954 states and 1062162 transitions. [2021-06-05 08:25:48,486 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand 352954 states and 1062162 transitions. [2021-06-05 08:25:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:25:48,533 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:25:48,533 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:25:48,740 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable317,37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:25:48,740 INFO L430 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:25:48,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:25:48,742 INFO L82 PathProgramCache]: Analyzing trace with hash 718043717, now seen corresponding path program 15 times [2021-06-05 08:25:48,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:25:48,742 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127478664] [2021-06-05 08:25:48,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:25:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:25:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:25:48,845 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:25:48,845 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127478664] [2021-06-05 08:25:48,845 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127478664] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:25:48,845 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:25:48,845 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 08:25:48,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56745835] [2021-06-05 08:25:48,845 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:25:48,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:25:48,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:25:48,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-06-05 08:25:48,846 INFO L87 Difference]: Start difference. First operand 352954 states and 1062162 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:51,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:25:51,508 INFO L93 Difference]: Finished difference Result 384486 states and 1155495 transitions. [2021-06-05 08:25:51,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 08:25:51,508 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:25:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:25:52,663 INFO L225 Difference]: With dead ends: 384486 [2021-06-05 08:25:52,664 INFO L226 Difference]: Without dead ends: 384376 [2021-06-05 08:25:52,668 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 346.0ms TimeCoverageRelationStatistics Valid=294, Invalid=1112, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 08:25:53,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384376 states. [2021-06-05 08:25:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384376 to 353030. [2021-06-05 08:25:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353030 states, 353027 states have (on average 3.009412877768556) internal successors, (1062404), 353029 states have internal predecessors, (1062404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353030 states to 353030 states and 1062404 transitions. [2021-06-05 08:26:00,540 INFO L78 Accepts]: Start accepts. Automaton has 353030 states and 1062404 transitions. Word has length 86 [2021-06-05 08:26:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:26:00,540 INFO L482 AbstractCegarLoop]: Abstraction has 353030 states and 1062404 transitions. [2021-06-05 08:26:00,540 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 353030 states and 1062404 transitions. [2021-06-05 08:26:00,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:26:00,588 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:26:00,588 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:26:00,589 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable318 [2021-06-05 08:26:00,589 INFO L430 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:26:00,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:26:00,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1685210341, now seen corresponding path program 16 times [2021-06-05 08:26:00,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:26:00,589 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660031517] [2021-06-05 08:26:00,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:26:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:26:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:26:00,753 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:26:00,753 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660031517] [2021-06-05 08:26:00,753 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660031517] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:26:00,753 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621114553] [2021-06-05 08:26:00,753 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 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 08:26:00,827 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:26:00,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:26:00,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 43 conjunts are in the unsatisfiable core [2021-06-05 08:26:00,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:26:00,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 08:26:00,863 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:00,866 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:00,867 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:26:00,867 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-06-05 08:26:00,898 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:26:00,899 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 21 treesize of output 28 [2021-06-05 08:26:00,901 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:00,908 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:00,909 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 08:26:00,909 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2021-06-05 08:26:00,969 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:26:00,969 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 21 treesize of output 28 [2021-06-05 08:26:00,972 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:00,974 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 08:26:00,975 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:00,995 INFO L628 ElimStorePlain]: treesize reduction 8, result has 84.0 percent of original size [2021-06-05 08:26:00,996 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 2 xjuncts. [2021-06-05 08:26:00,996 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2021-06-05 08:26:01,096 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:26:01,096 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 08:26:01,097 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:01,102 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:26:01,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:26:01,104 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:01,117 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:01,118 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:26:01,118 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:28 [2021-06-05 08:26:01,968 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:26:01,968 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 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:26:01,969 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:01,974 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 42 treesize of output 21 [2021-06-05 08:26:01,975 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:01,990 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:01,996 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:26:01,996 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:104, output treesize:50 [2021-06-05 08:26:02,057 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:02,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:26:02,059 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:26:02,061 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 15 treesize of output 7 [2021-06-05 08:26:02,062 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:02,089 INFO L628 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2021-06-05 08:26:02,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:26:02,092 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:02,102 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:02,103 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:26:02,103 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:74, output treesize:17 [2021-06-05 08:26:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:26:02,115 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621114553] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:26:02,115 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:26:02,115 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2021-06-05 08:26:02,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853115067] [2021-06-05 08:26:02,115 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 08:26:02,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:26:02,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 08:26:02,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:26:02,115 INFO L87 Difference]: Start difference. First operand 353030 states and 1062404 transitions. Second operand has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 27 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:26:05,017 INFO L93 Difference]: Finished difference Result 365411 states and 1097865 transitions. [2021-06-05 08:26:05,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 08:26:05,018 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 27 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 08:26:05,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:26:05,653 INFO L225 Difference]: With dead ends: 365411 [2021-06-05 08:26:05,653 INFO L226 Difference]: Without dead ends: 365321 [2021-06-05 08:26:05,653 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 1714.2ms TimeCoverageRelationStatistics Valid=314, Invalid=1578, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 08:26:06,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365321 states. [2021-06-05 08:26:11,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365321 to 353038. [2021-06-05 08:26:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353038 states, 353035 states have (on average 3.009409831886357) internal successors, (1062427), 353037 states have internal predecessors, (1062427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353038 states to 353038 states and 1062427 transitions. [2021-06-05 08:26:13,793 INFO L78 Accepts]: Start accepts. Automaton has 353038 states and 1062427 transitions. Word has length 86 [2021-06-05 08:26:13,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:26:13,793 INFO L482 AbstractCegarLoop]: Abstraction has 353038 states and 1062427 transitions. [2021-06-05 08:26:13,794 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 5.851851851851852) internal successors, (158), 27 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 353038 states and 1062427 transitions. [2021-06-05 08:26:13,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:26:13,837 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:26:13,837 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:26:14,037 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable319 [2021-06-05 08:26:14,038 INFO L430 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:26:14,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:26:14,038 INFO L82 PathProgramCache]: Analyzing trace with hash 726358280, now seen corresponding path program 18 times [2021-06-05 08:26:14,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:26:14,038 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432003488] [2021-06-05 08:26:14,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:26:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:26:14,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:26:14,224 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:26:14,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432003488] [2021-06-05 08:26:14,224 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432003488] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:26:14,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969087548] [2021-06-05 08:26:14,224 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:26:14,292 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 08:26:14,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:26:14,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 08:26:14,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:26:14,304 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 08:26:14,305 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:14,307 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:14,308 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:26:14,308 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:26:14,322 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:26:14,322 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 08:26:14,323 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:14,328 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:14,329 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 08:26:14,329 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:26:14,398 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:26:14,398 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 08:26:14,399 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:14,406 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:14,409 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 08:26:14,409 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:26:14,712 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-06-05 08:26:14,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2021-06-05 08:26:14,713 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:14,726 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:14,729 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:26:14,729 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:48 [2021-06-05 08:26:14,945 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-06-05 08:26:14,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 08:26:14,947 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:14,962 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:14,963 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:26:14,963 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:15 [2021-06-05 08:26:15,561 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 08:26:15,562 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:15,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 42 treesize of output 21 [2021-06-05 08:26:15,566 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:15,579 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:15,581 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 08:26:15,582 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:45 [2021-06-05 08:26:16,003 WARN L205 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-05 08:26:16,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:26:16,020 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:16,029 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:16,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:26:16,031 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:16,037 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:16,038 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:26:16,038 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:53, output treesize:7 [2021-06-05 08:26:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:26:16,041 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969087548] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:26:16,041 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:26:16,041 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 26 [2021-06-05 08:26:16,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871952217] [2021-06-05 08:26:16,041 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:26:16,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:26:16,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:26:16,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:26:16,042 INFO L87 Difference]: Start difference. First operand 353038 states and 1062427 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:17,651 WARN L205 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2021-06-05 08:26:18,526 WARN L205 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-06-05 08:26:19,339 WARN L205 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-06-05 08:26:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:26:20,886 INFO L93 Difference]: Finished difference Result 418218 states and 1255327 transitions. [2021-06-05 08:26:20,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 08:26:20,886 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:26:20,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:26:21,730 INFO L225 Difference]: With dead ends: 418218 [2021-06-05 08:26:21,731 INFO L226 Difference]: Without dead ends: 418128 [2021-06-05 08:26:21,731 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 3238.8ms TimeCoverageRelationStatistics Valid=246, Invalid=1646, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 08:26:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418128 states. [2021-06-05 08:26:28,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418128 to 353326. [2021-06-05 08:26:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353326 states, 353323 states have (on average 3.0093936709469804) internal successors, (1063288), 353325 states have internal predecessors, (1063288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353326 states to 353326 states and 1063288 transitions. [2021-06-05 08:26:30,398 INFO L78 Accepts]: Start accepts. Automaton has 353326 states and 1063288 transitions. Word has length 86 [2021-06-05 08:26:30,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:26:30,398 INFO L482 AbstractCegarLoop]: Abstraction has 353326 states and 1063288 transitions. [2021-06-05 08:26:30,398 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 353326 states and 1063288 transitions. [2021-06-05 08:26:30,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:26:30,440 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:26:30,440 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:26:30,641 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable338 [2021-06-05 08:26:30,641 INFO L430 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:26:30,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:26:30,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1014433203, now seen corresponding path program 17 times [2021-06-05 08:26:30,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:26:30,641 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078711319] [2021-06-05 08:26:30,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:26:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:26:30,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:26:30,737 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:26:30,737 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078711319] [2021-06-05 08:26:30,737 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078711319] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:26:30,737 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:26:30,737 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 08:26:30,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955512421] [2021-06-05 08:26:30,737 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:26:30,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:26:30,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:26:30,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-06-05 08:26:30,738 INFO L87 Difference]: Start difference. First operand 353326 states and 1063288 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:34,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:26:34,849 INFO L93 Difference]: Finished difference Result 554832 states and 1672849 transitions. [2021-06-05 08:26:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 08:26:34,849 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:26:34,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:26:36,177 INFO L225 Difference]: With dead ends: 554832 [2021-06-05 08:26:36,178 INFO L226 Difference]: Without dead ends: 554722 [2021-06-05 08:26:36,178 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 371.3ms TimeCoverageRelationStatistics Valid=320, Invalid=1240, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 08:26:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554722 states. [2021-06-05 08:26:44,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554722 to 364650. [2021-06-05 08:26:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364650 states, 364647 states have (on average 3.0161334112168756) internal successors, (1099824), 364649 states have internal predecessors, (1099824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364650 states to 364650 states and 1099824 transitions. [2021-06-05 08:26:45,365 INFO L78 Accepts]: Start accepts. Automaton has 364650 states and 1099824 transitions. Word has length 86 [2021-06-05 08:26:45,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:26:45,365 INFO L482 AbstractCegarLoop]: Abstraction has 364650 states and 1099824 transitions. [2021-06-05 08:26:45,365 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 364650 states and 1099824 transitions. [2021-06-05 08:26:45,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:26:45,409 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:26:45,410 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:26:45,410 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable349 [2021-06-05 08:26:45,410 INFO L430 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:26:45,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:26:45,410 INFO L82 PathProgramCache]: Analyzing trace with hash 877280035, now seen corresponding path program 18 times [2021-06-05 08:26:45,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:26:45,410 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094218900] [2021-06-05 08:26:45,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:26:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:26:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:26:46,281 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:26:46,282 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094218900] [2021-06-05 08:26:46,282 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094218900] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:26:46,282 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595213646] [2021-06-05 08:26:46,282 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 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 08:26:46,352 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 08:26:46,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:26:46,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 40 conjunts are in the unsatisfiable core [2021-06-05 08:26:46,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:26:46,365 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 08:26:46,365 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:46,368 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:46,368 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:26:46,368 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:26:46,394 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:26:46,394 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 08:26:46,395 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:46,399 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:46,400 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 08:26:46,400 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:26:46,473 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:26:46,473 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 08:26:46,474 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:46,482 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:46,484 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 08:26:46,484 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:26:46,763 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:26:46,763 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 08:26:46,765 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:46,772 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:46,773 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 08:26:46,773 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:8 [2021-06-05 08:26:46,942 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 42 treesize of output 21 [2021-06-05 08:26:46,944 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:46,950 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:46,951 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:26:46,951 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:22 [2021-06-05 08:26:46,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:26:46,992 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:46,995 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:46,996 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 08:26:46,996 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-06-05 08:26:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:26:47,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595213646] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:26:47,006 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:26:47,006 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2021-06-05 08:26:47,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657524270] [2021-06-05 08:26:47,006 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:26:47,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:26:47,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:26:47,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:26:47,007 INFO L87 Difference]: Start difference. First operand 364650 states and 1099824 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:52,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:26:52,617 INFO L93 Difference]: Finished difference Result 546438 states and 1647080 transitions. [2021-06-05 08:26:52,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 08:26:52,618 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:26:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:26:53,708 INFO L225 Difference]: With dead ends: 546438 [2021-06-05 08:26:53,708 INFO L226 Difference]: Without dead ends: 546348 [2021-06-05 08:26:53,709 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 3018.1ms TimeCoverageRelationStatistics Valid=430, Invalid=2119, Unknown=1, NotChecked=0, Total=2550 [2021-06-05 08:26:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546348 states. [2021-06-05 08:27:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546348 to 356170. [2021-06-05 08:27:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356170 states, 356167 states have (on average 3.013176403204115) internal successors, (1073194), 356169 states have internal predecessors, (1073194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356170 states to 356170 states and 1073194 transitions. [2021-06-05 08:27:02,884 INFO L78 Accepts]: Start accepts. Automaton has 356170 states and 1073194 transitions. Word has length 86 [2021-06-05 08:27:02,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:27:02,884 INFO L482 AbstractCegarLoop]: Abstraction has 356170 states and 1073194 transitions. [2021-06-05 08:27:02,884 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 356170 states and 1073194 transitions. [2021-06-05 08:27:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:27:03,634 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:27:03,634 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:27:03,852 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:27:03,853 INFO L430 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:27:03,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:27:03,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1750821138, now seen corresponding path program 19 times [2021-06-05 08:27:03,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:27:03,853 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293934564] [2021-06-05 08:27:03,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:27:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:27:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:27:04,062 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:27:04,062 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293934564] [2021-06-05 08:27:04,062 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293934564] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:27:04,062 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371130666] [2021-06-05 08:27:04,062 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 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 08:27:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:27:04,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 08:27:04,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:27:04,149 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 08:27:04,150 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:04,153 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:04,153 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:27:04,153 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:27:04,192 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:27:04,192 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 08:27:04,194 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:04,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:04,201 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 08:27:04,201 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2021-06-05 08:27:04,271 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:27:04,271 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 08:27:04,272 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:04,278 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:04,279 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 08:27:04,279 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 08:27:04,303 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 21 treesize of output 20 [2021-06-05 08:27:04,304 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:04,308 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:04,309 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 08:27:04,309 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:27:04,329 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 21 treesize of output 20 [2021-06-05 08:27:04,330 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:04,334 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:04,335 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 08:27:04,335 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:27:04,654 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:27:04,655 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 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:27:04,656 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:04,663 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:04,670 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 08:27:04,670 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:27 [2021-06-05 08:27:04,717 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 15 treesize of output 7 [2021-06-05 08:27:04,718 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:04,723 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:27:04,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 08:27:04,724 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:04,731 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:04,732 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:27:04,732 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:19 [2021-06-05 08:27:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:27:04,760 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371130666] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:27:04,760 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:27:04,760 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2021-06-05 08:27:04,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056835379] [2021-06-05 08:27:04,760 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 08:27:04,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:27:04,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 08:27:04,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:27:04,761 INFO L87 Difference]: Start difference. First operand 356170 states and 1073194 transitions. Second operand has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:11,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:27:11,508 INFO L93 Difference]: Finished difference Result 511727 states and 1537382 transitions. [2021-06-05 08:27:11,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-05 08:27:11,509 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 08:27:11,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:27:12,450 INFO L225 Difference]: With dead ends: 511727 [2021-06-05 08:27:12,450 INFO L226 Difference]: Without dead ends: 511637 [2021-06-05 08:27:12,451 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1795.1ms TimeCoverageRelationStatistics Valid=733, Invalid=3173, Unknown=0, NotChecked=0, Total=3906 [2021-06-05 08:27:13,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511637 states. [2021-06-05 08:27:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511637 to 366584. [2021-06-05 08:27:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366584 states, 366581 states have (on average 3.015527264097157) internal successors, (1105435), 366583 states have internal predecessors, (1105435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366584 states to 366584 states and 1105435 transitions. [2021-06-05 08:27:22,263 INFO L78 Accepts]: Start accepts. Automaton has 366584 states and 1105435 transitions. Word has length 86 [2021-06-05 08:27:22,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:27:22,263 INFO L482 AbstractCegarLoop]: Abstraction has 366584 states and 1105435 transitions. [2021-06-05 08:27:22,263 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:22,263 INFO L276 IsEmpty]: Start isEmpty. Operand 366584 states and 1105435 transitions. [2021-06-05 08:27:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:27:22,314 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:27:22,314 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:27:22,515 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable351,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:27:22,515 INFO L430 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:27:22,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:27:22,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1952605709, now seen corresponding path program 19 times [2021-06-05 08:27:22,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:27:22,515 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997226207] [2021-06-05 08:27:22,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:27:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:27:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:27:22,686 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:27:22,686 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997226207] [2021-06-05 08:27:22,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997226207] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:27:22,686 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265582869] [2021-06-05 08:27:22,686 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 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 08:27:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:27:22,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 08:27:22,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:27:22,770 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 08:27:22,770 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:22,773 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:22,773 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:27:22,773 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:27:22,812 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:27:22,813 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 08:27:22,814 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:22,819 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:22,820 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 08:27:22,821 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2021-06-05 08:27:22,885 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:27:22,885 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 08:27:22,887 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:22,892 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:22,893 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 08:27:22,893 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 08:27:22,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:27:22,918 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:22,922 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:22,923 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 08:27:22,923 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:27:22,946 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 21 treesize of output 20 [2021-06-05 08:27:22,947 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:22,952 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:22,953 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 08:27:22,953 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:27:23,240 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:27:23,240 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 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:27:23,241 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:23,251 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:23,254 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 08:27:23,254 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:27 [2021-06-05 08:27:23,298 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:23,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:27:23,300 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:27:23,301 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 15 treesize of output 7 [2021-06-05 08:27:23,302 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:23,318 INFO L628 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2021-06-05 08:27:23,318 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 08:27:23,318 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:13 [2021-06-05 08:27:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:27:23,342 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265582869] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:27:23,342 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:27:23,342 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2021-06-05 08:27:23,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436069224] [2021-06-05 08:27:23,342 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 08:27:23,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:27:23,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 08:27:23,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2021-06-05 08:27:23,343 INFO L87 Difference]: Start difference. First operand 366584 states and 1105435 transitions. Second operand has 31 states, 31 states have (on average 5.064516129032258) internal successors, (157), 31 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:28,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:27:28,094 INFO L93 Difference]: Finished difference Result 478989 states and 1441225 transitions. [2021-06-05 08:27:28,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-06-05 08:27:28,094 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.064516129032258) internal successors, (157), 31 states have internal predecessors, (157), 0 states have call successors, (0), 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 86 [2021-06-05 08:27:28,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:27:29,096 INFO L225 Difference]: With dead ends: 478989 [2021-06-05 08:27:29,097 INFO L226 Difference]: Without dead ends: 478809 [2021-06-05 08:27:29,097 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1664 ImplicationChecksByTransitivity, 2124.3ms TimeCoverageRelationStatistics Valid=895, Invalid=4805, Unknown=0, NotChecked=0, Total=5700 [2021-06-05 08:27:30,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478809 states. [2021-06-05 08:27:37,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478809 to 410368. [2021-06-05 08:27:38,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410368 states, 410365 states have (on average 3.0247048359387376) internal successors, (1241233), 410367 states have internal predecessors, (1241233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:40,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410368 states to 410368 states and 1241233 transitions. [2021-06-05 08:27:40,557 INFO L78 Accepts]: Start accepts. Automaton has 410368 states and 1241233 transitions. Word has length 86 [2021-06-05 08:27:40,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:27:40,558 INFO L482 AbstractCegarLoop]: Abstraction has 410368 states and 1241233 transitions. [2021-06-05 08:27:40,558 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 5.064516129032258) internal successors, (157), 31 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:40,558 INFO L276 IsEmpty]: Start isEmpty. Operand 410368 states and 1241233 transitions. [2021-06-05 08:27:40,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:27:40,623 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:27:40,623 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:27:40,837 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable361,42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:27:40,837 INFO L430 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:27:40,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:27:40,838 INFO L82 PathProgramCache]: Analyzing trace with hash -338865382, now seen corresponding path program 20 times [2021-06-05 08:27:40,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:27:40,838 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180976825] [2021-06-05 08:27:40,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:27:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:27:41,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:27:41,091 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:27:41,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180976825] [2021-06-05 08:27:41,091 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180976825] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:27:41,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369598334] [2021-06-05 08:27:41,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:27:41,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:27:41,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:27:41,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 08:27:41,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:27:41,242 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 08:27:41,243 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:41,245 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:41,245 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:27:41,246 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:27:41,274 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:27:41,274 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 08:27:41,275 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:41,280 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:41,281 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 08:27:41,281 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:27:41,353 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:27:41,353 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 08:27:41,355 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:41,362 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:41,365 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 08:27:41,365 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:27:42,334 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-06-05 08:27:42,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2021-06-05 08:27:42,336 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:42,348 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:42,352 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:27:42,352 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:48 [2021-06-05 08:27:42,574 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-06-05 08:27:42,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 08:27:42,577 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:42,591 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:42,593 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:27:42,593 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:15 [2021-06-05 08:27:42,793 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 08:27:42,794 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:42,797 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 42 treesize of output 21 [2021-06-05 08:27:42,797 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:42,810 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:42,813 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 08:27:42,813 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:45 [2021-06-05 08:27:43,253 WARN L205 SmtUtils]: Spent 409.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-05 08:27:43,709 WARN L205 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-05 08:27:43,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:27:43,727 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:43,737 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:43,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:27:43,740 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:43,748 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:43,749 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:27:43,749 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:53, output treesize:7 [2021-06-05 08:27:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:27:43,774 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369598334] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:27:43,774 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:27:43,774 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 28 [2021-06-05 08:27:43,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677434773] [2021-06-05 08:27:43,775 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:27:43,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:27:43,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:27:43,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2021-06-05 08:27:43,775 INFO L87 Difference]: Start difference. First operand 410368 states and 1241233 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:45,447 WARN L205 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-06-05 08:27:46,377 WARN L205 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2021-06-05 08:27:47,384 WARN L205 SmtUtils]: Spent 903.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2021-06-05 08:27:48,399 WARN L205 SmtUtils]: Spent 916.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2021-06-05 08:27:49,324 WARN L205 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2021-06-05 08:27:50,303 WARN L205 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 08:27:51,326 WARN L205 SmtUtils]: Spent 864.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-06-05 08:27:52,262 WARN L205 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 08:27:53,265 WARN L205 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2021-06-05 08:27:54,158 WARN L205 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 08:27:55,087 WARN L205 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 08:27:56,087 WARN L205 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2021-06-05 08:27:57,047 WARN L205 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2021-06-05 08:27:57,940 WARN L205 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-06-05 08:27:58,968 WARN L205 SmtUtils]: Spent 943.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2021-06-05 08:27:59,921 WARN L205 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2021-06-05 08:28:00,929 WARN L205 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2021-06-05 08:28:01,876 WARN L205 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2021-06-05 08:28:02,794 WARN L205 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 08:28:03,739 WARN L205 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2021-06-05 08:28:04,670 WARN L205 SmtUtils]: Spent 897.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2021-06-05 08:28:05,595 WARN L205 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-06-05 08:28:06,492 WARN L205 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2021-06-05 08:28:07,446 WARN L205 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2021-06-05 08:28:08,488 WARN L205 SmtUtils]: Spent 900.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-06-05 08:28:09,414 WARN L205 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2021-06-05 08:28:10,400 WARN L205 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 08:28:11,340 WARN L205 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2021-06-05 08:28:12,282 WARN L205 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 08:28:13,275 WARN L205 SmtUtils]: Spent 927.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2021-06-05 08:28:14,323 WARN L205 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2021-06-05 08:28:15,447 WARN L205 SmtUtils]: Spent 949.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2021-06-05 08:28:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:17,253 INFO L93 Difference]: Finished difference Result 541400 states and 1629713 transitions. [2021-06-05 08:28:17,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-06-05 08:28:17,253 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:28:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:18,886 INFO L225 Difference]: With dead ends: 541400 [2021-06-05 08:28:18,886 INFO L226 Difference]: Without dead ends: 541206 [2021-06-05 08:28:18,886 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 31188.4ms TimeCoverageRelationStatistics Valid=844, Invalid=5318, Unknown=0, NotChecked=0, Total=6162 [2021-06-05 08:28:20,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541206 states. [2021-06-05 08:28:27,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541206 to 481090. [2021-06-05 08:28:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481090 states, 481087 states have (on average 3.0169324883025315) internal successors, (1451407), 481089 states have internal predecessors, (1451407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481090 states to 481090 states and 1451407 transitions. [2021-06-05 08:28:30,339 INFO L78 Accepts]: Start accepts. Automaton has 481090 states and 1451407 transitions. Word has length 86 [2021-06-05 08:28:30,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:30,339 INFO L482 AbstractCegarLoop]: Abstraction has 481090 states and 1451407 transitions. [2021-06-05 08:28:30,339 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand 481090 states and 1451407 transitions. [2021-06-05 08:28:30,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:28:30,386 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:30,386 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:30,586 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable371,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:28:30,586 INFO L430 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:30,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:30,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1046416118, now seen corresponding path program 21 times [2021-06-05 08:28:30,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:30,587 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233657048] [2021-06-05 08:28:30,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:28:30,788 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:30,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233657048] [2021-06-05 08:28:30,788 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233657048] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:28:30,789 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014553084] [2021-06-05 08:28:30,789 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 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 08:28:30,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:28:30,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:28:30,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 08:28:30,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:28:30,877 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 08:28:30,878 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:30,880 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:30,881 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:28:30,881 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:28:30,896 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:28:30,896 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 08:28:30,897 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:30,901 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:30,902 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 08:28:30,902 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:28:30,973 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:28:30,973 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 08:28:30,975 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:30,982 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:30,985 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 08:28:30,985 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:28:31,677 WARN L205 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2021-06-05 08:28:31,677 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-06-05 08:28:31,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2021-06-05 08:28:31,679 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:31,692 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:31,696 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:28:31,696 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:48 [2021-06-05 08:28:31,912 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-06-05 08:28:31,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 08:28:31,914 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:31,929 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:31,930 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:28:31,930 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:15 [2021-06-05 08:28:32,122 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 42 treesize of output 21 [2021-06-05 08:28:32,123 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:32,126 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 08:28:32,126 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:32,139 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:32,142 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 08:28:32,142 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:45 [2021-06-05 08:28:32,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:28:32,203 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:32,212 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:32,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:28:32,215 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:32,221 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:32,222 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:28:32,222 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:53, output treesize:7 [2021-06-05 08:28:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:28:32,225 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014553084] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:28:32,225 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:28:32,225 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 26 [2021-06-05 08:28:32,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625435980] [2021-06-05 08:28:32,225 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:28:32,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:32,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:28:32,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:28:32,225 INFO L87 Difference]: Start difference. First operand 481090 states and 1451407 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:36,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:36,086 INFO L93 Difference]: Finished difference Result 508956 states and 1534481 transitions. [2021-06-05 08:28:36,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-06-05 08:28:36,087 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:28:36,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:36,999 INFO L225 Difference]: With dead ends: 508956 [2021-06-05 08:28:37,000 INFO L226 Difference]: Without dead ends: 508866 [2021-06-05 08:28:37,000 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1018.5ms TimeCoverageRelationStatistics Valid=318, Invalid=2034, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 08:28:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508866 states. [2021-06-05 08:28:45,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508866 to 494472. [2021-06-05 08:28:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494472 states, 494469 states have (on average 3.0178737190804683) internal successors, (1492245), 494471 states have internal predecessors, (1492245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494472 states to 494472 states and 1492245 transitions. [2021-06-05 08:28:48,477 INFO L78 Accepts]: Start accepts. Automaton has 494472 states and 1492245 transitions. Word has length 86 [2021-06-05 08:28:48,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:48,477 INFO L482 AbstractCegarLoop]: Abstraction has 494472 states and 1492245 transitions. [2021-06-05 08:28:48,477 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 494472 states and 1492245 transitions. [2021-06-05 08:28:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:28:48,528 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:48,528 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:48,728 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable383,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:28:48,729 INFO L430 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:48,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:48,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1684071792, now seen corresponding path program 22 times [2021-06-05 08:28:48,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:48,729 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536864880] [2021-06-05 08:28:48,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:48,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:28:48,883 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:48,883 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536864880] [2021-06-05 08:28:48,883 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536864880] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:28:48,883 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519065010] [2021-06-05 08:28:48,883 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 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 08:28:48,946 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:28:48,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:28:48,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 08:28:48,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:28:48,992 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 08:28:48,993 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:48,996 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:48,997 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:28:48,997 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-06-05 08:28:49,030 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:28:49,030 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 21 treesize of output 28 [2021-06-05 08:28:49,032 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:49,040 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:49,041 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 08:28:49,041 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2021-06-05 08:28:49,107 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:28:49,107 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 21 treesize of output 28 [2021-06-05 08:28:49,109 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:49,112 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 08:28:49,112 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:49,133 INFO L628 ElimStorePlain]: treesize reduction 8, result has 84.0 percent of original size [2021-06-05 08:28:49,134 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 2 xjuncts. [2021-06-05 08:28:49,134 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2021-06-05 08:28:49,242 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:28:49,242 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 08:28:49,243 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:49,254 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:28:49,254 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 08:28:49,255 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:49,268 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:49,271 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2021-06-05 08:28:49,271 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2021-06-05 08:28:49,436 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:28:49,436 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 08:28:49,437 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:49,906 INFO L244 Elim1Store]: Index analysis took 466 ms [2021-06-05 08:28:49,915 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:28:49,915 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 08:28:49,917 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:49,934 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:49,936 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:28:49,936 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:28 [2021-06-05 08:28:50,207 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:28:50,208 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 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:28:50,209 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:50,213 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 42 treesize of output 21 [2021-06-05 08:28:50,214 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:50,230 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:50,236 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:28:50,236 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:104, output treesize:50 [2021-06-05 08:28:50,298 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:50,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:28:50,300 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:28:50,302 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 15 treesize of output 7 [2021-06-05 08:28:50,303 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:50,332 INFO L628 ElimStorePlain]: treesize reduction 9, result has 84.5 percent of original size [2021-06-05 08:28:50,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:28:50,335 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:50,345 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:50,346 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-06-05 08:28:50,347 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:74, output treesize:22 [2021-06-05 08:28:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:28:50,368 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519065010] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:28:50,368 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:28:50,368 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2021-06-05 08:28:50,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565891240] [2021-06-05 08:28:50,369 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 08:28:50,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:50,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 08:28:50,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:28:50,369 INFO L87 Difference]: Start difference. First operand 494472 states and 1492245 transitions. Second operand has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:58,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:58,911 INFO L93 Difference]: Finished difference Result 808081 states and 2420139 transitions. [2021-06-05 08:28:58,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2021-06-05 08:28:58,912 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 0 states have call successors, (0), 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 86 [2021-06-05 08:28:58,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:29:01,067 INFO L225 Difference]: With dead ends: 808081 [2021-06-05 08:29:01,067 INFO L226 Difference]: Without dead ends: 807951 [2021-06-05 08:29:01,068 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3164 ImplicationChecksByTransitivity, 4322.7ms TimeCoverageRelationStatistics Valid=1566, Invalid=8534, Unknown=0, NotChecked=0, Total=10100 [2021-06-05 08:29:02,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807951 states. [2021-06-05 08:29:12,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807951 to 503744. [2021-06-05 08:29:13,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503744 states, 503741 states have (on average 3.0186107543360574) internal successors, (1520598), 503743 states have internal predecessors, (1520598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503744 states to 503744 states and 1520598 transitions. [2021-06-05 08:29:15,373 INFO L78 Accepts]: Start accepts. Automaton has 503744 states and 1520598 transitions. Word has length 86 [2021-06-05 08:29:15,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:29:15,374 INFO L482 AbstractCegarLoop]: Abstraction has 503744 states and 1520598 transitions. [2021-06-05 08:29:15,374 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 503744 states and 1520598 transitions. [2021-06-05 08:29:15,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:29:15,419 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:29:15,419 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:29:15,619 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable394,45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:29:15,619 INFO L430 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:29:15,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:29:15,620 INFO L82 PathProgramCache]: Analyzing trace with hash -833794024, now seen corresponding path program 23 times [2021-06-05 08:29:15,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:29:15,620 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632679824] [2021-06-05 08:29:15,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:29:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:29:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:29:15,772 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:29:15,772 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632679824] [2021-06-05 08:29:15,772 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632679824] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:29:15,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147074460] [2021-06-05 08:29:15,773 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 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 08:29:15,839 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 08:29:15,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:29:15,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 08:29:15,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:29:15,868 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 08:29:15,869 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:15,872 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:15,873 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:29:15,873 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:29:15,906 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:29:15,907 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 08:29:15,908 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:15,913 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:15,914 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 08:29:15,914 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2021-06-05 08:29:15,977 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:29:15,977 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 08:29:15,978 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:15,984 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:15,985 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 08:29:15,985 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 08:29:16,009 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 21 treesize of output 20 [2021-06-05 08:29:16,010 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:16,014 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:16,015 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 08:29:16,015 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:29:16,035 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 21 treesize of output 20 [2021-06-05 08:29:16,036 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:16,041 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:16,041 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 08:29:16,041 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:29:16,327 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:29:16,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:29:16,328 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:16,336 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:16,341 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 08:29:16,341 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:27 [2021-06-05 08:29:16,381 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 15 treesize of output 7 [2021-06-05 08:29:16,382 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:16,386 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:29:16,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 08:29:16,388 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:16,395 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:16,396 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:29:16,396 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:19 [2021-06-05 08:29:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:29:16,428 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147074460] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:29:16,428 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:29:16,428 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2021-06-05 08:29:16,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255502138] [2021-06-05 08:29:16,428 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 08:29:16,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:29:16,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 08:29:16,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:29:16,429 INFO L87 Difference]: Start difference. First operand 503744 states and 1520598 transitions. Second operand has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:29:22,518 INFO L93 Difference]: Finished difference Result 721423 states and 2166575 transitions. [2021-06-05 08:29:22,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-06-05 08:29:22,518 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 08:29:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:29:24,494 INFO L225 Difference]: With dead ends: 721423 [2021-06-05 08:29:24,494 INFO L226 Difference]: Without dead ends: 721333 [2021-06-05 08:29:24,494 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 2059.9ms TimeCoverageRelationStatistics Valid=994, Invalid=3836, Unknown=0, NotChecked=0, Total=4830 [2021-06-05 08:29:25,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721333 states. [2021-06-05 08:29:34,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721333 to 523670. [2021-06-05 08:29:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523670 states, 523667 states have (on average 3.020331622958865) internal successors, (1581648), 523669 states have internal predecessors, (1581648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:37,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523670 states to 523670 states and 1581648 transitions. [2021-06-05 08:29:37,630 INFO L78 Accepts]: Start accepts. Automaton has 523670 states and 1581648 transitions. Word has length 86 [2021-06-05 08:29:37,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:29:37,630 INFO L482 AbstractCegarLoop]: Abstraction has 523670 states and 1581648 transitions. [2021-06-05 08:29:37,630 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 523670 states and 1581648 transitions. [2021-06-05 08:29:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:29:37,681 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:29:37,681 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:29:37,882 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable414 [2021-06-05 08:29:37,882 INFO L430 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:29:37,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:29:37,882 INFO L82 PathProgramCache]: Analyzing trace with hash 983993854, now seen corresponding path program 24 times [2021-06-05 08:29:37,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:29:37,882 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662966512] [2021-06-05 08:29:37,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:29:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:29:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:29:38,040 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:29:38,040 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662966512] [2021-06-05 08:29:38,040 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662966512] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:29:38,040 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047416110] [2021-06-05 08:29:38,040 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 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 08:29:38,104 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 08:29:38,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:29:38,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 08:29:38,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:29:38,116 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 08:29:38,117 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:38,119 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:38,120 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:29:38,120 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:29:38,134 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:29:38,134 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 08:29:38,135 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:38,140 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:38,141 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 08:29:38,141 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:29:38,210 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:29:38,210 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 08:29:38,211 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:38,221 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:38,224 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 08:29:38,224 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:29:38,519 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-06-05 08:29:38,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2021-06-05 08:29:38,520 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:38,533 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:38,536 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:29:38,536 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:48 [2021-06-05 08:29:41,091 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-06-05 08:29:41,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 08:29:41,094 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:41,106 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:41,107 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:29:41,108 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:53, output treesize:8 [2021-06-05 08:29:41,317 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 42 treesize of output 21 [2021-06-05 08:29:41,319 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:41,322 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 08:29:41,323 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:41,338 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:41,342 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 08:29:41,342 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:45 [2021-06-05 08:29:41,801 WARN L205 SmtUtils]: Spent 424.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-05 08:29:41,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:29:41,821 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:41,830 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:41,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:29:41,833 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:41,838 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:41,839 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:29:41,840 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:53, output treesize:7 [2021-06-05 08:29:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:29:41,842 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047416110] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:29:41,842 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:29:41,842 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 26 [2021-06-05 08:29:41,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079571090] [2021-06-05 08:29:41,843 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:29:41,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:29:41,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:29:41,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=577, Unknown=1, NotChecked=0, Total=650 [2021-06-05 08:29:41,843 INFO L87 Difference]: Start difference. First operand 523670 states and 1581648 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:49,027 WARN L205 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2021-06-05 08:29:49,986 WARN L205 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 08:29:51,081 WARN L205 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 08:29:52,099 WARN L205 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 08:29:53,083 WARN L205 SmtUtils]: Spent 961.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 08:29:54,089 WARN L205 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2021-06-05 08:29:55,057 WARN L205 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 08:29:56,075 WARN L205 SmtUtils]: Spent 950.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 08:29:57,088 WARN L205 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2021-06-05 08:30:00,417 WARN L205 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-06-05 08:30:01,316 WARN L205 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 08:30:02,317 WARN L205 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2021-06-05 08:30:03,424 WARN L205 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-06-05 08:30:04,441 WARN L205 SmtUtils]: Spent 949.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2021-06-05 08:30:05,490 WARN L205 SmtUtils]: Spent 960.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 08:30:06,613 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2021-06-05 08:30:10,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:30:10,551 INFO L93 Difference]: Finished difference Result 1042634 states and 3130415 transitions. [2021-06-05 08:30:10,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-06-05 08:30:10,552 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 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 86 [2021-06-05 08:30:10,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:30:13,180 INFO L225 Difference]: With dead ends: 1042634 [2021-06-05 08:30:13,181 INFO L226 Difference]: Without dead ends: 1042554 [2021-06-05 08:30:13,181 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 20987.1ms TimeCoverageRelationStatistics Valid=787, Invalid=3633, Unknown=2, NotChecked=0, Total=4422 [2021-06-05 08:30:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042554 states. [2021-06-05 08:30:29,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042554 to 569868. [2021-06-05 08:30:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569868 states, 569865 states have (on average 3.021447184859572) internal successors, (1721817), 569867 states have internal predecessors, (1721817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:30:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569868 states to 569868 states and 1721817 transitions. [2021-06-05 08:30:31,940 INFO L78 Accepts]: Start accepts. Automaton has 569868 states and 1721817 transitions. Word has length 86 [2021-06-05 08:30:31,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:30:31,940 INFO L482 AbstractCegarLoop]: Abstraction has 569868 states and 1721817 transitions. [2021-06-05 08:30:31,940 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:30:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand 569868 states and 1721817 transitions. [2021-06-05 08:30:31,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:30:31,988 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:30:31,988 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Received shutdown request... [2021-06-05 08:30:32,188 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable424 [2021-06-05 08:30:32,188 INFO L430 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:30:32,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:30:32,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1899017686, now seen corresponding path program 25 times [2021-06-05 08:30:32,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:30:32,189 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040041658] [2021-06-05 08:30:32,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:30:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2021-06-05 08:30:32,193 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1477843519] [2021-06-05 08:30:32,193 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 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 08:30:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:30:32,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 08:30:32,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:30:32,472 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable435,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:30:32,472 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 08:30:32,472 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT (1/2) [2021-06-05 08:30:32,472 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 08:30:32,473 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:30:32,473 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:30:32,473 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:30:32,473 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:30:32,473 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:30:32,473 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:30:32,473 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:30:32,473 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 08:30:32,474 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 128 places, 140 transitions, 292 flow [2021-06-05 08:30:32,474 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 08:30:32,474 INFO L315 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2021-06-05 08:30:32,474 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2021-06-05 08:30:32,476 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 08:30:32,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 08:30:32 BasicIcfg [2021-06-05 08:30:32,476 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 08:30:32,477 INFO L168 Benchmark]: Toolchain (without parser) took 689369.36 ms. Allocated memory was 377.5 MB in the beginning and 16.0 GB in the end (delta: 15.6 GB). Free memory was 339.2 MB in the beginning and 11.1 GB in the end (delta: -10.8 GB). Peak memory consumption was 4.9 GB. Max. memory is 16.0 GB. [2021-06-05 08:30:32,477 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 377.5 MB. Free memory is still 357.5 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 08:30:32,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.57 ms. Allocated memory is still 377.5 MB. Free memory was 338.9 MB in the beginning and 339.1 MB in the end (delta: -160.1 kB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-06-05 08:30:32,477 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.98 ms. Allocated memory is still 377.5 MB. Free memory was 339.1 MB in the beginning and 337.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 08:30:32,477 INFO L168 Benchmark]: Boogie Preprocessor took 14.44 ms. Allocated memory is still 377.5 MB. Free memory was 337.0 MB in the beginning and 335.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 08:30:32,477 INFO L168 Benchmark]: RCFGBuilder took 410.59 ms. Allocated memory is still 377.5 MB. Free memory was 335.9 MB in the beginning and 298.2 MB in the end (delta: 37.8 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.0 GB. [2021-06-05 08:30:32,477 INFO L168 Benchmark]: TraceAbstraction took 688603.02 ms. Allocated memory was 377.5 MB in the beginning and 16.0 GB in the end (delta: 15.6 GB). Free memory was 297.2 MB in the beginning and 11.1 GB in the end (delta: -10.8 GB). Peak memory consumption was 4.8 GB. Max. memory is 16.0 GB. [2021-06-05 08:30:32,477 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.09 ms. Allocated memory is still 377.5 MB. Free memory is still 357.5 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 311.57 ms. Allocated memory is still 377.5 MB. Free memory was 338.9 MB in the beginning and 339.1 MB in the end (delta: -160.1 kB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 24.98 ms. Allocated memory is still 377.5 MB. Free memory was 339.1 MB in the beginning and 337.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 14.44 ms. Allocated memory is still 377.5 MB. Free memory was 337.0 MB in the beginning and 335.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 410.59 ms. Allocated memory is still 377.5 MB. Free memory was 335.9 MB in the beginning and 298.2 MB in the end (delta: 37.8 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 688603.02 ms. Allocated memory was 377.5 MB in the beginning and 16.0 GB in the end (delta: 15.6 GB). Free memory was 297.2 MB in the beginning and 11.1 GB in the end (delta: -10.8 GB). Peak memory consumption was 4.8 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 724]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 2,while TraceCheckSpWp was constructing forward predicates,while QuantifierPusher was running 1 iterations of DualJunctionQuantifierElimination. - TimeoutResultAtElement [Line: 735]: 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 128 places, 140 transitions, 292 flow. Already constructed 2 states. Currently 1 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 124 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9560.0ms, OverallIterations: 6, TraceHistogramMax: 2, EmptinessCheckTime: 22.2ms, AutomataDifference: 5536.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 29.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 683 SDtfs, 2419 SDslu, 3616 SDs, 0 SdLazy, 1923 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1003.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 182 SyntacticMatches, 8 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 5176.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=627occurred in iteration=0, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 72.2ms AutomataMinimizationTime, 6 MinimizatonAttempts, 544 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 53.4ms SsaConstructionTime, 203.6ms SatisfiabilityAnalysisTime, 2745.3ms InterpolantComputationTime, 559 NumberOfCodeBlocks, 559 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 550 ConstructedInterpolants, 61 QuantifiedInterpolants, 5783 SizeOfPredicates, 54 NumberOfNonLiveVariables, 497 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 19/46 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, 170 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 678863.7ms, OverallIterations: 56, TraceHistogramMax: 3, EmptinessCheckTime: 2876.3ms, AutomataDifference: 330752.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1675.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 23666 SDtfs, 73032 SDslu, 199159 SDs, 0 SdLazy, 78989 SolverSat, 3276 SolverUnsat, 31 SolverUnknown, 0 SolverNotchecked, 62272.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6270 GetRequests, 3173 SyntacticMatches, 85 SemanticMatches, 3012 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56354 ImplicationChecksByTransitivity, 200107.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=569868occurred in iteration=55, InterpolantAutomatonStates: 2197, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 271011.6ms AutomataMinimizationTime, 55 MinimizatonAttempts, 2848058 StatesRemovedByMinimization, 54 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 658.1ms SsaConstructionTime, 1189.5ms SatisfiabilityAnalysisTime, 58869.7ms InterpolantComputationTime, 8063 NumberOfCodeBlocks, 7817 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 7965 ConstructedInterpolants, 1512 QuantifiedInterpolants, 141147 SizeOfPredicates, 1016 NumberOfNonLiveVariables, 8382 ConjunctsInSsa, 1733 ConjunctsInUnsatCore, 98 InterpolantComputations, 33 PerfectInterpolantSequences, 414/531 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, 124 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 49.5ms, OverallIterations: 1, TraceHistogramMax: 2, EmptinessCheckTime: 1.1ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=627occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.9ms SsaConstructionTime, 6.5ms SatisfiabilityAnalysisTime, 0.0ms InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 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, 170 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 1.7ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown